| 注册
首页|期刊导航|计算机工程|基于标签传播能力的改进LPA算法

基于标签传播能力的改进LPA算法

邓凯旋 陈鸿昶 黄瑞阳

计算机工程2018,Vol.44Issue(3):60-64,5.
计算机工程2018,Vol.44Issue(3):60-64,5.DOI:10.3969/j.issn.1000-3428.2018.03.010

基于标签传播能力的改进LPA算法

Improved LPA Algorithm Based on Label Propagation Ability

邓凯旋 1陈鸿昶 1黄瑞阳1

作者信息

  • 1. 国家数字交换系统工程技术研究中心,郑州450002
  • 折叠

摘要

Abstract

With the increasing scale of the network,the Label Propagation Algorithm (LPA) has obvious advantages in the time complexity,but its internal mechanism is uncertain and random which leads to unaccurate and unsteadiness community discovery results.This paper presents an improved LPA algorithm.It constructs a new calculation method of node importance based on the K-shell decomposition algorithm,then uses the node importance analysis the label propagation ability in the label propagation algorithm,finally utilizes the node importance and label propagation ability to develop new label update strategy,and obtains the final results.Experimental results on artificial and real networks show that the algorithm has high accuracy and stability.

关键词

复杂网络/社团发现/标签传播/K-shell分解/节点重要性

Key words

complex network/community discovery/label propagation/K-shell decomposition/node importance

分类

信息技术与安全科学

引用本文复制引用

邓凯旋,陈鸿昶,黄瑞阳..基于标签传播能力的改进LPA算法[J].计算机工程,2018,44(3):60-64,5.

基金项目

国家自然科学基金(61171108) (61171108)

国家重点基础研究发展计划项目(2012CB315901,2012CB315905) (2012CB315901,2012CB315905)

国家科技支撑计划项目(2014BAH30B01). (2014BAH30B01)

计算机工程

OA北大核心CSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文