Sterling: Synergistic Representation Learning on Bipartite Graphs
Open Access
- 24 March 2024
- journal article
- research article
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (12) , 12976-12984
Abstract
A fundamental challenge of bipartite graph representation learning is how to extract informative node embeddings. Self-Supervised Learning (SSL) is a promising paradigm to address this challenge. Most recent bipartite graph SSL methods are based on contrastive learning which learns embeddings by discriminating positive and negative node pairs. Contrastive learning usually requires a large number of negative node pairs, which could lead to computational burden and semantic errors. In this paper, we introduce a novel synergistic representation learning model (STERLING) to learn node embeddings without negative node pairs. STERLING preserves the unique local and global synergies in bipartite graphs. The local synergies are captured by maximizing the similarity of the inter-type and intra-type positive node pairs, and the global synergies are captured by maximizing the mutual information of co-clusters. Theoretical analysis demonstrates that STERLING could improve the connectivity between different node types in the embedding space. Extensive empirical evaluation on various benchmark datasets and tasks demonstrates the effectiveness of STERLING for extracting node embeddings.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Fast Adaptation for Cold-Start Collaborative Filtering with Meta-Learning2020
- A View-Adversarial Framework for Multi-View Network Embedding2020
- Neural Graph Collaborative Filtering2019
- Deep Co-Clustering2019
- Co-clustering Document-term Matrices by Direct Maximization of Graph Modularity2015
- Nonparametric Bayesian Co-clustering Ensembles2011
- A generalized Co-HITS algorithm and its application to bipartite graphs2009
- Extracting and composing robust features with denoising autoencoders2008
- Latent Dirichlet Co-ClusteringIEEE International Conference on Data Mining (ICDM), 2006
- Friends and neighbors on the WebSocial Networks, 2003