Network community discovery: solving modularity clustering via normalized cut

Authors:
Linbin Yu;Chris Ding
Affiliations:
University of Texas at Arlington;University of Texas at Arlington
Venue:
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Year:
2010

Citing 2
Cited 1

Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding

ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining

GANC: Greedy agglomerative normalized cut for graph clustering

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modularity clustering is a recently introduced clustering objective function for graph clustering. It has been widely used in bioinformatics and social networks. Its relation to data mining field has yet to be explored. In this paper, we show that a normalized version modularity clustering is identical to the popular normalized cut spectral clustering. This also provides an effective algorithm to solve the modularity clustering problem. We demonstrate this algorithm on several datasets.