• DocumentCode
    3291266
  • Title

    Query Expansion based on Concept Clique for Markov Network Information Retrieval Model

  • Author

    Gan, Lixin ; Wang, Shengqian ; Wang, Mingwen ; Xie, Zhihua ; Zhang, Lin ; Shu, Zhenghua

  • Author_Institution
    Key Lab. of Opt.-Electron. &Commun., Jiangxi Sci. & Technol. Normal Univ., Nanchang
  • Volume
    5
  • fYear
    2008
  • fDate
    18-20 Oct. 2008
  • Firstpage
    29
  • Lastpage
    33
  • Abstract
    Query expansion is a common technique used to improve retrieval effectiveness. In this paper, we propose a novel query expansion technique based on concept clique for Markov network information retrieval model. This technique strengthens the simple relationships between terms in the following two ways:(1) terms in a clique express a similar concept and will be added into query expansion, so that it is effective to expanded into some terms with low similar to query terms but highly related to query topic; (2) query term dependencies are used to select concept cliques as candidates. The selection of concept cliques based on a connected graph is effective to avoid topic drift during expanding polysemous query terms. Experiments on several collections show that new approach makes significant improvements and more effective on collections with polysemous terms.
  • Keywords
    Markov processes; graph theory; query formulation; Markov network information retrieval model; concept clique; connected graph; polysemous query terms; query expansion technique; query term dependencies; query topic; Computer networks; Data mining; Fuzzy systems; Information retrieval; Knowledge engineering; Laboratories; Markov random fields; Optical computing; Optical fiber networks; Thesauri; Markov network; Query expansion; concept clique; connected graph; information;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on
  • Conference_Location
    Jinan Shandong
  • Print_ISBN
    978-0-7695-3305-6
  • Type

    conf

  • DOI
    10.1109/FSKD.2008.648
  • Filename
    4666490