Proceedings of the eleventh international workshop on Web information and data management
Bibliographic record
Abstract
The ACM CIKM 2009 Workshop on Information and Data Management (WIDM 2009) is the eleventh in a series of workshops on Information and Data Management held in conjunction with the International Conference on Information and Knowledge Management (CIKM). The objective of the workshop is to bring together researchers, industrial practitioners and developers to study how information can be extracted, stored, analyzed, and processed to provide useful information to the end users for various advanced database applications. We hope that these proceedings will serve as a valuable reference for all experts in the field. In response to the call for papers, we received 41 papers from 18 countries: Australia, Brazil, Canada, China, the Czech Republic, Finland, Greece, India, Indonesia, Iran, Italy, Japan, Korea, Malaysia, the Netherlands, Norway, the United States, and Vietnam. Starting from 2005, the workshop has a one-day schedule. This year, we adopted a double-blind review process and all papers were reviewed thoroughly by the program committee and external reviewers. The program committee accepted seven full papers and nine short papers, resulting in a competitive 39% acceptance rate. The 16 accepted papers have been divided into four sessions: Querying, Question Answering and Web Algorithms, Web Information Mining and Extraction Techniques, and Searching, Matching and Browsing. In addition, Professor Dik Lun Lee from the Hong Kong University of Science and Technology will present a keynote talk this year.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".