TL;DR
DisenHAN introduces a novel disentangled heterogeneous graph attention network that improves top-N recommendation by explicitly modeling different semantic aspects in user-item interactions, leading to better performance and interpretability.
Contribution
The paper proposes a disentangled embedding propagation layer and meta relation decomposition to capture semantic aspects in heterogeneous graphs for recommendation.
Findings
DisenHAN outperforms state-of-the-art methods on three real-world datasets.
The model provides interpretable disentangled representations.
Extensive experiments validate the effectiveness of the approach.
Abstract
Heterogeneous information network has been widely used to alleviate sparsity and cold start problems in recommender systems since it can model rich context information in user-item interactions. Graph neural network is able to encode this rich context information through propagation on the graph. However, existing heterogeneous graph neural networks neglect entanglement of the latent factors stemming from different aspects. Moreover, meta paths in existing approaches are simplified as connecting paths or side information between node pairs, overlooking the rich semantic information in the paths. In this paper, we propose a novel disentangled heterogeneous graph attention network DisenHAN for top- recommendation, which learns disentangled user/item representations from different aspects in a heterogeneous information network. In particular, we use meta relations to decompose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network
