重叠社区结构的挖掘算法

针对大多数社区挖掘算法致力于寻找独立不相重叠的社区结构,而实际的网络中,社区结构往往是重叠的问题。基于凝聚方法和贪婪算法原理,提出了一种新的算法来挖掘社会网络中彼此重叠的社区结构。在模拟数据集和标准测试数据集上的实验结果表明了算法的可行性和有效性。

OCSMA:an algorithm to mine overlapping community structure in networks

Community mining is one of the hot research topics in social network analysis.Many algorithms were developed for discovering communities,many of which only focused on finding disjoint communities.However,in real-world networks communities overlap to some extent.To overcome the drawback of exited algorithms,a novel algorithm based on the principle of agglomerative method and "greedy" optimization algorithm was proposed to mine overlapping community structure in social networks.Experiments on simulation data and standard test data show that the proposed algorithm is feasible and effective.