DocumentCode
2665188
Title
Query expansion based on term similarity tree model
Author
Jin, Qianli ; Zhao, Jun ; Xu, Bo
Author_Institution
Inst. of Autom., Nat. Lab. of Pattern Recognition, Beijing, China
fYear
2003
fDate
26-29 Oct. 2003
Firstpage
400
Lastpage
406
Abstract
We propose a new method for query expansion called "term similarity tree model" (TSTM). Term similarity tree is built to represent and estimate similarities between terms. Based on TSTM, we use similarity restriction and overlay restriction to implement query expansion. This method can cluster terms automatically, make the process of query expansion more flexible and controllable, and control noise effectively. In addition, the parameters of TSTM can be adjusted easily to meet the requirements of different types of queries. TREC data is used to test the method. The experiments show that TSTM method outperforms the existing methods in query expansion, such as WordNet-based method, local cooccurrence method and latent semantic indexing (LSI-based) method.
Keywords
pattern clustering; query formulation; query processing; relevance feedback; tree data structures; TREC data; WordNet-based method; latent semantic indexing method; local cooccurrence method; overlay restriction; query expansion; semantic clustering; similarity restriction; term similarity tree model; Automatic control; Automation; Feedback; Frequency; Hardware; Indexing; Information retrieval; Laboratories; Pattern recognition; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Language Processing and Knowledge Engineering, 2003. Proceedings. 2003 International Conference on
Conference_Location
Beijing, China
Print_ISBN
0-7803-7902-0
Type
conf
DOI
10.1109/NLPKE.2003.1275938
Filename
1275938
Link To Document