Efficient Bipartite Graph Embedding Induced by Clustering Constraints

Bipartite graph embedding (BGE) maps nodes to compressed embedding vectors that can reflect the hidden topological features of the network, and learning high-quality BGE is crucial for facilitating downstream applications such as recommender systems. However, most existing methods either struggle to...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Zhang, Shanfan, Lin, Yongyi, Rao, Yuan, Bu, Zhan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Social and Information Networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!