首页> 外文会议>AAAI Conference on Artificial Intelligence >Mining Query Subtopics from Questions in Community Question Answering
【24h】

Mining Query Subtopics from Questions in Community Question Answering

机译:从社区问题回答中的问题挖掘查询子主题

获取原文
获取外文期刊封面目录资料

摘要

This paper proposes mining query subtopics from questions in community question answering (CQA). The subtopics are represented as a number of clusters of questions with keywords summarizing the clusters. The task is unique in that the subtopics from questions can not only facilitate user browsing in CQA search, but also describe aspects of queries from a question-answering perspective. The challenges of the task include how to group semantically similar questions and how to find keywords capable of summarizing the clusters. We formulate the subtopic mining task as a non-negative matrix factorization (NMF) problem and further extend the model of NMF to incorporate question similarity estimated from metadata of CQA into learning. Compared with existing methods, our method can jointly optimize question clustering and keyword extraction and encourage the former task to enhance the latter. Experimental results on large scale real world CQA datasets show that the proposed method significantly outperforms the existing methods in terms of keyword extraction, while achieving a comparable performance to the state-of-the-art methods for question clustering.
机译:本文提出了从社区问题回答(CQA)中的问题中挖掘查询副主题。副主题表示为具有概述群集的关键字的多个问题的群集。任务是唯一的,因为问题来自问题的软数据库不仅可以促进CQA搜索中的用户浏览,而且还可以描述来自问题应答透视的查询的方面。任务的挑战包括如何组分组类似的问题以及如何找到能够概述群集的关键字。我们将子特派电挖掘任务制定为非负矩阵分解(NMF)问题,并进一步扩展了NMF的模型,将从CQA元数据估计的问题相似度结合到学习中。与现有方法相比,我们的方法可以共同优化问题集群和关键词提取,并鼓励前任务加强后者。大规模现实世界CQA数据集的实验结果表明,该方法在关键字提取方面显着优于现有的现有方法,同时实现了对问题集群的最先进方法的可比性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号