计算机工程与应用2019，Vol.55Issue(23)：170-176,7.DOI:10.3778/j.issn.1002-8331.1808-0090
基于亲密度和吸引力的二分网络社区发现算法
Bipartite Network Community Detecting Algorithm Based on Intimacy and Attraction
摘要
Abstract
Community division is a hot topic in the study of bipartite network, aiming at the existing bipartite network community detecting algorithm from different nodes with the problem of low accuracy, this paper proposes the bipartite network community detecting algorithm based on Intimacy and Attraction Algorithm(IAA). The algorithm treats every U-type node as a community, through calculating the intimacy of each community and the attraction of the community merge communities, U-type node partition is obtained. At last, V-type nodes are divided into existing communities to obtain complete community division results. Through the analysis on artificial networks and real-world networks, normalized mutual information and modularity are used respectively as evaluation indicators. The experimental results show that IAA is able to mine the bipartite network community structure more effectively and has a better community division.关键词
二分网络/社区发现/亲密度/吸引力/归一化互信息/模块度Key words
bipartite network/community detecting/intimacy/attraction/normalized mutual information/modularity分类
信息技术与安全科学引用本文复制引用
张晓琴,刘莉楠..基于亲密度和吸引力的二分网络社区发现算法[J].计算机工程与应用,2019,55(23):170-176,7.基金项目
国家自然科学基金(No.61573229) （No.61573229）
山西省回国留学人员科研资助项目(No.2017-020) （No.2017-020）
山西省基础研究计划项目(No.201701D121004) （No.201701D121004）
山西省高等学校教学改革创新项目(No.J2017002). （No.J2017002）
