Computer Science ›› 2015, Vol. 42 ›› Issue (Z6): 479-483.

Previous Articles     Next Articles

Method of Query Expansion Based on LCA Prune Semantic Tree

LI Wei-jiang and WANG Feng   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Searching and finding out useful information from a mass stock in a very short time is becoming a tough tax and many times the user will have to receive a lot of information that may not appear any useful for the users.Problems mainly come from the query which users have provided without enough accuracy,the mismatches of the queries and the expression of the documents,or query optimization.To deal with these problems,this paper proposed a novel hybrid query expansion method which synthesizes the merits of semantic query expansion and local context analysis(LCA).Firstly,we retrieved the documents by LCA method,then used these terms to trim the semantic tree,and calculated the weight of expansion term based on this improved algorithm.We compared the effectiveness of these approaches.And the results show that,although local context analysis has some advantages,the LCA prune semantic tree yields better performance than the techniques on the simple query expansion.

Key words: Query expansion,Local context analysis,Concept tree,Pruning,Relevance algorithm

[1] Sanjuan E,Ibekwe-Sanjuan F.Combining language models with NLP and interactive query expansion[C]∥Proceedings of the Focused Retrieval and Evaluation,and 8th International Confe-rence on Initiative for the Evaluation of XML Retrieval.Berlin,Heidelberg:Springer-Verlag,2010:122-132
[2] Rocchio J J.Document Retrieval Systems-Optimization andEvaluation[D].Harvard,1966
[3] Robertson S E,Jones K S.Relevance weighting of search terms[J].Journal of the American Society for Information Science,1976,27(3):129-146
[4] Attar R,Fraenkel A S.Local feedback in full-text retrieval sys-tems[J].Journal of the Association for Computing Machinery,1977,24(3):397-417
[5] Wu H,Salton G.The estimation of term relevance weights using relevance feedback[J].Journal of Documentation,1981,37(4):194-214
[6] Qiu Y,Frei H P.Concept based query expansion[C]∥Procee-ding of the 16th annual international ACM SIGIR Conference on Research and Development in Information Retrieval.1993:160-169
[7] Crouch C J,Yang B.Experiments in automatic statistical thesaurus construction[C]∥Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval,1992.ACM,1992:77-88
[8] Xu J,Croft W B.Query expansion using local and global document analysis[C]∥Proceeding of Annual International ACM Sigir Conference on Research & Development in Information Retrieval.1996:4-11
[9] Xu J,Croft B.Improving the effectiveness of information re-trieval with local context analysis[J].ACM Transaction on Information Systems,2000,18(1):79-112
[10] Kelly D,Teevan J.Implicit feedback for inferring user prefe-rence:a bibliography[C]∥ACM SIGIR Forum.2003:18-28
[11] Shen X,Tan B,Zhai C.Context-sensitive information retrievalusing implicit feedback[C]∥Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval.2005:43-50
[12] Jones K S.Automatic keyword classification for information retrieval[M].1971
[13] Jing Y F,Croft W B.An association thesaurus for information retrieval[C]∥RIAO Conference Proceedings.1994:146-160
[14] Yahia S B,Jaoua A.Discovering knowledge from fuzzy concept lattice[M]∥Data mining and computational intelligence.Sprin-ger,2001:167-190
[15] Fonseca B M,Golgher P B,De Moura E S,et al.Discoveringsearch engine related queries using association rules[J].Journal of Web Engineering,2003,2(4):215-227
[16] Latiri C C,Yahia S B,Chevallet J P,et al.Query expansion using fuzzy association rules between terms[J].Proceedings of JIM.2003
[17] Cui H,Wen J,Nie J,et al.Query expansion by mining user logs[J].IEEE Transactions on Knowledge and Data Engineering,2003,15(4):829-839

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!