DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization
원문 초록
Graph clustering is a fundamental and challenging task in the field of graph mining where the objective is to group the nodes into clusters taking into consideration the topology of the graph. It has several applications in diverse domains spanning social network analysis, recommender systems, computer vision, and bioinformatics. In this work, we propose a novel method, DGCluster, which primarily optimizes the modularity objective using graph neural networks and scales linearly with the graph size. Our method does not require the number of clusters to be specified as a part of the input and can also leverage the availability of auxiliary node level information. We extensively test DGCluster on several real-world datasets of varying sizes, across multiple popular cluster quality metrics. Our approach consistently outperforms the state-of-the-art methods, demonstrating significant performance gains in almost all settings.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Unsupervised Graph Clustering with Deep Structural Entropy
Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering
Efficient graph convolution for joint node representation learning and clustering
Asymmetric Semi-Nonnegative Matrix Factorization for Directed Graph Clustering
An Internal Validity Index Based on Density-Involved Distance
토론
이 논문과 연결된 포럼 글이 아직 없습니다.