J4 ›› 2011, Vol. 46 ›› Issue (5): 54-57.

• Articles • Previous Articles     Next Articles

Extended information retrieval model based on the Markov network cliques

SHI Song1, WANG Ming-wen1, TU Wei2, HE Shi-zhu1   

  1. 1. College of Computer Information Engineering, Jiangxi Normal University, Nanchang 330022, Jiangxi, China;
    2. The Center of Arts Complex Laboratory,  Jiangxi Science & Technology  Normal  University,
    Nanchang 330038, Jiangxi, China
  • Received:2010-12-06 Published:2011-05-25


Query expansion based on global analysis model is a common and effective approach to improve information retrieval performance. First, the Markov network model was built by calculating the similarity between terms. Second, the description of relationship between candidate terms was strengthened, and the clique structure was extracted from the Markov network. Finally, candidate terms and query terms in the clique structure were merged for query expansion. Experimental results showed that query expansion based on the Markov random walk matrix performs better than  query expansion based on the similarity matrix, and query expansion based on the clique extraction method performs better than query expansion based on the general extraction method.

Key words:  query expansion; global analysis; Markov network; clique

No related articles found!
Full text



No Suggested Reading articles found!