摘要
复杂网络的节点聚集呈现符合社区结构的动态、无标度和非对称的特性,为了优化复杂网络的社区结构,研究当前发现和优化社区结构的方法的不足,研究用约束正态分布来改进社区结构的节点聚集归属方法,借助信息熵,提出了基于正太分布的复杂网络结构划分算法,通过算法得出聚集节点的正态分布概率,用正太分布概率作为信息熵的输入,重新调整信息熵的变化,根据信息熵变化的幅度,确定节点的划分归属。本算法在确定网络社区结构划分的同时,也能够确定社区内节点的模糊关系。
The node aggregation of complex networks presents the dynamic,fuzzy and asymmetrical characteristics of the community structure.In order to optimize the community structure of complex networks,the paper studies the current methods of discovering and optimizing community structures,and the node aggregation method to improve the community structure by constraining normal distribution.Based on information entropy,the paper proposes a complex network structure partitioning algorithm based on positive distribution.The normal distribution probability of the aggregation node is obtained by the algorithm.The positive distribution probability is used as the input of information entropy to re-adjust the information entropy.According to the magnitude of the information entropy change,the division of the node is determined.The algorithm can determine the fuzzy relationship of nodes in the community while determining the division of the network community structure.
作者
段忠祥
DUAN Zhongxiang(Guangxi Vocational College Technology and Business ,Nanning 530007,China)
出处
《软件工程》
2019年第3期23-25,共3页
Software Engineering
基金
2019年度广西高校中青年教师科研基础能力提升项目<"线上"课程资源多维智能体网络的一致性安全控制问题研究>(项目编号:2019KY1512)
关键词
正太分布
复杂网络
社区结构
结构精简
优化算法
normal distribution
complex network
community structure
structure simplification
optimization algorithm
