LI Aiyou.Automatic link-chain clustering algorithm[J].Journal of Yanbian University,2015,41(03):254.
自动连结链聚类算法
- Title:
- Automatic link-chain clustering algorithm
- Keywords:
- automatic link-chain; clustering algorithm; quadrant; network
- 分类号:
- TP309.3
- 文献标志码:
- A
- 摘要:
- 针对传统聚类算法存在时间性能低效且需要输入参数的缺点,本文提出了一种自动连结链聚类新算法.该算法在确立数据的基础上,通过计算数据点与各顶点的距离并加以排序形成不同群组,然后快速搜寻出它们的相邻点形成连结链网络,再根据连结链的平均距离删除过长的连结链,从而达到聚类的目的.实验结果表明,本文算法与DBSCAN及Single-Link算法具有相同的聚类效果,但执行时间约仅为这两种算法的10%.
- Abstract:
- Time performance for shortcomings and inefficiencies of traditional clustering algorithms require input parameters, this paper proposes a new algorithm. The algorithm on the basis of the data side established by the distance calculation of data points and the vertices and be able to sort the formation of different groups, and then quickly find out their adjacent points form a network link chain, according to the average distance is too long and then delete the link chain link chain, which serve the purpose of clustering. Experimental results show that the execution time of the automatic link chain clustering algorithm accounts for about 10% of the common algorithm.
参考文献/References:
[1] 张晓伟.聚类算法及在搜索引擎系统中的应用[D].哈尔滨:哈尔滨理工大学,2014.
[2] Mali U, Bandyopadhyay S. Genetic algorithm-based clustering technique[J]. Pattern Recognition, 2000,33(9):1455-1465.
[3] 王辉,张望,范明.基于集群环境的K-Means聚类算法的并行化[J].河南科技大学学报:自然科学版,2008,29(4):42-45.
[4] 赵玉艳,郭景峰,郑丽珍,等.一种改进的BIRCH分层聚类算法[J].计算机科学,2008,35(3):180-183.
[5] 熊忠阳,吴林敏,张玉芳.针对非均匀数据集的DBSCAN过滤式改进算法[J].计算机应用研究,2009,26(10):3721-3723.
[6] Song B C, Ra J B. A fast search algorithm for vector quantization using L2-norm pyramid of codewords[J]. IEEE Transactions Image Processing, 2002,59(11):10-15.
[7] Jim Z C Lai, Yi-Ching Liaw. Fast-searching algorithm for vector quantization using projection and triangular inequality[J]. IEEE Transactions Image Processing, 2004,13(12):1554-1562.
[8] 吴昌友,王福林,马力.采用链路聚类的动态网络社团发现算法[J].西安交通大学学报,2014,48(8):73-79.
备注/Memo
收稿日期: 2015-06-28作者简介: 李隘优(1980—),男,讲师,研究方向为算法分析与设计.