Hierarchical community detection based on multi degrees of distance space and submodularity optimization

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Detecting hierarchical community is crucial to analyze complex networks. In this paper, we propose a model for Hierarchical Community Detection based on Multi Degrees of distance space and submodularity function optimization (MD-HCD). First, an original network is divided into many communities under one degree of distance space. Then each community in original network is regarded as a super node, so those super nodes and corresponding edges construct a quotient network. And the same method is used to identify communities in quotient network. During hierarchical process, target function holds the property of submodularity, so that a result with [1, − 1/e] approximation is guaranteed. Experiments reveal the benefits of the multi degree of distance space. The proposed method generally detects a hierarchical community structure that includes three layers and has a stable performance in terms of modularity compared with many other main stream algorithms.

Cite

CITATION STYLE

APA

Zhao, S., Yu, C., & Zhang, Y. (2017). Hierarchical community detection based on multi degrees of distance space and submodularity optimization. In Communications in Computer and Information Science (Vol. 774, pp. 343–354). Springer Verlag. https://doi.org/10.1007/978-981-10-6805-8_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free