武澎, 王恒山. 一种基于适度贪心算法思路的社团划分改进方法[J]. 微电子学与计算机, 2014, 31(7): 101-104.
引用本文: 武澎, 王恒山. 一种基于适度贪心算法思路的社团划分改进方法[J]. 微电子学与计算机, 2014, 31(7): 101-104.
WU Peng, WANG Heng-shan. Community Division Method in Networks Based on Moderately Greedy Algorithm[J]. Microelectronics & Computer, 2014, 31(7): 101-104.
Citation: WU Peng, WANG Heng-shan. Community Division Method in Networks Based on Moderately Greedy Algorithm[J]. Microelectronics & Computer, 2014, 31(7): 101-104.

一种基于适度贪心算法思路的社团划分改进方法

Community Division Method in Networks Based on Moderately Greedy Algorithm

  • 摘要: 当前问题背景下贪心算法存在不足,由此提出一种适度贪心的算法思路,引入适度原则,约束贪婪幅度,以避免过度贪婪、谬误累积的情况,并将适度贪心算法思路应用于FN社团划分算法的改进研究,构建了一种新的网络社团区划算法.通过算例对提出的算法进行了测试与分析,实验结果验证了新算法的可行性与有效性.

     

    Abstract: This paper,based on the deficiency of greedy algorithm,tries to propose a new algorithmic thinking from the perspective of the moderate principle.The moderate principle can avoid the occurrence of excessive greed situation.Based on the lack of FN algorithm,this paper proposes a new algorithm to divide community structure from the perspective of the moderately greedy algorithm.Finally,the new algorithm is illustrated through examples.

     

/

返回文章
返回