合并和重新排序来自分布式多个Web源的答案

Hyo-Jung Oh, Jeong Hur, C. Lee, Pum-Mo Ryu, Y. Yoon, Hyunki Kim
{"title":"合并和重新排序来自分布式多个Web源的答案","authors":"Hyo-Jung Oh, Jeong Hur, C. Lee, Pum-Mo Ryu, Y. Yoon, Hyunki Kim","doi":"10.1109/WI-IAT.2011.139","DOIUrl":null,"url":null,"abstract":"Depending on questions, various answering methods and answer sources can be used. In this paper, we build a distributed QA system to handle different types of questions and web sources. When a user question is entered, the broker distributes the question over multiple sub-QAs according to question types. The selected sub-QAs find local optimal candidate answers, and then they are collected in to the answer manager. The merged candidates are re-ranked by adjusting confidence weights based on the question analysis result. The re-ranking algorithm aims to find global optimal answers. We borrow the concept from the margin and slack variables in SVM, and modify to project confidence weights into the same boundary by training. Several experimental results prove reliability of our proposed QA model.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Merging and Re-ranking Answers from Distributed Multiple Web Sources\",\"authors\":\"Hyo-Jung Oh, Jeong Hur, C. Lee, Pum-Mo Ryu, Y. Yoon, Hyunki Kim\",\"doi\":\"10.1109/WI-IAT.2011.139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Depending on questions, various answering methods and answer sources can be used. In this paper, we build a distributed QA system to handle different types of questions and web sources. When a user question is entered, the broker distributes the question over multiple sub-QAs according to question types. The selected sub-QAs find local optimal candidate answers, and then they are collected in to the answer manager. The merged candidates are re-ranked by adjusting confidence weights based on the question analysis result. The re-ranking algorithm aims to find global optimal answers. We borrow the concept from the margin and slack variables in SVM, and modify to project confidence weights into the same boundary by training. Several experimental results prove reliability of our proposed QA model.\",\"PeriodicalId\":128421,\"journal\":{\"name\":\"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI-IAT.2011.139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT.2011.139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

根据问题的不同,可以使用不同的回答方法和答案来源。在本文中,我们构建了一个分布式QA系统来处理不同类型的问题和web资源。当输入用户问题时,代理根据问题类型将问题分发到多个子问答中。选择的子问答找到局部最优候选答案,然后将其收集到答案管理器中。根据问题分析结果调整置信度权重,对合并后的考生进行重新排序。重新排序算法的目的是寻找全局最优答案。我们借鉴了支持向量机中裕度变量和松弛变量的概念,并修改为通过训练将置信度权重投影到同一边界。几个实验结果证明了我们提出的质量保证模型的可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Merging and Re-ranking Answers from Distributed Multiple Web Sources
Depending on questions, various answering methods and answer sources can be used. In this paper, we build a distributed QA system to handle different types of questions and web sources. When a user question is entered, the broker distributes the question over multiple sub-QAs according to question types. The selected sub-QAs find local optimal candidate answers, and then they are collected in to the answer manager. The merged candidates are re-ranked by adjusting confidence weights based on the question analysis result. The re-ranking algorithm aims to find global optimal answers. We borrow the concept from the margin and slack variables in SVM, and modify to project confidence weights into the same boundary by training. Several experimental results prove reliability of our proposed QA model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Slovak Blog Clustering Enhanced by Mining the Web Comments Automatic Face Annotation in News Images by Mining the Web Exploiting Additional Dimensions as Virtual Items on Top-N Recommender Systems Supporting Agent Systems in the Programming Language A Software Agent Framework for Exploiting Demand-Side Consumer Social Networks in Power Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1