Amazing technological breakthrough possible @S-Logix pro@slogix.in

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • pro@slogix.in
  • +91- 81240 01111

Social List

Improving Conversational Recommender Systems via Knowledge Graph based Semantic Fusion - 2020

improving-conversational-recommender-systems-via-knowledge-graph-based-semantic-fusion.jpg

Improving Conversational Recommender Systems via Knowledge Graph based Semantic Fusion | S-Logix

Research Area:  Machine Learning

Abstract:

Conversational recommender systems (CRS) aim to recommend high-quality items to users through interactive conversations. Although several efforts have been made for CRS, two major issues still remain to be solved. First, the conversation data itself lacks of sufficient contextual information for accurately understanding users preference. Second, there is a semantic gap between natural language expression and item-level user preference. To address these issues, we incorporate both word-oriented and entity-oriented knowledge graphs~(KG) to enhance the data representations in CRSs, and adopt Mutual Information Maximization to align the word-level and entity-level semantic spaces. Based on the aligned semantic representations, we further develop a KG-enhanced recommender component for making accurate recommendations, and a KG-enhanced dialog component that can generate informative keywords or entities in the response text. Extensive experiments have demonstrated the effectiveness of our approach in yielding better performance on both recommendation and conversation tasks.

Keywords:  
Conversational Recommender Systems
Knowledge Graph
Semantic Fusion
Recommendation
Conversation tasks

Author(s) Name:  Kun Zhou , Wayne Xin Zhao , Shuqing Bian , Yuanhang Zhou

Journal name:  

Conferrence name:  Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Publisher name:  ACM Libarary

DOI:  10.1145/3394486.3403143

Volume Information: