This paper analyzes the shortages of the existing re-ranking methods of the search engine and researches on the similarity between each document and the query, which refers to the other documents of the result set. It presents a re-ranking algorithm based on the inter-documents comparison and shows the documents to the users, according to the descending order of the similarity. The results of the experiments demonstrate that the algorithm has a much better precision than the current re-ranking algorithms.
原福永,郭丽娜,毛伟伟. 基于内部文档比较的重排序算法*[J]. 现代图书情报技术, 2009, 25(11): 49-52.
Yuan Fuyong,Guo Lina,Mao Weiwei. Re-ranking Algorithm Based on the Inter-Documents Comparison. New Technology of Library and Information Service, 2009, 25(11): 49-52.
[1] Wray Buntine, Jaakko Löfström, Sami Perttu, et al.Topic-specific Scoring of Documents for Relevant Retrieval[C]. In: Proceedings of ICML 2005 Workshop 4:Learning in Web Search, Bonn, Germany.2005.
[2]张俊林. Google怎么做(3.搜索结果重排序)[EB/OL].[2009-09-10]. http://blog.csdn.net/malefactor/archive/2006/05/19/745966.aspx.
[3]杨广翔,俞宁,谌莉.搜索引擎结果的重排序方法[J].计算机应用,2005,25(2):306-307.
[4]徐宝文,张卫丰.搜素引擎与信息获取技术[M].北京:清华大学出版社,2003:113-115.
[5]徐金雷,杨晓江.专业搜索引擎的排序算法研究[J].现代图书情报技术,2006(7):20-21