CoChat

Explainable Recommendation through Attentive Multi-View Learning

Open access
Gao, Jingyue, Wang, Xiting, Wang, Yasha, Xie, Xing · 2019 · Proceedings of the AAAI Conference on Artificial Intelligence

The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.

Abstract

Recommender systems have been playing an increasingly important role in our daily life due to the explosive growth of information. Accuracy and explainability are two core aspects when we evaluate a recommendation model and have become one of the fundamental trade-offs in machine learning. In this paper, we propose to alleviate the trade-off between accuracy and explainability by developing an explainable deep model that combines the advantages of deep learning-based models and existing explainable methods. The basic idea is to build an initial network based on an explainable deep hierarchy (e.g., Microsoft Concept Graph) and improve the model accuracy by optimizing key variables in the hierarchy (e.g., node importance and relevance). To ensure accurate rating prediction, we propose an attentive multi-view learning framework. The framework enables us to handle sparse and noisy data by co-regularizing among different feature levels and combining predictions attentively. To mine readable explanations from the hierarchy, we formulate personalized explanation generation as a constrained tree node selection problem and propose a dynamic programming algorithm to solve it. Experimental results show that our model outperforms state-of-the-art methods in terms of both accuracy and explainability.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/aaai.v33i01.33013622

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 30 references

Research works printed but not linked: 1

  1. Lee, D. D., and Seung, H. S. 2001. Algorithms for nonnegative matrix factorization. In NIPS , 556-562.

Cited by

See all 150

Metadata

Authors
Gao, J., Wang, X., Wang, Y., & Xie, X.
Affiliations
  • Peking University (CN)
  • Microsoft Research Asia (China) (CN)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2019-07-17
Volume
33
Issue
01
Pages
3622-3629
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W2903340942
Cited by
127
References
30
Citations by year
2026: 4 · 2025: 12 · 2024: 23 · 2023: 13 · 2022: 22 · 2021: 26 · 2020: 21 · 2019: 6
FWCI
14.93
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
  • AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
Funders
National Natural Science Foundation of China (61772045)
Topics
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
Keywords
explainable recommendation, recommender systems, rating prediction, co-regularization, dynamic programming

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Explainable Recommendation through Attentive Multi-View Learning. https://app.cochat.ai/papers/10.1609/aaai.v33i01.33013622
The paper
Gao, J., Wang, X., Wang, Y., & Xie, X. (2019). Explainable Recommendation through Attentive Multi-View Learning. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v33i01.33013622

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.