Multilayer Graph Clustering with Optimized Node Embedding
2021 IEEE Data Science and Learning Workshop (DSLW)(2021)
摘要
We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an optimization problem that involves a fidelity term to the layers of a given multilayer graph, and a regularization on the (single-layer) graph induced by the embedding. The fidelity te...
更多查看译文
关键词
Index Terms: Multilayer graph,embeddings,clustering,contrastive loss,K-components,effective resistance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要