An Entropy-Based Hierarchical Search Result Clustering Method by Utilizing Augmented Information
Because of the improvement of the technology of search engines,and the massively increase of the number of web pages,the results returned by the search engines are always mixed and disordered.Especially for the queries with multiple topics,the mixed and disorderly situation of the search results would be more obvious.The search engines can return information of several hundred to thousand of the pages titles,snippets and URLs.Almost all of the technologies about search result clustering must attain further intbrmation from the contents of the returned lists.However,long execution time is not permitted for areal-time clustering system.In this paper we propose some methods with better efficiency to improve the previous technologies.We utilize and augment information that search engines returned and use entropy calculation to attain the term distribution in snippets.We also propose several new methods to attain better clustered search results and reduce execution time.Our experiments indicate that these proposed methods obtain the better clustered results.
Search Engine Clustering Snippet Entropy Augmented Information
Kao Hung-Yu Hsiao Hsin-Wei Lin Chih-Lu Shih Chia-Chun Tsai Tse-Ming
Department of Computer Science and Information Engineering,National Cheng Kung University,Tainan,Tai Innovative Digitech-Enabled Applications & Services Institute (IDEAS),Institute for Information Indu
国际会议
4th Asia Information Retrieval Symposium(AIRS 2008)(第四届亚洲信息检索研讨会)
哈尔滨
英文
670-675
2008-01-16（万方平台首次上网日期，不代表论文的发表时间）