Abstract
We will present a new algorithm for improving the retrieval performance using query expansion, based on a hierarchy of clusters. In order to create this hierarchical data structure, a clustering algorithm is executed multiple times with different initial conditions. With the aid of this hierarchical data structure, we have achieved significant improvement in retrieval performance over previously known methods in terms of both recall and precision. In our experiments with Japanese patent data, we have employed a co-clustering algorithm as a clustering method.
This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (C), 16500057, 2004, and by Telecommunication Advancement Foundation (TAF), 2004.
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.
References
Chang, Y., et al.: Conceptual Retrieval based on Feature Clustering of Documents. In: Proc. MF/IR 2002 (2002), available at, http://dcs.vein.hu/CIR/
Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Inc., Chichester (1991)
Cutting, D.R., et al.: Scatter/Gather: A Clustering-based Approach to Browsing Large Document Collections. In: Proc.ACM SIGIR 1992, pp. 318–329 (1993)
Deerwester, S., et al.: Indexing by latent semantic analysis. Journal of the American Society for Information Sciences 41, 391–407 (1990)
Dhillon, I.S., Mallela, S., Modha, D.S.: Information-Theoretic Co-clustering. In: Proc. SIGKDD 2003, pp. 89–98 (2003)
Dhillon, I.S., Guan, Y.: Information Theoretic Clustering of Space Co-Occurrence Data. In: Proc. IEEE ICDM 2003, Melbourne, Florida, USA, pp. 517–520 (November 2003)
Eguchi, K., et al.: Adaptive Query Expansion Based on Clustering Search Results. Transactions of Information Processing Society of Japan 40(5), 2439–2449 (1999)
Kobayashi, M., Aono, M., Takeuchi, H., Samukawa, H.: Matrix computations for information retrieval and major and minor outlier cluster detection. Journal of Computation and Applied Mathematics 143(1-1), 119–129 (2002)
NTCIR (NII-NACSIS Test Collection for IR Systems), http://research.nii.ac.jp/ntcir/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aono, M., Doi, H. (2005). A Method for Query Expansion Using a Hierarchy of Clusters. In: Lee, G.G., Yamada, A., Meng, H., Myaeng, S.H. (eds) Information Retrieval Technology. AIRS 2005. Lecture Notes in Computer Science, vol 3689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562382_37
Download citation
DOI: https://doi.org/10.1007/11562382_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29186-2
Online ISBN: 978-3-540-32001-2
eBook Packages: Computer ScienceComputer Science (R0)