首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于热点度轨迹显影机制的网络社区聚类算法
引用本文:陶硕,刘盈.基于热点度轨迹显影机制的网络社区聚类算法[J].井冈山大学学报(自然科学版),2019,40(4):40-45.
作者姓名:陶硕  刘盈
作者单位:马鞍山职业技术学院电子信息系,安徽,马鞍山 243031;井冈山大学电子与信息工程学院,江西,吉安 343009
摘    要:为解决网络社区聚类算法在实际应用中存在热点捕捉困难和社区聚类生存时间较低的问题,提出了一种基于热点度轨迹显影机制的网络社区聚类算法。首先,考虑网络社区聚类存在的多径一体特性,采用抽样方式与角度估计方法来实现热点信号的精确捕捉,以提高聚类效率;随后,对热点信号矢量空间进行按列重排,并综合考虑传输矩阵具有的按列正交及全秩特性,构建热点度轨迹显影方法,以提高聚类中热点显影速度和增加聚类生存时间。仿真实验表明:与聚类流动性映射算法(Clustering Liquidity Mapping Algorithms,CLM算法)、超欧里几何热度聚类算法(Hyper-Eulerian Geometric Thermal Clustering Algorithms,H-EGTC算法)相比,所提算法具有更低的聚合时间和搜寻失误率,以及更高的热点显示时间。

关 键 词:网络社区  热点捕捉  聚类聚合  热点显影  角度估计  传输矩阵
收稿时间:2019/2/8 0:00:00
修稿时间:2019/4/30 0:00:00

THE CLUSTERING ALGORITHM OF NETWORK COMMUNITY BASED ON HOTSPOT TRAJECTORY DEVELOPMENT MECHANISM
TAO Shuo and LIU Ying.THE CLUSTERING ALGORITHM OF NETWORK COMMUNITY BASED ON HOTSPOT TRAJECTORY DEVELOPMENT MECHANISM[J].Journal of Jinggangshan University(Natural Sciences Edition),2019,40(4):40-45.
Authors:TAO Shuo and LIU Ying
Institution:Department of electronic information, Maanshan Technical College, Maanshan, Anhui 243031, China and School of Electronic and Information Engineering, Jinggangshan University, Ji''an, Jiangxi 343009, China
Abstract:In order to solve some shortcomings of the clustering algorithm in practice, such as difficulty in quickly catching hot spots, short clustering lifetime and high energy consumption, a clustering algorithm based on hotspot trajectory development mechanism is proposed. Firstly, considering the characteristics of multi-path integration which widely exists in network community clustering, and considering that the current network community clustering algorithms are mostly used in wireless sensor networks and the Internet of Things and other application scenarios, the sampling method and angle estimation method are used to achieve accurate capture of hot spot signals and enhance the efficiency of clustering aggregation process.Then, the hot spot signal vector space is rearranged according to the column for comprehensive consideration. Considering the orthogonal and full rank characteristics of the transfer matrix, a simple sorting mode of hotspot trajectory development method is constructed to improve the speed of hotspot development in clustering and increase the survival time of clustering. The simulation results show that compared with CLM and H-EGTC algorithms, the proposed algorithm has the advantages of less aggregation time, higher hotspot display time, lower search error rate and superior energy consumption. It has strong practical deployment value.
Keywords:Network community  hotspot capture  clustering aggregation  hotspot development  angle estimation  transmission matrix
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《井冈山大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《井冈山大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号