Finding Community Structure in Networks Using a Shortest-Path-Based $k$-Means Algorithm
Received:December 08, 2011  Revised:December 20, 2011
Key Words: community structure   modularity   shortest path   $K$-means   simulated annealing.  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.10771085).
Author NameAffiliation
Jinglu GAO School of Mathematics, Jilin University, Jilin 130012, P. R. China 
Hits: 4134
Download times: 4512
Abstract:
      
Citation:
DOI:10.3770/j.issn:2095-2651.2013.03.003
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.