共被期刊论文引用了2次
您的检索式：您选中1篇文献正在查看引证文献汇总
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 基于社区的动态网络节点介数中心度更新算法显示文摘随着互联网技术的迅猛发展,社会网络呈现出爆炸增长的趋势,传统的静态网络分析方法越来越难以达到令人满意的效果.于是,对网络进行动态分析就成为社会网数据管理领域的一个研究热点.节点介数中心度衡量的是一个节点对图中其他点对最短路径的控制能力,有利于挖掘社会网络中的重要节点.在图结构频繁变化的场合,若每次变化后都重新计算整个图中所有节点的介数中心度,效率将会降低.针对动态网络中节点介数中心度计算困难的问题,提出一种基于社区的节点介数中心度更新算法.通过维护社区与社区、社区与节点的最短距离集合,快速过滤掉那些在网络动态更新中不受影响的点对,从而提高节点介数中心度的更新效率.真实数据集和合成数据集上的实验结果表明了所提算法的有效性. | 钱珺 王朝坤 郭高扬 | 2018 | 软件学报2018，29，3： | 12 |
| 2 | AntLP: ant-based label propagation algorithm for community detection in social networks显示文摘In social network analysis,community detection is one of the significant tasks to study the structure and characteristics of the networks.In recent years,several intelligent and meta-heuristic algorithms have been presented for community detection in complex social networks,among them label propagation algorithm(LPA)is one of the fastest algorithms for discovering community structures.However,due to the randomness of the LPA,its performance is not suitable for the general purpose of network analysis.In this study,the authors propose an improved version of the label propagation(called AntLP)algorithm using similarity indices and ant colony optimisation(ACO).The AntLP consists of two steps:in the first step,the algorithm assigns weights for edges of the input network using several similarity indices,and in the second step,the AntLP using ACO tries to propagate labels and optimise modularity measure by grouping similar vertices in each community based on the local similarities among the vertices of the network.In order to study the performance of the AntLP,several experiments are conducted on some well-known social network datasets.Experimental simulations demonstrated that the AntLP is better than some community detection algorithms for social networks in terms of modularity,normalised mutual information and running time. | Razieh Hosseini Alireza Rezvanian | 2020 | CAAI Transactions on Intelligence Technology2020，5，1： | 2 |
您所在的机构暂未开通此部分的功能，请联系管理员