Leveraging Topic Specificity and Social Relationships for Expert Finding in Community Question Answering Platforms

• URL: http://arxiv.org/abs/2407.04018v1
• Date: Thu, 04 Jul 2024 15:50:18 GMT
• Title: Leveraging Topic Specificity and Social Relationships for Expert Finding in Community Question Answering Platforms
• Authors: Maddalena Amendola, Andrea Passarella, Raffaele Perego,
• Abstract summary: We present TUEF, a Topic-oriented User-Interaction model for Expert Finding. TUEF integrates content and social data by constructing a multi-layer graph. Experiments show TUEF outperforms all competitors with a minimum performance boost of 42.42% in P@1, 32.73% in NDCG@3, 21.76% in R@5, and 29.81% in MRR.
• Score: 5.723916517485655
• License:
• Abstract: Online Community Question Answering (CQA) platforms have become indispensable tools for users seeking expert solutions to their technical queries. The effectiveness of these platforms relies on their ability to identify and direct questions to the most knowledgeable users within the community, a process known as Expert Finding (EF). EF accuracy is crucial for increasing user engagement and the reliability of provided answers. Despite recent advancements in EF methodologies, blending the diverse information sources available on CQA platforms for effective expert identification remains challenging. In this paper, we present TUEF, a Topic-oriented User-Interaction model for Expert Finding, which aims to fully and transparently leverage the heterogeneous information available within online question-answering communities. TUEF integrates content and social data by constructing a multi-layer graph that maps out user relationships based on their answering patterns on specific topics. By combining these sources of information, TUEF identifies the most relevant and knowledgeable users for any given question and ranks them using learning-to-rank techniques. Our findings indicate that TUEF's topic-oriented model significantly enhances performance, particularly in large communities discussing well-defined topics. Additionally, we show that the interpretable learning-to-rank algorithm integrated into TUEF offers transparency and explainability with minimal performance trade-offs. The exhaustive experiments conducted on six different CQA communities of Stack Exchange show that TUEF outperforms all competitors with a minimum performance boost of 42.42% in P@1, 32.73% in NDCG@3, 21.76% in R@5, and 29.81% in MRR, excelling in both the evaluation approaches present in the previous literature.

Related papers

• GIVE: Structured Reasoning with Knowledge Graph Inspired Veracity Extrapolation [108.2008975785364]
  Graph Inspired Veracity Extrapolation (GIVE) is a novel reasoning framework that integrates the parametric and non-parametric memories. Our method facilitates a more logical and step-wise reasoning approach akin to experts' problem-solving, rather than gold answer retrieval.
  arXiv  Detail & Related papers  (2024-10-11T03:05:06Z)
• Understanding and Addressing Gender Bias in Expert Finding Task [6.239590365208578]
  This study investigates gender bias in state-of-the-art Expert Finding (EF) models. Our findings reveal that models relying on reputation metrics and activity levels disproportionately favor male users. We propose adjustments to EF models that incorporate a more balanced preprocessing strategy and leverage content-based and social network-based information.
  arXiv  Detail & Related papers  (2024-07-07T11:35:23Z)
• EWEK-QA: Enhanced Web and Efficient Knowledge Graph Retrieval for Citation-based Question Answering Systems [103.91826112815384]
  citation-based QA systems are suffering from two shortcomings. They usually rely only on web as a source of extracted knowledge and adding other external knowledge sources can hamper the efficiency of the system. We propose our enhanced web and efficient knowledge graph (KG) retrieval solution (EWEK-QA) to enrich the content of the extracted knowledge fed to the system.
  arXiv  Detail & Related papers  (2024-06-14T19:40:38Z)
• QAGCF: Graph Collaborative Filtering for Q&A Recommendation [58.21387109664593]
  Question and answer (Q&A) platforms usually recommend question-answer pairs to meet users' knowledge acquisition needs. This makes user behaviors more complex, and presents two challenges for Q&A recommendation. We introduce Question & Answer Graph Collaborative Filtering (QAGCF), a graph neural network model that creates separate graphs for collaborative and semantic views.
  arXiv  Detail & Related papers  (2024-06-07T10:52:37Z)
• ExpertQA: Expert-Curated Questions and Attributed Answers [51.68314045809179]
  We conduct human evaluation of responses from a few representative systems along various axes of attribution and factuality. We collect expert-curated questions from 484 participants across 32 fields of study, and then ask the same experts to evaluate generated responses to their own questions. The output of our analysis is ExpertQA, a high-quality long-form QA dataset with 2177 questions spanning 32 fields, along with verified answers and attributions for claims in the answers.
  arXiv  Detail & Related papers  (2023-09-14T16:54:34Z)
• Pay More Attention to Relation Exploration for Knowledge Base Question Answering [17.273836429397203]
  We propose a novel framework, RE-KBQA, that utilizes relations in the knowledge base to enhance entity representation. We show that our framework improves the F1 score by 5.7% from 40.5 to 46.3 on CWQ and 5.8% from 62.8 to 68.5 on WebQSP.
  arXiv  Detail & Related papers  (2023-05-03T13:48:30Z)
• A Unified End-to-End Retriever-Reader Framework for Knowledge-based VQA [67.75989848202343]
  This paper presents a unified end-to-end retriever-reader framework towards knowledge-based VQA. We shed light on the multi-modal implicit knowledge from vision-language pre-training models to mine its potential in knowledge reasoning. Our scheme is able to not only provide guidance for knowledge retrieval, but also drop these instances potentially error-prone towards question answering.
  arXiv  Detail & Related papers  (2022-06-30T02:35:04Z)
• Learning to Expand: Reinforced Pseudo-relevance Feedback Selection for Information-seeking Conversations [47.43989857297574]
  We treat the PRF selection as a learning task and proposed a reinforced learning based method that can be trained in an end-to-end manner without any human annotations. Our model can not only select meaningful PRF terms to expand response candidates but also achieve the best results compared with all the baseline methods on a variety of evaluation metrics.
  arXiv  Detail & Related papers  (2020-11-25T14:33:18Z)
• Review-guided Helpful Answer Identification in E-commerce [38.276241153439955]
  Product-specific community question answering platforms can greatly help address the concerns of potential customers. The user-provided answers on such platforms often vary a lot in their qualities. Helpfulness votes from the community can indicate the overall quality of the answer, but they are often missing.
  arXiv  Detail & Related papers  (2020-03-13T11:34:29Z)
• Enabling the Analysis of Personality Aspects in Recommender Systems [0.0]
  Existing recommender systems mainly focus on exploiting users' feedback, e.g., ratings, and reviews on common items to detect similar users. We call this problem the Data Sparsity With no Feedback on Common Items (DSW-n-FCI) We identify users' personality type implicitly with no burden on users and incorporate it along with users' personal interests and their level of knowledge.
  arXiv  Detail & Related papers  (2020-01-07T23:02:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.