密度敏感的数据竞争聚类算法

doi:10.11772/j.issn.1001-9081.2015.02.0444

计算机应用 ›› 2015, Vol. 35 ›› Issue (2): 444-447.DOI: 10.11772/j.issn.1001-9081.2015.02.0444

密度敏感的数据竞争聚类算法

苏辉^1,2, 葛洪伟^1,2, 张欢庆¹, 袁运浩¹

1. 江南大学物联网工程学院, 江苏无锡 214122;
2. 轻工过程先进控制教育部重点实验室(江南大学), 江苏无锡 214122

收稿日期:2014-09-16 修回日期:2014-10-19 出版日期:2015-02-10 发布日期:2015-02-12
通讯作者: 葛洪伟
作者简介:苏辉(1991-),男,安徽蚌埠人,硕士研究生,CCF会员,主要研究方向:人工智能、模式识别; 葛洪伟(1967-),男,江苏无锡人,教授,博士生导师,博士,主要研究方向:人工智能、模式识别、图像处理; 张欢庆(1982-),男,河南商丘人,博士研究生,主要研究方向:信息融合、目标跟踪; 袁运浩(1983-),男,江苏徐州人,副教授,博士,主要研究方向:模式识别、机器学习、信息融合、图像处理。
基金资助:
国家自然科学基金资助项目(61402203,61305017);江苏省普通高校研究生科研创新计划项目(KYLX_1122);江苏高校优势学科建设工程资助项目。

Density-sensitive clustering by data competition algorithm

SU Hui^1,2, GE Hongwei^1,2, ZHANG Huanqing¹, YUAN Yunhao¹

1. School of Internet of Things, Jiangnan University, Wuxi Jiangsu 214122, China;
2. Key Laboratory of Advanced Process Control for Light Industry, Ministry of Education (Jiangnan University), Wuxi Jiangsu 214122, China

Received:2014-09-16 Revised:2014-10-19 Online:2015-02-10 Published:2015-02-12

摘要/Abstract

摘要：

针对数据竞争聚类算法在处理复杂结构数据集时聚类性能不佳的问题,提出了一种密度敏感的数据竞争聚类算法。首先,在密度敏感距离测度的基础上定义了局部距离,以描述数据分布的局部一致性;其次,在局部距离的基础上计算出数据间的全局距离,用来描述数据分布的全局一致性,挖掘数据的空间分布信息,以弥补欧氏距离描述数据分布全局一致性能力不佳的缺陷;最后,将全局距离用于数据竞争聚类算法中。将新算法与基于欧氏距离的数据竞争聚类算法进行性能比较,在人工数据集和真实数据集上的实验结果表明,该算法克服了数据竞争聚类算法难以处理复杂结构数据的缺点,聚类结果具有更高的准确率。

关键词: 聚类, 数据竞争, 密度敏感, 距离测度, 聚合场

Abstract:

Since the clustering by data competition algorithm has poor performance on complex datasets, a density-sensitive clustering by data competition algorithm was proposed. Firstly, the local distance was defined based on density-sensitive distance measure to describe the local consistency of data distribution. Secondly, the global distance was calculated based on local distance to describe the global consistency of data distribution and dig the information of data space distribution, which can make up for the defect of Euclidean distance on describing the global consistency of data distribution. Finally, the global distance was used in clustering by data competition algorithm. Using synthetic and real life datasets, the comparison experiments were conducted on the proposed algorithm and the original clustering by data competition based on Euclidean distance. The simulation results show that the proposed algorithm can obtain better performance in clustering accuracy rate and overcome the defect that clustering by data competition algorithm is difficult to handle complex datasets.

Key words: clustering, data competition, density-sensitive, distance measure, aggregation field

中图分类号:

苏辉, 葛洪伟, 张欢庆, 袁运浩. 密度敏感的数据竞争聚类算法[J]. 计算机应用, 2015, 35(2): 444-447.

SU Hui, GE Hongwei, ZHANG Huanqing, YUAN Yunhao. Density-sensitive clustering by data competition algorithm[J]. Journal of Computer Applications, 2015, 35(2): 444-447.

参考文献

