Community detection algorithm based on local expansion K-means

Title:

Community detection algorithm based on local expansion K-means

Creator:

Li, L., Fan, K., Zhang, Z., and Xia, Z.

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:e635a362-b128-4f1f-b90b-7f15339c0cf4
uuid:e635a362-b128-4f1f-b90b-7f15339c0cf4
doi:10.14311/NNW.2016.26.034

Subject:

community structure, PCA, and Local Expansion Strategy

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

Community structure implies some features in various real-world networks, and these features can help us to analysis structural and functional properties in the complex system. It has been proved that the classic k-means algorithm can efficiently cluster nodes into communities. However, initial seeds decide the efficiency of the k-means, especially when detecting communities with different sizes. To solve this problem, we improve the classic community detection algorithm with Principal Component Analysis (PCA) mapping and local expansion k-means. Since PCA can preserve the distance information of every node pairs, the improved algorithm use PCA to map nodes in the complex network into lower dimension European space, and then detect initial seeds for k-means using the improved local expansion strategy. Based on the chosen initial seeds, the k-means algorithm can cluster nodes into communities. We apply the proposed algorithm in real-world and artificial networks, the results imply that the improved algorithm is efficient to detect communities and is robust to the initial seed of K-means.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Source:

Neural network world: international journal on neural and mass-parallel computing and information systems | 2016 Volume:26 | Number:6

Harvested from:

CDK

Metadata only:

false