@inproceedings{7c176842011941e2b41502e05fae823f,
title = "Community detection based on minimum-cut graph partitioning",
abstract = "One of the most useful measurements of community detection quality is the modularity, which evaluates how a given division deviates from an expected random graph. This article demonstrates that (i) modularity maximization can be transformed into versions of the standard minimum-cut graph partitioning, and (ii) normalized version of modularity maximization is identical to normalized cut graph partitioning. Meanwhile, we innovatively combine the modularity theory with popular statistical inference method in two aspects: (i) transforming such statistical model into null model in modularity maximization; (ii) adapting the objective function of statistical inference method for our optimization. Based on the demonstrations above, this paper proposes an efficient algorithm for community detection by adapting the Laplacian spectral partitioning algorithm. The experiments, in both real-world and synthetic networks, show that both the quality and the running time of the proposed algorithm rival the previous best algorithms.",
keywords = "Community detection, Minimum-cut, Modularity",
author = "Yashen Wang and Heyan Huang and Chong Feng and Zhirun Liu",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 16th International Conference on Web-Age Information Management, WAIM 2015 ; Conference date: 08-06-2015 Through 10-06-2015",
year = "2015",
doi = "10.1007/978-3-319-21042-1\_5",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "57--69",
editor = "Yizhou Sun and Jian Li",
booktitle = "Web-Age Information Management - 16th International Conference, WAIM 2015, Proceedings",
address = "Germany",
}