An improved clustering algorithm based on local density

Xiaohui GUAN; Yaguan QIAN; Xinxin SUN

doi:10.11959/j.issn.1000-0801.2016008

您当前的位置：

首页 >

文章列表页 >

An improved clustering algorithm based on local density

Ressearch and development | 更新时间：2024-06-05

- An improved clustering algorithm based on local density
- Telecommunications Science Vol. 32, Issue 1, Pages: 54-59(2016)
- 作者机构：
  
  1. 浙江水利水电学院，浙江杭州310018
  2. 浙江科技学院理学院，浙江杭州310023
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.1000-0801.2016008
  CLC： TN929.5
- Published Online：2016-01，
  
  Published：20 January 2016
- 稿件说明：
移动端阅览
Xiaohui GUAN, Yaguan QIAN, Xinxin SUN. An improved clustering algorithm based on local density[J]. Telecommunications science, 2016, 32(1): 54-59.
DOI：

Xiaohui GUAN, Yaguan QIAN, Xinxin SUN. An improved clustering algorithm based on local density[J]. Telecommunications science, 2016, 32(1): 54-59. DOI： 10.11959/j.issn.1000-0801.2016008.

摘要

聚类分析一直是机器学习和数据挖掘领域一个比较活跃而且极具挑战性的研究方向。Alex提出的基于局部密度的聚类算法是一种快速、有效的聚类方法，但该方法通过手工选取确定聚类个数和聚类中心。为此，对原算法进行改进，在初步选取候选聚类中心的基础上，使用基于密度连通的算法优化选取聚类中心，然后使用大密度最近邻方法确定样本类别。实验证明，该方法能有效解决聚类个数和聚类中心无法确定的问题，同时在聚类评价指标上显示出较好的聚类效果和性能。

Abstract

Clustering analysis is an important and challenging research field in machine learning and data mining.A fast and effective clustering algorithm based on the idea of local density was proposed by Alex.But the number of clusters and cluster centers in the algorithm were determined by hand.Therefore

the candidates of cluster centers based on local density were firstly selected and then density connectivity method was used to optimize the candidates.The classes of samples are the same as the nearest center with bigger local density.Experiments show that the proposed method has a better cluster efficiency and can handle the problems of uncertain cluster number and cluster centers.

关键词

Keywords

references

周涛，陆惠玲 . 数据挖掘中聚类算法研究进展 [J ] . 计算机工程与应用， 2012 , 48 （ 12 ）: 100 - 109 .

ZHOU T , LU H L . Clustering algorithm research advances on data mining [J ] . Computer Engineering and Applications , 2012 , 48 （ 12 ）: 100 - 109 .

ZHANG T , RAMAKRISHNAN R , LIVNY M . BIRCH:an efficient data clustering method for very large databases [C ] // Proceedings of 1996 ACM-SIGMOD International Conference Management of Data , June 4 - 6 , 1996 , Montreal,Quebec,Canada . New York : ACM Press , 1996 : 103 - 114 .

GUHA S , RASTOGI R , SHIM K . CURE:an efficient clustering algorithm for large database [J ] . Information Systems , 2001 , 26 （ 1 ）: 35 - 58 .

MACQUEEN J . Some methods for classification and analysis of multivariate observations [C ] // Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability , June 21 - 18 , 1965 , Berkeley,California,USA . California : University of California Press , 1967 : 281 - 297 .

KAUFMAN L , ROUSSEEUW P J . Finding Groups in Data:An Introduction to Cluster Analysis [M ] . New York:John Wiley &Sons , 1990 .

HUANG Z . Extensions to the k-means algorithm for clustering large data sets with categorical values [J ] . Data Mining and Knowledge,Discovery II , 1998 （ 2 ）: 283 - 304 .

倪巍伟，陈耿，吴英杰 . 一种基于局部密度的分布式聚类挖掘算法 [J ] . 软件学报， 2008 , 19 （ 9 ）: 2339 - 2348 .

