从网络搜索结果中找到答案

Huitao Dou, Qingzhong Li, Yongxin Zhang
{"title":"从网络搜索结果中找到答案","authors":"Huitao Dou, Qingzhong Li, Yongxin Zhang","doi":"10.1109/WISA.2010.26","DOIUrl":null,"url":null,"abstract":"In a variety of domains, the amount of information grows rapidly; new sources and types of information are proliferating. In recent years, the world-wide web information has been growing at a dramatic pace and might have become the most important information source for most people. In daily life, when people encounter some problems, they tend to retrieve the information from the Web search engines. Many business search engines are efficient at identifying the best web sites for any given keyword query. Unfortunately, the information on the web is not always correct. Moreover, different web sites often provide different information on a subject. One headache problem we have to face is how to distinguish between what is true and what is wrong. In this paper, we propose a computational method to find answers from web search results. Intuitively, if a value is provided by many accurate web sites, it is very likely that the value is correct. We adopt an iterative method to compute the accuracy of web sites and the confidence of values. Finally we find the most likely correct answers and return to the users for further choice.","PeriodicalId":122827,"journal":{"name":"2010 Seventh Web Information Systems and Applications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Find Answers from Web Search Results\",\"authors\":\"Huitao Dou, Qingzhong Li, Yongxin Zhang\",\"doi\":\"10.1109/WISA.2010.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a variety of domains, the amount of information grows rapidly; new sources and types of information are proliferating. In recent years, the world-wide web information has been growing at a dramatic pace and might have become the most important information source for most people. In daily life, when people encounter some problems, they tend to retrieve the information from the Web search engines. Many business search engines are efficient at identifying the best web sites for any given keyword query. Unfortunately, the information on the web is not always correct. Moreover, different web sites often provide different information on a subject. One headache problem we have to face is how to distinguish between what is true and what is wrong. In this paper, we propose a computational method to find answers from web search results. Intuitively, if a value is provided by many accurate web sites, it is very likely that the value is correct. We adopt an iterative method to compute the accuracy of web sites and the confidence of values. Finally we find the most likely correct answers and return to the users for further choice.\",\"PeriodicalId\":122827,\"journal\":{\"name\":\"2010 Seventh Web Information Systems and Applications Conference\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Seventh Web Information Systems and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WISA.2010.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Seventh Web Information Systems and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2010.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在各个领域,信息量增长迅速;新的信息来源和类型正在激增。近年来,世界范围内的网络信息以惊人的速度增长,可能已经成为大多数人最重要的信息来源。在日常生活中,当人们遇到一些问题时,他们倾向于从网络搜索引擎中检索信息。许多商业搜索引擎在识别任何给定关键字查询的最佳网站方面效率很高。不幸的是,网上的信息并不总是正确的。此外,不同的网站通常提供不同的主题信息。我们不得不面对的一个令人头痛的问题是如何区分真假。本文提出了一种从网络搜索结果中寻找答案的计算方法。直观地说,如果一个值是由许多准确的网站提供的,那么这个值很可能是正确的。我们采用迭代法计算网站的精度和值的置信度。最后,我们找到最可能的正确答案,并返回给用户进一步选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Find Answers from Web Search Results
In a variety of domains, the amount of information grows rapidly; new sources and types of information are proliferating. In recent years, the world-wide web information has been growing at a dramatic pace and might have become the most important information source for most people. In daily life, when people encounter some problems, they tend to retrieve the information from the Web search engines. Many business search engines are efficient at identifying the best web sites for any given keyword query. Unfortunately, the information on the web is not always correct. Moreover, different web sites often provide different information on a subject. One headache problem we have to face is how to distinguish between what is true and what is wrong. In this paper, we propose a computational method to find answers from web search results. Intuitively, if a value is provided by many accurate web sites, it is very likely that the value is correct. We adopt an iterative method to compute the accuracy of web sites and the confidence of values. Finally we find the most likely correct answers and return to the users for further choice.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信