Question Routing in Community-based Question Answering websites aims at recommending newly posted questions to potential users who are most likely to provide "accepted answers". Most of the existing approaches predict users' expertise based on their past question answering behavior and the content of new questions. However, these approaches suffer from challenges in three aspects: 1) sparsity of users' past records results in lack of personalized recommendation that at times does not match users' interest or domain expertise, 2) modeling based on all questions and answers content makes periodic updates computationally expensive, and 3) while CQA sites are highly dynamic, they are mostly considered as static. This paper proposes a novel approach to QR that addresses the above challenges. It is based on dynamic modeling of users' activity on topic communities. Experimental results on three real-world datasets demonstrate that the proposed model significantly outperforms competitive baseline models
翻译:以社区为基础的问答网站的提问记录旨在向最有可能提供“接受的答案”的潜在用户建议新张贴的问题。 多数现有办法根据用户过去回答问题的行为和新问题的内容预测用户的专门知识。然而,这些办法在三个方面都面临挑战:(1) 用户过去记录的广度造成用户过去记录缺乏个人化建议,有时不符合用户的兴趣或域域内专门知识;(2) 以所有问答内容为模型,定期更新计算费用很高;(3) 以所有问答内容为模型,定期更新费用很高;(3) CQA网站具有高度的动态,但大多被视为静态的。本文提出了应对上述挑战的对QR的新办法;它基于用户在专题社区活动动态模型;3个真实世界数据集的实验结果表明,拟议的模型大大超出竞争性基准模型。