NI W W , CHEN G , WU Y J . Local density based distributed clustering algorithm [J ] . Journal of Software , 2008 , 19 （ 9 ）: 2339 - 2348 .

ANKERST M , BREUNIG M , KRIEGEL H P , et al . OPTICS:ordering points to identify the clustering structure [C ] // Proceedings of 1999 ACM-SIGMOD International Conference Management of Data（SIGMOD'99） , June 1 - 3 , 1999 , Philadelphia,Pennsylvania,USA . New York : ACM Press , 1999 : 49 - 60 .

HINNEBURG A , KEIM D A . An efficient approach to clustering in large multimedia databases with noise [C ] // Proceedings of 1998 International Conference Knowledge Discovery and Data Mining , August 27 - 31 , 1998 , New York,USA . New York : ACM Press , 1998 : 58 - 65 .

WANG W , YANG J , MUNTZ R . STING:a statistical information grid approach to spatial data mining [C ] // Proceedings of 1997 International Conference Very Large Data Bases , August 2 - 29 , 1997 , Athens,Greece . New York : ACM Press , 1997 : 186 - 195 .

AGRAWAL R , GEHRKE J , GUNOPULOS D , et al . Automatic subspace clustering of high dimensional data for data mining applications [C ] // Proceedings of 1998 ACM-SIGMOD International Conference Management of Data , June 2 - 4 , 1998 , Seattle,Washington,USA . New York : ACM Press , 1998 : 94 - 105 .

FISHER D . Improving inherence through conceptual clustering [C ] // Proceedings of 1987 AAAI Conference , July 13 - 17 , 1987 , Seattle,Washington,USA . [S.l.] : AAAI Press , 1987 : 461 - 465 .

FAYYAD V M , PIATETSKY S G , SMYTH P et al . Bayesian Classification （AutoClass）:Theory and Result.Advances in Knowledge Discovery and Data Mining [M ] . Bridge City : The MIT Press , 1996 : 153 - 180 .

TEUVO K . The self-organizing map [J ] . Neurocomputing , 1998 , 21 （ 13 ）: 1 - 6 .

CAI W L , CHEN S C , ZHANG D Q . Fast and robust fuzzy c-means clustering algorithms incorporating local information for image segmentation [J ] . Pattern Recognition , 2007 , 40 （ 3 ）: 825 - 833 .

BASU B , SRINIVAS V V , . Regional flood frequency analysis using kernel-based fuzzy clustering approach [J ] . Water Resources Research , 2014 , 50 （ 4 ）: 3295 - 3316 .

LI X , WONG H S , WU S . A fuzzy minimax clustering model and its applications [J ] . Information Sciences , 2012 , 186 : 114 - 125 .

周林，平西建，徐森，等 . 基于谱聚类的聚类集成算法 [J ] . 自动化学报， 2012 , 38 （ 8 ）: 1335 - 1342 .

ZHOU L , PING X J , XU S , et al . Cluster ensemble based on spectral clustering [J ] . Acta Automatica Sinica , 2012 , 38 （ 8 ）: 1335 - 1342 .

陈黎飞，郭躬德，姜青山 . 自适应的软子空间聚类算法 [J ] . 软件学报， 2010 （ 10 ）: 2513 - 2523 .

CHEN L F , HUO G D , JIANG Q S . Adaptive algorithm for soft subspace clustering [J ] . Journal of Software , 2010 （ 10 ）: 2513 - 2523 .

SUN H , WANG S , JIANG Q . FCM-based model selection algorithms for determining the number of cluster [J ] . Pattern Recognition , 2004 , 37 （ 10 ）: 2027 - 2037 .

FREY B J , DUECK D , . Clustering by passing messages between data points [J ] . Science , 2007 , 315 （ 5814 ）: 972 - 976 .

ALEX R , ALESSANDRO L , . Clustering by fast search and find of density peaks [J ] . Science , 2014 , 344 （ 6191 ）: 1492 - 1496 .

Views

416

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