Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhongxia Chen

dblp:194/5288 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-authorDatabases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Recommender systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
explainable recommendation
0.822020
Towards Explainable Conversational Recommendation · IJCAI 2020
Co-Attentive Multi-Task Learning for Explainable Recommendation · IJCAI 2019
Recommender systems › explainable recommendation
explanation generation
0.822020
Towards Explainable Conversational Recommendation · IJCAI 2020
Co-Attentive Multi-Task Learning for Explainable Recommendation · IJCAI 2019
Recommender systems › interactive recommendation
conversational recommendation
0.412020
Towards Explainable Conversational Recommendation · IJCAI 2020
Recommender systems › factorization models
factorization machines
0.312018
xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems · KDD 2018
Recommender systems › click-through rate prediction
feature interaction learning
0.312018
xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems · KDD 2018
Recommender systems › click-through rate prediction › feature interaction learning
high-order feature interaction
0.312018
xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems · KDD 2018

Methods — techniques the papers use, named apart from their topics

multi-task learning · 0.8incremental learning · 0.4encoder-selector-decoder · 0.4co-attention · 0.4recurrent neural network · 0.3convolutional neural network · 0.3compressed interaction network · 0.3
YearPublicationVenuePosition
2020 Towards Explainable Conversational Recommendation
abstract
Recent studies have shown that both accuracy and explainability are important for recommendation. In this paper, we introduce explainable conversational recommendation, which enables incremental improvement of both recommendation accuracy and explanation quality through multi-turn user-model conversation. We show how the problem can be formulated, and design an incremental multi-task learning framework that enables tight collaboration between recommendation prediction, explanation generation, and user feedback integration. We also propose a multi-view feedback integration method to enable effective incremental model update. Empirical results demonstrate that our model not only consistently improves the recommendation accuracy but also generates explanations that fit user interests reflected in the feedbacks.
Zhongxia Chen, Xiting Wang, Xing Xie 0001, Mehul Parsana, Akshay Soni, Xiang Ao 0001, Enhong Chen
IJCAI1
2019 Co-Attentive Multi-Task Learning for Explainable Recommendation
abstract
Despite widespread adoption, recommender systems remain mostly black boxes. Recently, providing explanations about why items are recommended has attracted increasing attention due to its capability to enhance user trust and satisfaction. In this paper, we propose a co-attentive multi-task learning model for explainable recommendation. Our model improves both prediction accuracy and explainability of recommendation by fully exploiting the correlations between the recommendation task and the explanation task. In particular, we design an encoder-selector-decoder architecture inspired by human's information-processing model in cognitive psychology. We also propose a hierarchical co-attentive selector to effectively model the cross knowledge transferred for both tasks. Our model not only enhances prediction accuracy of the recommendation task, but also generates linguistic explanations that are fluent, useful, and highly personalized. Experiments on three public datasets demonstrate the effectiveness of our model.
Zhongxia Chen, Xiting Wang, Xing Xie 0001, Guoqing Bu, Enhong Chen
IJCAI1
2019 Neural Response Generation with Relevant Emotions for Short Text Conversation
Zhongxia Chen, Ruihua Song, Xing Xie 0001, Jian-Yun Nie, Xiting Wang, Enhong Chen
NLPCC (1)1
2019 Personalized Reason Generation for Explainable Song Recommendation
abstract
Personalized recommendation has received a lot of attention as a highly practical research topic. However, existing recommender systems provide the recommendations with a generic statement such as “Customers who bought this item also bought…”. Explainable recommendation, which makes a user aware of why such items are recommended, is in demand. The goal of our research is to make the users feel as if they are receiving recommendations from their friends. To this end, we formulate a new challenging problem called personalized reason generation for explainable recommendation for songs in conversation applications and propose a solution that generates a natural language explanation of the reason for recommending a song to that particular user. For example, if the user is a student, our method can generate an output such as “Campus radio plays this song at noon every day, and I think it sounds wonderful,” which the student may find easy to relate to. In the offline experiments, through manual assessments, the gain of our method is statistically significant on the relevance to songs and personalization to users comparing with baselines. Large-scale online experiments show that our method outperforms manually selected reasons by 8.2% in terms of click-through rate. Evaluation results indicate that our generated reasons are relevant to songs and personalized to users, and they attract users to click the recommendations.
Guoshuai Zhao 0001, Hao Fu 0015, Ruihua Song, Tetsuya Sakai, Zhongxia Chen, Xing Xie 0001, Xueming Qian
ACM Trans. Intell. Syst. Technol.5
2018 xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems
abstract
Combinatorial features are essential for the success of many commercial models. Manually crafting these features usually comes with high cost due to the variety, volume and velocity of raw data in web-scale systems. Factorization based models, which measure interactions in terms of vector product, can learn patterns of combinatorial features automatically and generalize to unseen features as well. With the great success of deep neural networks (DNNs) in various fields, recently researchers have proposed several DNN-based factorization model to learn both low- and high-order feature interactions. Despite the powerful ability of learning an arbitrary function from data, plain DNNs generate feature interactions implicitly and at the bit-wise level. In this paper, we propose a novel Compressed Interaction Network (CIN), which aims to generate feature interactions in an explicit fashion and at the vector-wise level. We show that the CIN share some functionalities with convolutional neural networks (CNNs) and recurrent neural networks (RNNs). We further combine a CIN and a classical DNN into one unified model, and named this new model eXtreme Deep Factorization Machine (xDeepFM). On one hand, the xDeepFM is able to learn certain bounded-degree feature interactions explicitly; on the other hand, it can learn arbitrary low- and high-order feature interactions implicitly. We conduct comprehensive experiments on three real-world datasets. Our results demonstrate that xDeepFM outperforms state-of-the-art models. We have released the source code of xDeepFM at https://github.com/Leavingseason/xDeepFM.
Jianxun Lian, Xiaohuan Zhou, Zhongxia Chen, Xing Xie 0001, Guangzhong Sun
KDD4