A Random Network Ensemble Model Based Generalized Network Community Mining Algorithm
基于随机网络集成模型的广义网络社区挖掘算法

According to the attributes of nodes and the linkages between them, most real-world complex networks could be assortative and disassortative. Community structures are ubiquitous in both types of networks. The ability to discovery meaningful community structures from both types of networks is fundamental for theoretical research and practical applications. Since the types of exploratory networks to be processed are usually unknown beforehand, it is difficult to determine what specific algorithms should be applied to them to obtain meaningful community structures. To address this issue, a novel concept of generalized network community is proposed in order to unify two concepts of assortative and disassortative communities. Based on a random network ensemble model, a generalized community mining algorithm, called G-NCMA, is proposed. Experimental results demonstrate that the G-NCMA algorithm is able to properly mine potential communities from explorative networks, as well as to determine their respective types.