基于Markov网络的结果重排技术  

Document re-ranking based on Markov network

作　　者：曹瑛[1] 涂伟[2] 甘丽新[3] 

机构地区：[1]江西理工大学现代教育技术及信息中心,江西赣州341000 [2]江西科技师范大学光电子与通信重点试验室,江西南昌330038 [3]江西科技师范大学文科综合实验中心,江西南昌330038

出　　处：《重庆邮电大学学报（自然科学版）》2013年第6期859-864,共6页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(61201456);江西省自然科学基金(20122BAB211032);江西省高校人文社会科学研究青年基金(JC1312);江西省省级立项教改课题(JXJG-12-6-19)~~

摘　　要：信息检索中通过网页链接信息提取文档内部关系进行搜索结果重排可以提升检索系统的性能。通过Markov网络来展现文档内部关系,该网络更直观地解释了文档间的语义相关性,利用这种文档内部语义关系计算文档重要性对检索结果进行重排。根据文档分布特征阐述了Markov文档网络的构造算法,讨论了Top-k及其相关文档的重要性评分算法,修正初始检索的文档评分。通过这种方式,既保持了文档图的查询相关性,又丰富了文档内部关系,扩大了重排序范围。实验表明,在多个标准文档集上基于Markov网络的结果重排技术对检索性能有较大的稳定提升。In information retrieval, search results re-ranking can improve retrieval system through internal document rela- tion extracted from webpage link information. In this paper we propose a document re-ranking technique based on Markov network, which can explain the sematic relationship between documents better, and can be used to compute the document importance, which is combined with the initial search results into re-rank stage. First, we analyze the algorithm of con- structing document Markov network, and then explain the scoring method of Top-k and its related documents, to revise the initial retrieval score. The experiment results on several different data sets demonstrate the effectiveness of the proposed document re-ranking method. Compared to the traditional PageRank method, it has stable advantage.

关 键 词：信息检索 结果重排 MARKOV网络 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]