Web Search Improvement Based on Proximity and Density of Miltiple Keywords

Chi Tian, Taro Tezuka, S. Oyama, Keishi Tajima, Katsumi Tanaka
{"title":"Web Search Improvement Based on Proximity and Density of Miltiple Keywords","authors":"Chi Tian, Taro Tezuka, S. Oyama, Keishi Tajima, Katsumi Tanaka","doi":"10.1109/ICDEW.2006.164","DOIUrl":null,"url":null,"abstract":"This paper proposes a method to improve the precison of Web retrieval based on proximity and density of keywords for two-keyword queries. In addition, filtering keywords by semantic relationships also be used. We have implemented a system that re-ranks Web search results based on three measures: first-appearance term distance, minimum term distance, and local appearance density. Furthermore, the system enables the user to assign weights to the new rank and original ranks so that the result can be presented in order of the combined rank. We built a prototype user interface in which the user can dynamically change the weights on two different ranks. The result of the experiment showed that our method improves the precision of Web search results for two-keyword queries.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDEW.2006.164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper proposes a method to improve the precison of Web retrieval based on proximity and density of keywords for two-keyword queries. In addition, filtering keywords by semantic relationships also be used. We have implemented a system that re-ranks Web search results based on three measures: first-appearance term distance, minimum term distance, and local appearance density. Furthermore, the system enables the user to assign weights to the new rank and original ranks so that the result can be presented in order of the combined rank. We built a prototype user interface in which the user can dynamically change the weights on two different ranks. The result of the experiment showed that our method improves the precision of Web search results for two-keyword queries.
基于多关键词接近度和密度的Web搜索改进
本文提出了一种基于关键词接近度和密度的双关键词检索方法。此外,还使用了根据语义关系过滤关键字的方法。我们已经实现了一个系统,该系统基于三个度量对Web搜索结果重新排序:首次出现的术语距离、最小术语距离和本地出现密度。此外,系统允许用户为新排名和原始排名分配权重,以便结果可以按照组合排名的顺序呈现。我们建立了一个原型用户界面,用户可以在其中动态改变两个不同等级的权重。实验结果表明,该方法提高了双关键字查询Web搜索结果的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信