A heuristic clustering algorithm for mining communities in signed networks

作者：Yang Bo^*; Liu Da You

来源：Journal of Computer Science and Technology, 2007, 22(2): 320-328.

DOI：10.1007/s11390-007-9039-1

• complex network
• signed network
• community
• clustering
• graph theory

Signed network is an important kind of complex network, which includes both positive relations and negative relations. Communities of a signed network are defined as the groups of vertices, within which positive relations are dense and between which negative relations are also dense. Being able to identify communities of signed networks is helpful for analysis of such networks. Hitherto many algorithms for detecting network communities have been developed. However, most of them are designed exclusively for the networks including only positive relations and are not suitable for signed networks. So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. In this paper, we propose a heuristic algorithm to address this issue. Compared with major existing methods, our approach has three distinct features. First, it is very fast with a roughly linear time with respect to network size. Second, it exhibits a good clustering capability and especially can work well with complex networks without well-defined community structures. Finally, it is insensitive to its built-in parameters and requires no prior knowledge.

• 出版日期2007-3
• 单位吉林大学