Recommending QA documents for communities of question-answering websites

Duen-Ren Liu*, Chun Kai Huang, Yu Hsuan Chen

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

Question & Answering (Q&A) websites have become an essential knowledge-sharing platform. This platform provides knowledge-community services where users with common interests or expertise can form a knowledge community to collect and share QA documents. However, due to the massive amount of QAs, information overload can become a major problem. Consequently, a recommendation mechanism is needed to recommend QAs for communities of Q&A websites. Existing studies did not investigate the recommendation mechanisms for knowledge collections in communities of Q&A Websites. In this work, we propose a novel recommendation method to recommend related QAs for communities of Q&A websites. The proposed method recommends QAs by considering the community members' reputations, the push scores and collection time of QAs, the complementary relationships between QAs and their relevance to the communities. Experimental results show that the proposed method outperforms other conventional methods, providing a more effective manner to recommend QA documents to knowledge communities.

Original languageEnglish
Pages (from-to)139-147
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Issue numberPART 2
DOIs
StatePublished - 11 Mar 2013
Event5th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2013 - Kuala Lumpur, Malaysia
Duration: 18 Mar 201320 Mar 2013

Keywords

  • Group Recommendation
  • Knowledge Community
  • Knowledge Complementation
  • Link Analysis
  • Question-Answering Websites

Fingerprint

Dive into the research topics of 'Recommending QA documents for communities of question-answering websites'. Together they form a unique fingerprint.

Cite this