摘要
本文提出一种基于相似度动态演化的符号网络社区检测算法.为了使不连接的两节点之间有相似度,加入了最短路径的相似度计算函数,从而使同一个社区中节点的相似度随着时间的变化更新为1,不同社区之间节点的相似度随着时间的变化更新为-1.在本文所提出网络模型的基础上,整个网络会分为几个不同的社区.为了验证算法的性能,本文针对USC真实网络,GGS真实网络以及17个人工合成网络进行了仿真,并与已有文献作了相关比较,实验结果表明,算法有一定的优势.
A similarity dynamic evolutionary community detection method in signed network has been proposed in this paper.The similarity function based on shortest paths has been added in this paper,so that the similarity values between nodes in same community are updated to l,and the similarity values between nodes in different communities are updated to -1 over time.All of the network will be divided into several clusters based on the proposed network model.In order to verify the performance of the proposed algorithm,this paper has been tested by USC network,GGS network and 17 Synthetic networks.The results showed that our proposed method is efficiently.
出处
《内蒙古工业大学学报(自然科学版)》
2016年第3期182-188,共7页
Journal of Inner Mongolia University of Technology:Natural Science Edition
基金
国家自然科学基金项目(11261034
71561020
61503203
11326239)
内蒙古高校科学技术研究项目(NJZY13119)
内蒙古自然科学基金项目(2015MS0103
2014BS0105)
关键词
符号网络
社区检测
相似度
动态演化
Signed network
Community detection
Similarity
Dynamic evolutionary