基于词重要性的Markov网络查询扩展模型

doi:10.3969/j.issn.1006-2475.2017.11.017

计算机与现代化

基于词重要性的Markov网络查询扩展模型

(江西师范大学计算机信息工程学院，江西南昌 330022)

收稿日期:2017-03-13 出版日期:2017-11-21 发布日期:2017-11-21
作者简介:王千千(1988-)，女，江西南昌人，江西师范大学计算机信息工程学院硕士研究生，研究方向：信息检索，数据挖掘; 罗文兵(1984-)，男，实验师，研究方向：信息检索，自然语言处理。

Markov Network Query Expansion Model Based on Term Importance

(School of Computer Information Engineering, Jiangxi Normal University, Nanchang 330022, China)

Received:2017-03-13 Online:2017-11-21 Published:2017-11-21

摘要/Abstract

摘要： 词项权重已经广泛应用于信息检索模型中，针对传统的词项独立性假设的词袋模型的问题，本文将基于词重要性的词项权重的计算方法应用于Markov网络查询扩展模型中。该词项权重的计算方法须先建立文档的词项图，然后根据词项图得到词项的共现矩阵和词项间的概率转移矩阵，最后利用Markov链的计算方法得到词的权重。将得到的词项权重代入Markov网络扩展模型中，在5个标准数据集上的实验结果表明，采用基于词重要性的Markov网络查询扩展模型的检索结果优于传统的基于词袋的检索结果。

关键词: 词项图, Markov网络, 查询扩展

Abstract: The weight of term has been widely used in models of information retrieved. In order to solve the problem of independence assumption of word bags mode for traditional model, the weight of term based on the importance of term will be used in the Markov network query expansion model. In order to calculate the weight of the term, firstly we must establish the graph-of-word of documents. Then according to the graph-of-word, we get the matrix that terms occur together and the probability transfer matrix between terms. Lastly, we use the chain of Markov to get the weight of term. By putting the weight of term into the Markov network query expansion model, the experiment results on 5 standard datasets show that the search results of using Markov network query expansion model based on term importance are better than those based on traditional model of word bags.

Key words: graph-of-word, Markov network, query expansion

中图分类号:

TP391

王千千，罗文兵. 基于词重要性的Markov网络查询扩展模型[J]. 计算机与现代化, doi: 10.3969/j.issn.1006-2475.2017.11.017.

WANG Qian-qian, LUO Wen-bing. Markov Network Query Expansion Model Based on Term Importance[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2017.11.017.

参考文献

[1] 左家莉. 信息检索中Markov网络图模型研究[D]. 南昌:江西财经大学, 2011.

[2] Cao Guihong, Nie Jianyun, Gao Jianfeng, et al. Selecting good expansion terms for pseudo-relevance feedback[C]// Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 2008:243-250.

[3] Bouchoucha A, He Jing, Nie Jianyun. Diversified query expansion using conceptnet[C]// Proceedings of the 22nd ACM International Conference on Information & Knowledge Management. 2013:1861-1864.

[4] 徐搏,林鸿飞,林原,等. 一种基于排序学习方法的查询扩展技术[J]. 中文信息学报, 2015,29(3):155-161.

[5] 汤皖宁,王明文,万剑怡. 基于文档团的Markov网络检索模型[J]. 计算机研究与发展, 2014,51(10):2248-2254.

[6] 洪欢,王明文,万剑怡,等. 基于迭代方法的多层Markov网络信息检索模型[J]. 中文信息学报, 2013,27(5):122-128.

[7] Rousseau F, Vazirgiannis M. Graph-of-word and TW-IDF: New approach to ad hoc IR[C]// Proceedings of the 22nd ACM International Conference on Information & Knowledge Management. 2013:59-68.

[8] Blanco R, Lioma C. Random walk term weighting for information retrieval[C]// Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 2007:829-830.

[9] 王明文,洪欢,江爱文,等. 基于词重要性的信息检索图模型[J]. 中文信息学报, 2016,30(4):134-141.

[10] Xu Yunpeng, Yi Xing, Zhang Changshui. A random walks method for text classification[C]// Proceedings of the 6th SIAM International Conference on Data Mining. 2006:338-345.

[11] Keikha M, Carman M J, Crestani F. Blog distillation using random walks Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval. 2009:638-639.[C]//

[12] Blanco R, Lioma C. Graph-based term weighting for information retrieval[J]. Information Retrieval, 2012,15(1):54-92.

[13] Lv Yuanhua, Zhai Chengxiang. Lower-bounding term frequency normalization[C]// Proceedings of the 20th ACM International Conference on Information and Knowledge Management. 2011:7-16.

[14] Page L, Brin S, Motwani R, et al. The PageRank Citation Ranking: Bringing Order to the Web[R]. Stanford InfoLab, 1999.

[15] Baeza-Yates R, Ribeiro-Neto B. 现代信息检索[Ｍ]. 黄萱菁,张奇,邱锡鹏译. 北京:机械工业出版社, 2012.

基于词重要性的Markov网络查询扩展模型

Markov Network Query Expansion Model Based on Term Importance

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价

[1]	胡望胜. 基Word Embedding的软件工程领域语义相关词挖掘方法[J]. 计算机与现代化, 2017, 0(9): 19-23,49.
[2]	冯钧，许潇，唐志贤，卞一路. 面向水利信息资源目录服务的分布式语义检索方法研究[J]. 计算机与现代化, 2015, 0(2): 122-.
[3]	田永昌1，李颖2. 基于兴趣模型的查询扩展[J]. 计算机与现代化, 2014, 0(7): 36-39.
[4]	王曼;吴振忠. 基于领域本体的语义搜索——带权最短路径方法[J]. 计算机与现代化, 2013, 1(9): 1-7.
[5]	黄名选;冯平;谢统义. 基于频繁项集挖掘与查询扩展的信息检索系统模型[J]. 计算机与现代化, 2012, 1(200): 53-03.
[6]	曾庆鹏吴水秀. 网络教学平台中问答系统的关键技术研究 [J]. 计算机与现代化, 2010, 1(7): 23-26.