Bibliographic record
Abstract
There are three main problems when designing an information retrieval (IR) system, namely, uncertainty in the representation of documents and queries, computational complexity, and the diversity of users. An IR system may be designed to be adaptive by allowing the modification of document and query representation. As well, different retrieval methods can be used for different users. The combina-tion of multi-representation of documents and multi-strategy retrieval may provide a Solution for the diversity of users. A widely used Solution for reducing computational costs is cluster-based retrieval. However, the use of document clustering only reduces the dimensionality of documents. The same number of terms is used for the representation of the Clusters. One may reduce the dimensionality of terms by constructing a term hierarchy in parallel to the construction of a document hierarchy. The proposed framework of granular IR enables us to incorporate multi-representation of documents and multi-strategy retrieval. Hence, granular IR may provide a method for developing knowledge based intelligent IR Systems. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.005 | 0.007 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.007 | 0.008 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.017 | 0.006 |
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 source (direct Gemma or distilled Codex), 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".