Abstract
In this paper we study the impact of query term expansion (QTE) using synonyms on patent document retrieval. We use an automatically generated lexical database from USPTO query logs, called PatNet, which provides synonyms and equivalents for a query term. Our experiments on the CLEF-IP 2010 benchmark dataset show that automatic query expansion using PatNet tends to decrease or only slightly improve the retrieval effectiveness, with no significant improvement. An analysis of the retrieval results shows that PatNet does not have generally a negative effect on the retrieval effectiveness. Recall is drastically improved for query topics, where the baseline queries achieve, on average, only low recall values. But we have not detected any commonality that allows us to characterize these queries. So we recommend using PatNet for semi-automatic QTE in Boolean retrieval, where expanding query terms with synonyms and equivalents with the aim of expanding the query scope is a common practice.
This is a preview of subscription content, log in via an institution to check access.
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
Jochim, C., Lioma, C., Schütze, H.: Expanding queries with term and phrase translations in patent retrieval. In: Hanbury, A., Rauber, A., de Vries, A.P. (eds.) IRFC 2011. LNCS, vol. 6653, pp. 16–29. Springer, Heidelberg (2011)
Kim, Y., Seo, J., Croft, W.B.: Automatic Boolean query suggestion for professional search. In: Proc. of the 34th Int. ACM SIGIR Conf. on Research and Development in Inf. Retrieval (SIGIR 2011), Beijing, China, pp. 825–834 (2011)
Magdy, W., Jones, G.J.F.: PRES: a score metric for evaluating recall-oriented information retrieval applications. In: Proc. of the 33rd Int. ACM SIGIR Conf. on Research and Development in Inf. Retrieval (SIGIR 2010), Geneva, Switzerland, pp. 611–618 (2010)
Magdy, W., Jones, G.J.F.: A study of query expansion methods for patent retrieval. In: Proc. of PaIR 2011, Glasgow, Scotland, pp. 19–24 (2011)
Mahdabi, P., Crestani, F.: Patent Query Formulation by Synthesizing Multiple Sources of Relevance Evidence. Trans. on Inf. Systems 32(4), Article No. 4 (2014)
Silvestri, F.: Mining Query Logs: Turning Search Usage Data into Knowledge. Foundations and Trends in Information Retrieval 4(1–2), 1–174 (2010)
Tannebaum, W., Rauber, A.: Mining query logs of USPTO patent examiners. In: Forner, P., Müller, H., Paredes, R., Rosso, P., Stein, B. (eds.) CLEF 2013. LNCS, vol. 8138, pp. 136–142. Springer, Heidelberg (2013)
Tannebaum, W., Rauber, A.: PatNet: a lexical database for the patent domain. In: Hanbury, A., Kazai, G., Rauber, A., Fuhr, N. (eds.) ECIR 2015. LNCS, vol. 9022, pp. 550–555. Springer, Heidelberg (2015)
Xue, X., Croft, W.: Transforming patents into prior-art queries. In: Proc. of the 32nd Int. ACM SIGIR Conf. on Research and Development in Inf. Retrieval, USA, pp. 808–809 (2009)
Xue, X., Croft, W.: Automatic query generation for patent search. In: Proc. of CIKM 2009, Hong Kong, China, pp. 2037–2040 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Tannebaum, W., Mahdabi, P., Rauber, A. (2015). Effect of Log-Based Query Term Expansion on Retrieval Effectiveness in Patent Searching. In: Mothe, J., et al. Experimental IR Meets Multilinguality, Multimodality, and Interaction. CLEF 2015. Lecture Notes in Computer Science(), vol 9283. Springer, Cham. https://doi.org/10.1007/978-3-319-24027-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-24027-5_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24026-8
Online ISBN: 978-3-319-24027-5
eBook Packages: Computer ScienceComputer Science (R0)