Improving Query Expansion Using Wikipedia

Lixin Gan, Wei Tu
{"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.
使用维基百科改进查询扩展
查询扩展是提高检索效率的重要技术之一。许多研究集中在查询扩展上,仅从单个局部领域语料库中提取术语之间的关系。事实上,由于单个局部域语料库相对较小,存在许多无着陆词,没有查询扩展的候选项,导致检索性能较低。因此,为了解决这样的问题,从维基百科捕获的术语之间的关系被叠加到使用局部领域语料库预先构建的基本马尔可夫网络上。这样就形成了一个新的更大的马尔可夫网络,每个项都有更多更丰富的关系。在马尔可夫网络中,利用图挖掘技术clique来度量相互关系,实现查询扩展。本文提出的叠加马尔可夫网络和基于团的查询扩展技术有利于提高信息检索的查准率和查全率,降低主题漂移的风险。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信