Markov Network Retrieval Model Based on Document Cliques

Tang Wanning; Wang Mingwen; Wan Jianyi

doi:10.7544/issn1000-1239.2014.20130343

Journal of Computer Research and Development > 2014 > 51(10): 2248-2254. > DOI: 10.7544/issn1000-1239.2014.20130343

Tang Wanning, Wang Mingwen, Wan Jianyi. Markov Network Retrieval Model Based on Document Cliques[J]. Journal of Computer Research and Development, 2014, 51(10): 2248-2254. DOI: 10.7544/issn1000-1239.2014.20130343

Citation:

PDF (1344 KB)

Markov Network Retrieval Model Based on Document Cliques

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

More Information

Published Date: September 30, 2014

Graphical Abstract

Abstract

Abstract

The query expansion is an effective way to improve the efficiency of information retrieval. But many of the query expansion methods to select the expansion terms did not take fully account of the correlation between the terms as well as terms and documents, which may reduce retrieval performance.Due to the information of the correlation between terms and documents is able to improve the efficiency of retrieval, this paper calculates the correlation between documents and terms, and mapping terms to documents to build a Markov network retrieval model; and then extracts term clique according to the mapping information. The mappting information is used to divide the term cliques into two categories. One is based on document and another is not based on document.The terms cliques based on document are more relevant with the query topic, so to the terms cliques are given greater weight based on document and the information of the two kinds of terms cliques is used to assist retrieval. Therefore, the method we propose in this paper can make the extension content more relevant to query. Experimental results show the proposed model can improve the retrieval efficiency.
- information retrieval,
- query expansion,
- Markov network,
- retrieval model,
- clique

FullText(HTML)

References (0)

[1]	Wang Mengru, Yao Yunzhi, Xi Zekun, Zhang Jintian, Wang Peng, Xu Ziwen, Zhang Ningyu. Safety Analysis of Large Model Content Generation Based on Knowledge Editing[J]. Journal of Computer Research and Development, 2024, 61(5): 1143-1155. DOI: 10.7544/issn1000-1239.202330965
[2]	Shi Jiaoli, Huang Chuanhe, He Kai, Shen Xieyang, Hua Chao. An Access Control Method Supporting Multi-User Collaborative Edit in Cloud Storage[J]. Journal of Computer Research and Development, 2017, 54(7): 1603-1616. DOI: 10.7544/issn1000-1239.2017.20151135
[3]	Wang Shaopeng, Wen Yingyou, Li Zhi, and Zhao Hong. A Fast Processing Algorithm on Section Disjoint Query of Data Stream[J]. Journal of Computer Research and Development, 2014, 51(5): 1136-1148.
[4]	Zhu Huaijie, Wang Jiaying, Wang Bin, and Yang Xiaochun. Location Privacy Preserving Obstructed Nearest Neighbor Queries[J]. Journal of Computer Research and Development, 2014, 51(1): 115-125.
[5]	Yang Zexue, Hao Zhongxiao. Group Obstacle Nearest Neighbor Query in Spatial Database[J]. Journal of Computer Research and Development, 2013, 50(11): 2455-2462.
[6]	Zhu Yangyong, Dai Dongbo, and Xiong Yun. A Survey of the Research on Similarity Query Technique of Sequence Data[J]. Journal of Computer Research and Development, 2010, 47(2): 264-276.
[7]	Wang Bin, Guo Qing, Li Zhongbo, Yang Xiaochun. Index Structures for Supporting Block Edit Distance[J]. Journal of Computer Research and Development, 2010, 47(1): 191-199.
[8]	Xu Shifeng, Gao Jun, Yang Dongqing, and Wang Tengjiao. Pass-Count-Based Path Query on Big Graph Datasets[J]. Journal of Computer Research and Development, 2010, 47(1): 96-103.
[9]	Yang Yuedong, Wang Lili, and Hao Aimin. Motion String: A Motion Capture Data Representation for Behavior Segmentation[J]. Journal of Computer Research and Development, 2008, 45(3): 527-534.
[10]	He Honghui, Wang Lizhen, and Zhou Lihua. pgi-distance: An Efficient Method Supporting Parallel KNN-join Process[J]. Journal of Computer Research and Development, 2007, 44(10): 1774-1781.