Coin: Co-cluster infomax for bipartite graphs
Graph self-supervised learning has attracted plenty of attention in recent years. However,
most existing methods are designed for homogeneous graphs yet not tailored for bipartite …
most existing methods are designed for homogeneous graphs yet not tailored for bipartite …
COIN: Co-Cluster Infomax for Bipartite Graphs
B Jing, Y Yan, Y Zhu, H Tong - arXiv e-prints, 2022 - ui.adsabs.harvard.edu
Bipartite graphs are powerful data structures to model interactions between two types of
nodes, which have been used in a variety of applications, such as recommender systems …
nodes, which have been used in a variety of applications, such as recommender systems …
COIN: Co-Cluster Infomax for Bipartite Graphs
B Jing, Y Yan, Y Zhu, H Tong - arXiv preprint arXiv:2206.00006, 2022 - arxiv.org
Bipartite graphs are powerful data structures to model interactions between two types of
nodes, which have been used in a variety of applications, such as recommender systems …
nodes, which have been used in a variety of applications, such as recommender systems …
