Known-Item Search Success
Known-item search is the case where the user is looking for one specific document they already know exists — a particular paper, book, web page, or record — rather than exploring a topic. Evaluation is correspondingly specialized: with exactly one correct answer per query, the question is simply how high the system ranks that single target. The natural measures are reciprocal rank (and its mean, MRR), success-at-k, and Cooper's expected search length, which counts how many wrong documents the user must wade through before reaching the right one. These metrics, averaged over many known-item topics, give a clean, interpretable picture of how well a system supports re-finding a specific document.
阅读完整方法
使用免费账户登录即可阅读本节。
方法图谱
相关方法的邻域——选择一个节点以展开探索。
来源
- Cooper, W. S. (1968). Expected search length: A single measure of retrieval effectiveness based on the weak ordering action of retrieval systems. American Documentation, 19(1), 30-41. DOI: 10.1002/asi.5090190108 ↗
- Manning, C. D., Raghavan, P., & Schütze, H. (2008). Introduction to Information Retrieval. Cambridge University Press. ISBN: 9780521865715
- Voorhees, E. M., & Harman, D. K. (Eds.). (2005). TREC: Experiment and Evaluation in Information Retrieval. MIT Press. ISBN: 9780262220736
如何引用本页
ScholarGate. (2026, June 23). Known-Item Search Success (Evaluating Retrieval When One Target Document Is Sought). ScholarGate. https://scholargate.app/zh/library-information-science/known-item-search-success
选用哪种方法？
将本方法与其最相近的同类并置，并排研读——本馆将书籍铺陈于案上，取舍则由您定夺。
- Cranfield Evaluation ParadigmLibrary Information Science↔ 比较
- Query Log AnalysisLibrary Information Science↔ 比较
- Search Session AnalysisLibrary Information Science↔ 比较