TREC Pooling and Relevance Judgments
Pooling is the technique that lets the Cranfield evaluation paradigm scale to collections of millions of documents, where judging every document for every topic is impossible. Developed and institutionalized at the US National Institute of Standards and Technology for the Text REtrieval Conference (TREC), pooling gathers the top-ranked documents returned by many participating systems for each topic, merges them into a single pool, has human assessors judge only that pool, and treats every unjudged document as non-relevant. The result is a reusable test collection — documents, topics, and pooled relevance judgments (qrels) — on which new systems can later be scored without further assessment. Pooling is what made large-scale, reproducible retrieval evaluation feasible.
Baca kaedah sepenuhnya
Log masuk dengan akaun percuma untuk membaca bahagian ini.
Peta kaedah
Kejiranan kaedah berkaitan — pilih satu nod untuk meneroka.
Sumber
- Voorhees, E. M., & Harman, D. K. (Eds.). (2005). TREC: Experiment and Evaluation in Information Retrieval. MIT Press. ISBN: 9780262220736
- Manning, C. D., Raghavan, P., & Schütze, H. (2008). Introduction to Information Retrieval. Cambridge University Press. ISBN: 9780521865715
- Cleverdon, C. W. (1967). The Cranfield tests on index language devices. Aslib Proceedings, 19(6), 173-194. DOI: 10.1108/eb050097 ↗
Cara memetik halaman ini
ScholarGate. (2026, June 23). TREC Pooling and Relevance Judgments (Scalable Construction of Reusable Test Collections). ScholarGate. https://scholargate.app/ms/library-information-science/trec-pooling-relevance-judgments
Kaedah yang mana?
Letakkan kaedah ini di sebelah kaedah yang paling rapat dengannya dan baca secara bersebelahan — perpustakaan menyusun buku di atas meja; pilihan terletak pada anda.
- Cranfield Evaluation ParadigmLibrary Information Science↔ banding
- Query Expansion EvaluationLibrary Information Science↔ banding
- Relevance Feedback EvaluationLibrary Information Science↔ banding
Dirujuk oleh
Kaedah serupa
Terjumpa masalah pada halaman ini? Laporkan atau cadangkan pembetulan →