Abstract
Most information retrieval settings, such as web search, are typically precision-oriented, i.e. they focus on retrieving a small number of highly relevant documents. However, in specific domains, such as patent retrieval or law, recall becomes more relevant than precision: in these cases the goal is to find all relevant documents, requiring algorithms to be tuned more towards recall at the cost of precision. This raises important questions with respect to retrievability and search engine bias: depending on how the similarity between a query and documents is measured, certain documents may be more or less retrievable in certain systems, up to some documents not being retrievable at all within common threshold settings. Biases may be oriented towards popularity of documents (increasing weight of references), towards length of documents, favour the use of rare or common words; rely on structural information such as metadata or headings, etc. Existing accessibility measurement techniques are limited as they measure retrievability with respect to all possible queries. In this paper, we improve accessibility measurement by considering sets of relevant and irrelevant queries for each document. This simulates how recall oriented users create their queries when searching for relevant information. We evaluate retrievability scores using a corpus of patents from US Patent and Trademark Office.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Azzopardi, L., Vinay, V.: Retrievability: An evaluation measure for higher order information access tasks. In: Proc. of CIKM 2008, Napa Valley, CA, USA, pp. 561–570 (2008)
Azzopardi, L., Vinay, V.: Accessibility in Information Retrieval. In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., White, R.W. (eds.) ECIR 2008. LNCS, vol. 4956, pp. 482–489. Springer, Heidelberg (2008)
Callen, J., Connell, M.: Query-based sampling of text databases. ACM Transactions on Information Systems 19(2), 97–130 (2001)
Fujii, A., Iwayama, M., Kando, N.: Introduction to the special issue on patent processing. Information Processing and Management: an International Journal 43(5), 1149–1153 (2007)
Fujita, S.: Technology survey and invalidity search: An comparative study of different tasks for Japanese patent document retrieval. Information Processing and Management: an International Journal 43(5), 1154–1172 (2007)
Itoh, H., Mano, H., Ogawa, Y.: Term distillation in patent retrieval. In: Proc. of ACL 2003, Sapporo, Japan, pp. 41–45 (2003)
Konishi, K., Kitauchi, A., Takaki, T.: Invalidity patent search system at NTT data. In: NTCIR 2004: Proceedings of NTCIR-4 Workshop Meeting, Tokyo, Japan (2004)
Konishi, K.: Query terms extraction from patent document for invalidity search. In: NTCIR 2005: Proceedings of NTCIR-5 Workshop Meeting, Tokyo, Japan (2005)
Kontostathis, A., Kulp, S.: The Effect of normalization when recall really matters. In: Proc. of IKE 2008, Las Vegas, Nevada, USA, pp. 96–101 (2008)
Baeza-Yates, R.: Applications of web query mining. In: Losada, D.E., Fernández-Luna, J.M. (eds.) ECIR 2005. LNCS, vol. 3408, pp. 7–22. Springer, Heidelberg (2005)
Robertson, S., Walker, S.: Some simple effective approximations to the 2-Poisson model for probabilistic weighted retrieval. In: Proc. of SIGIR 1994, Dublin, Ireland, pp. 345–354 (1994)
Robertson, S., Zaragoza, H., Taylor, M.: Simple BM25 extension to multiple weighted fields. In: Proc. of CIKM 2004, Washington, D. C., USA, pp. 42–49 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bashir, S., Rauber, A. (2009). Analyzing Document Retrievability in Patent Retrieval Settings. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03573-9_63
Download citation
DOI: https://doi.org/10.1007/978-3-642-03573-9_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03572-2
Online ISBN: 978-3-642-03573-9
eBook Packages: Computer ScienceComputer Science (R0)