Predicting response probability by embedding questions in online question recommendation

Yuki Hoshino, Makoto Tasaki, Kota Ishizuka, Motoya Azami, Keisuke Mizutani, K. Nakata
{"title":"Predicting response probability by embedding questions in online question recommendation","authors":"Yuki Hoshino, Makoto Tasaki, Kota Ishizuka, Motoya Azami, Keisuke Mizutani, K. Nakata","doi":"10.1109/WI-IAT55865.2022.00042","DOIUrl":null,"url":null,"abstract":"Currently, there are many Q&A sites, including Yahoo! Answers, Quora, and StackOverflow. Although the number of questions posted on these sites is enormous, many remain unanswered. This is detrimental to the user experience, so service operators are motivated to obtain more answers to posted questions. It is also diffcult for users to find specific questions they can answer among the vast number that are asked. Therefore, a system that recommends questions that can be answered by the user is needed. In this study, we first propose a method for predicting response probability. Specifically, we propose a method for learning embedding vectors that takes into account cases in which the required answers are similar, even if the question texts are different, based on a contrastive learning method. We also implemented a recommendation method that increases respondent satisfaction by optimizing and analyzing the theoretical properties of our method. Finally, we conduct an experimental validation of these two methods to demonstrate their effectiveness using data from a Q&A service for child care.","PeriodicalId":345445,"journal":{"name":"2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT55865.2022.00042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Currently, there are many Q&A sites, including Yahoo! Answers, Quora, and StackOverflow. Although the number of questions posted on these sites is enormous, many remain unanswered. This is detrimental to the user experience, so service operators are motivated to obtain more answers to posted questions. It is also diffcult for users to find specific questions they can answer among the vast number that are asked. Therefore, a system that recommends questions that can be answered by the user is needed. In this study, we first propose a method for predicting response probability. Specifically, we propose a method for learning embedding vectors that takes into account cases in which the required answers are similar, even if the question texts are different, based on a contrastive learning method. We also implemented a recommendation method that increases respondent satisfaction by optimizing and analyzing the theoretical properties of our method. Finally, we conduct an experimental validation of these two methods to demonstrate their effectiveness using data from a Q&A service for child care.
通过在在线问题推荐中嵌入问题来预测响应概率
目前,有很多问答网站,包括Yahoo!答案,Quora和StackOverflow。尽管这些网站上发布的问题数量庞大,但许多问题仍未得到解答。这对用户体验是有害的,所以服务运营商有动力去获取更多的问题答案。用户也很难在大量的问题中找到他们可以回答的具体问题。因此,需要一个推荐用户可以回答的问题的系统。在本研究中,我们首次提出了一种预测响应概率的方法。具体来说,我们提出了一种基于对比学习方法的学习嵌入向量的方法,该方法考虑了所需答案相似的情况,即使问题文本不同。我们还实现了一种推荐方法,通过优化和分析我们的方法的理论性质来提高被调查者的满意度。最后,我们对这两种方法进行了实验验证,以证明其有效性,并使用儿童保育问答服务的数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信