Integration of recursive structure of hopfield and ontologies for query expansion

A. Noroozi, R. Malekzadeh
{"title":"Integration of recursive structure of hopfield and ontologies for query expansion","authors":"A. Noroozi, R. Malekzadeh","doi":"10.1109/AISP.2015.7123536","DOIUrl":null,"url":null,"abstract":"One of the ways to enhance the information retrieval performance is query expansion (QE) which means adding some terms to the query in order to reduce mismatch between information needs and retrieved documents. In this way “Query Drift” occurring for ambiguous queries is a common problem. Special case of this problem is “Outweighting” that usually occurs for long queries, that is, some augmented words strongly related to an individual query words but not to the all. In this paper we propose a new method for QE to reduce the effects of disambiguated query terms and decrease query drifting. In proposed method for word outweighting elimination, query terms are grouped based on their semantic relationships. For each group, candidates are fetched from WordNet that relates to the all of words group. Then by using recursive structure of Hopfield network words with the most relationship with other words are selected. Moreover, the Term Semantic Network has used to overcome some of the shortcomings of WordNet. Evaluation results on CACM and CERC test collections show that the proposed method is effective and improve 4% and 12% of Mean Average Precision respectively.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"84 9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2015.7123536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

One of the ways to enhance the information retrieval performance is query expansion (QE) which means adding some terms to the query in order to reduce mismatch between information needs and retrieved documents. In this way “Query Drift” occurring for ambiguous queries is a common problem. Special case of this problem is “Outweighting” that usually occurs for long queries, that is, some augmented words strongly related to an individual query words but not to the all. In this paper we propose a new method for QE to reduce the effects of disambiguated query terms and decrease query drifting. In proposed method for word outweighting elimination, query terms are grouped based on their semantic relationships. For each group, candidates are fetched from WordNet that relates to the all of words group. Then by using recursive structure of Hopfield network words with the most relationship with other words are selected. Moreover, the Term Semantic Network has used to overcome some of the shortcomings of WordNet. Evaluation results on CACM and CERC test collections show that the proposed method is effective and improve 4% and 12% of Mean Average Precision respectively.
hopfield递归结构与本体的集成,用于查询扩展
提高信息检索性能的方法之一是查询扩展(query expansion, QE),即在查询中添加一些术语,以减少信息需求与检索文档之间的不匹配。通过这种方式,出现在歧义查询中的“查询漂移”是一个常见问题。这个问题的特殊情况是“权重过大”,这通常发生在长查询中,也就是说,一些与单个查询词密切相关的增强词,而不是与所有查询词密切相关。本文提出了一种减少消歧查询项影响和减少查询漂移的新方法。在该方法中,根据查询词的语义关系对查询词进行分组。对于每个组,从WordNet中获取与所有单词组相关的候选词。然后利用Hopfield网络递归结构选择与其他词关系最密切的词。此外,术语语义网络已经被用来克服WordNet的一些缺点。在ccm和CERC测试集上的评价结果表明,该方法是有效的,平均精度分别提高了4%和12%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信