Eztracting Community Structure of Complez networks by Self-Organizing Maps
Identifying community structure is an important issue in network science and has attracted attention of researchers in many fields. It is relevant for social tasks, biological inquires, and technological problems. In this paper, we proposed a new approach based on self-organizing map to community detection. By using a proper weight-updating scheme, a network can be organized into dense subgraphs according to the topological connection of each node. Besides unweighted undirected networks, our method can also be used to detect communities in both weighted and bipartite networks.
Complez network Community detection Self-organizing map Neural networks
Zhenping Li Rui-Sheng Wang Luonan Chen
School of Information,Beijing Wuzi University,Beijing 101149,China School of Information,Renmin University of China,Beijing 100872,China Department of Electrical Engineering and Electronics,Osaka Sangyo University,Osaka 574-8530,Japan
国际会议
The 3rd International Symposium on Optimization and System Biology(第三届最优化与系统生物学国际会议 OSB09)
张家界
英文
48-56
2009-09-20(万方平台首次上网日期,不代表论文的发表时间)