首页 | 官方网站   微博 | 高级检索  
     


Efficient Monte Carlo clustering in subspaces
Authors:Clark F Olson  David C Hunn  Henry J Lyons
Affiliation:1.LRIT-CNRST (URAC No. 29), Faculty of Science,Mohammed V University in Rabat,Rabat,Morocco;2.TIM Team, High School of Technology,Moulay Isma?l University in Meknes,Meknes,Morocco
Abstract:One of the key difficulties for users in information retrieval is to formulate appropriate queries to submit to the search engine. In this paper, we propose an approach to enrich the user’s queries by additional context. We used the Language Model to build the query context, which is composed of the most similar queries to the query to expand and their top-ranked documents. Then, we applied a query expansion approach based on the query context and the Latent Semantic Analyses method. Using a web test collection, we tested our approach on short and long queries. We varied the number of recommended queries and the number of expansion terms to specify the appropriate parameters for the proposed approach. Experimental results show that the proposed approach improves the effectiveness of the information retrieval system by 19.23 % for short queries and 52.94 % for long queries according to the retrieval results using the original users’ queries.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号