A method for query expansion using a hierarchy of clusters

Authors:
Masaki Aono;Hironori Doi
Affiliations:
Toyohashi University of Technology, Toyohashi, Aichi-ken, Japan;Toyohashi University of Technology, Toyohashi, Aichi-ken, Japan
Venue:
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
Year:
2005

Citing 4
Cited 1

Elements of information theory

Elements of information theory
Scatter/Gather: a cluster-based approach to browsing large document collections

SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Information Theoretic Clustering of Sparse Co-Occurrence Data

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Information-theoretic co-clustering

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining

A word clustering approach for language model-based sentence retrieval in question answering systems

Proceedings of the 18th ACM conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

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.