{"title":"Improving Query Expansion Using Wikipedia","authors":"Lixin Gan, Wei Tu","doi":"10.1109/ICMECG.2014.37","DOIUrl":null,"url":null,"abstract":"Query expansion is one of important technologies used to improve retrieval efficiency. Many studies focus on query expansion with relationships between terms only extracted from the single local domain corpus. In fact, because the single local domain corpus is relatively small, there exist many no-landing terms which have no candidates for query expansion resulting in low retrieval performance. Therefore, to address such problem, relationships between terms captured from Wikipedia are superimposed to the basic Markov network that pre-built using the local domain corpus. A new larger Markov network is formed with more and richer relationships for each term. A graph mining technology, clique, is implemented to measure inter-relationships in Markov network for query expansion. The proposed techniques of superimposed Markov network and clique-based query expansion are benefit to improve precision and recall of information retrieval and to reduce the risk of topic drift.","PeriodicalId":413431,"journal":{"name":"2014 International Conference on Management of e-Commerce and e-Government","volume":"249 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Management of e-Commerce and e-Government","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMECG.2014.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Query expansion is one of important technologies used to improve retrieval efficiency. Many studies focus on query expansion with relationships between terms only extracted from the single local domain corpus. In fact, because the single local domain corpus is relatively small, there exist many no-landing terms which have no candidates for query expansion resulting in low retrieval performance. Therefore, to address such problem, relationships between terms captured from Wikipedia are superimposed to the basic Markov network that pre-built using the local domain corpus. A new larger Markov network is formed with more and richer relationships for each term. A graph mining technology, clique, is implemented to measure inter-relationships in Markov network for query expansion. The proposed techniques of superimposed Markov network and clique-based query expansion are benefit to improve precision and recall of information retrieval and to reduce the risk of topic drift.