[1] JAIN A K, MURTY M N, FLYNN P J. Data clustering: a review [J].ACM Computing Surveys, 1999, 31(3): 264-323.
[2] MacQUEEN J. Some methods for classification and analysis of multivariate observations [C]//Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. Berkeley: University of California Press, 1967, 1: 281-297.
[3] FERNANDEZ A, GOMEZ S. Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms [J]. Journal of Classification, 2008, 25(1): 43-65.
[4] FILIPPONE M, CAMASTRA F, MASULLI F, et al. A survey of kernel and spectral methods for clustering [J]. Pattern Recognition, 2008, 41(1): 176-190.
[5] FREY B J, DUECK D. Clustering by passing messages between data points [J]. Science, 2007, 315(5814): 972-976.
[6] KHAN S S, AHMAD A. Cluster center initialization algorithm for K-means clustering [J]. Pattern Recognition Letters, 2004, 25(11): 1293-1302.
[7] TAN P-N, STEINBACH M, KUMAR V. Introduction to data mining [M]. Boston: Addison-Wesley, 2005: 515.
[8] SHI J, MALIK J. Normalized cuts and image segmentation [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[9] KIDDLE S J, WINDRAM O P F, McHATTIE S, et al. Temporal clustering by affinity propagation reveals transcriptional modules in arabidopsis thaliana [J]. Bioinformatics, 2010, 26(3): 355-362.
[10] LU Z, ZHANG Q. Clustering by data competition [J]. Science China: Information Sciences, 2013, 56(1): 1-13.
[11] LU Z, FAN D, CHEN B, et al. A data competition based clustering algorithm for large image segmentation[J]. Sciencd China: Information Sciences, 2012, 42(9): 1147-1157. (卢志茂, 范冬梅, 陈炳才, 等.一种基于数据竞争的高分辨率图像的聚类分割算法[J].中国科学:信息科学, 2012, 42(9): 1147-1157.)
[12] YANG P, ZHU Q, HUANG B. Spectral clustering with density sensitive similarity function [J]. Knowledge-Based Systems, 2011, 24(5): 621-628.
[13] WANG L, BO L, JIAO L. Density-sensitive spectral clustering [J]. Acta Electronica Sinica, 2007, 35(8): 1577-1581.(王玲, 薄列峰, 焦李成.密度敏感的谱聚类[J].电子学报, 2007, 35(8): 1577-1581.)
[14] PRADHAN A, MAHINTHAKUMAR G. Finding all-pairs shortest path for a large-scale transportation network using parallel floyd-warshall and parallel Dijkstra algorithms [J]. Journal of Computing in Civil Engineering, 2012,27(3): 263-273.
[15] WITTEN I H, FRANK E, HALL M A. Data mining: practical machine learning tools and techniques [M]. 3rd ed. San Fransisco: Morgan Kaufmann Publishers, 2011: 175.

密度敏感的数据竞争聚类算法

Density-sensitive clustering by data competition algorithm

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	陈恒恒, 倪志伟, 朱旭辉, 金媛媛, 陈千. 基于聚类分析的差分隐私高维数据发布方法[J]. 计算机应用, 2021, 41(9): 2578-2585.
[2]	曾祥银, 郑伯川, 刘丹. 基于深度卷积神经网络和聚类的左右轨道线检测[J]. 计算机应用, 2021, 41(8): 2324-2329.
[3]	祝承, 赵晓琦, 赵丽萍, 焦玉宏, 朱亚飞, 陈建英, 周伟, 谭颖. 基于谱聚类半监督特征选择的功能磁共振成像数据分类[J]. 计算机应用, 2021, 41(8): 2288-2293.
[4]	戴嫣然, 戴国庆, 袁玉波. 基于肤色学习的多人脸前景抽取方法[J]. 计算机应用, 2021, 41(6): 1659-1666.
[5]	李国荣, 冶继民, 甄远婷. 基于新的鲁棒相似性度量的时间序列聚类[J]. 计算机应用, 2021, 41(5): 1343-1347.
[6]	王治和, 常筱卿, 杜辉. 基于万有引力的自适应近邻传播聚类算法[J]. 计算机应用, 2021, 41(5): 1337-1342.
[7]	马建红, 曹文斌, 刘元刚, 夏爽. 基于功效特征的专利聚类方法[J]. 计算机应用, 2021, 41(5): 1361-1366.
[8]	龙超奇, 蒋瑜, 谢雨. 基于峰值网格改进的小波聚类算法[J]. 计算机应用, 2021, 41(4): 1122-1127.
[9]	李杏峰, 黄玉清, 任珍文, 李毅红. 基于自适应邻域的鲁棒多视图聚类算法[J]. 计算机应用, 2021, 41(4): 1093-1099.
[10]	郭佳, 韩李涛, 孙宪龙, 周丽娟. 自动确定聚类中心的比较密度峰值聚类算法[J]. 计算机应用, 2021, 41(3): 738-744.
[11]	吕佳, 鲜焱. 结合改进密度峰值聚类和共享子空间的协同训练算法[J]. 计算机应用, 2021, 41(3): 686-693.
[12]	邹志文, 秦程. 基于k-means++的动态构建空间主题R树方法[J]. 计算机应用, 2021, 41(3): 733-737.
[13]	袁芊芊, 邓洪敏, 王晓航. 基于超像素快速模糊C均值聚类与支持向量机的柑橘病虫害区域分割[J]. 计算机应用, 2021, 41(2): 563-570.
[14]	张恩, 李会敏, 常键. 可验证的隐私保护k-means聚类方案[J]. 计算机应用, 2021, 41(2): 413-421.
[15]	胡誉生, 何炳蔚, 邓清康. 混合视觉系统的运动物体检测和静态地图重建[J]. 《计算机应用》唯一官方网站, 2021, 41(11): 3332-3336.