期刊文献+

基于局部密度和测地距离的谱聚类

Spectral clustering based on local density and geodesic distance
下载PDF
导出
摘要 传统根据K-近邻图计算测地距离的方法,虽然能够发现流形分布数据间的相似关系,但是当不同类的点存在粘连关系时,依此计算相似度时不能体现样本间的真实关系,从而无法有效聚类。针对传统测地距离计算相似度的方法不能有效处理粘连数据集的问题,提出了基于局部密度和测地距离的谱聚类方法。计算样本的局部密度,寻找每个样本点的最近高密度点,并选择边缘点和非边缘点;在边缘点和其最近高密度点之间构造边、非边缘点之间的K个近邻点构造边,依此计算测地距离和相似度并进行聚类。在人工数据集和UCI数据集上的实验表明,该算法在处理粘连数据集时有效提高了聚类准确率。 The traditional geodesic distance calculation method based on K-nearest neighbor graph can find the data relationshipson manifold.However,if there are adhesive points between different clusters,the similarity based on traditionalgeodesic distance can not effectively reflect the true relationships between points,which make it difficult to cluster thedatasets effectively.Since the similarity based on traditional geodesic distance can not deal with adhesive datasets effectively,spectral clustering based on local density and geodesic distance is proposed.Firstly,the local density of each pointis calculated to find the nearest high density point,and choose marginal points and non-marginal points.Then,the edgebetween the marginal point and its nearest high density point is created,and edges between the K-nearest neighbor pointsand non-marginal points are created as well.Finally,the geodesic distance and similarity can be calculated to perform clustering.Experiments on artificial and UCI datasets show that the proposed algorithm can improve the clustering accuracywhen dealing with the adhesive datasets.
作者 张涛 葛洪伟 苏辉 张欢庆 ZHANG Tao;GE Hongwei;SU Hui;ZHANG Huanqing(Key Laboratory of Advanced Process Control for Light Industry(Jiangnan University), Ministry of Education, Wuxi,Jiangsu 214122, China;School of Internet of Things, Jiangnan University, Wuxi, Jiangsu 214122, China)
出处 《计算机工程与应用》 CSCD 北大核心 2017年第7期141-146,262,共7页 Computer Engineering and Applications
基金 国家自然科学基金(No.61402203) 江苏省普通高校研究生科研创新计划项目(No.KYLX_1122) 江苏高校优势学科建设工程
关键词 K-近邻图 测地距离 局部密度 相似度 谱聚类 K-nearest neighbor graph geodesic distance local density similarity spectral clustering
  • 相关文献

参考文献2

二级参考文献41

  • 1Fiedler M. Algebraic Connectivity of Graphs. Czechoslovak Mathe-matical Journal, 1973, 23 (98) : 298-305.
  • 2Hendrickson B, Leland R. An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations. SIAM Journal on Sci-entific Computing, 1995, 16(2) : 452-469.
  • 3Hagen L, Kahng A B. New Spectral Methods for Ratio Cut Partitio-ning and Clustering. IEEE Trans on Computer-Aided Design, 1992, 11(9) : 1074-1085.
  • 4Dhillon Spectral national (KDD) I S. Co-Clustering Documents and Words Using Bipartite Graph Partitioning// Proc of the 7th ACM SIGKDD Inter-Conference on Knowledge Discovery and Data Mining San Francisco, USA, 2001 : 269-274.
  • 5Ding C, He Xiaofeng, Zha Hongyuan, et al. Unsupervised Learn-ing: Self-Aggregation in Scaled Principal Component Space//Proc of the 6th European Conference on Principles of Data Mining and Knowledge Discovery. Helsinki, Finland, 2002: 112-124.
  • 6Shi Jiaobo, Malik J. Normalized Cuts and Image Segmentation. IEEE Trans on Pattern Analysis and Machine Intelligence, 2000, 22 (8) : 888-905.
  • 7Ng A Y, Jordan M I, Weiss Y. On Spectral Clustering: Analysis and an Algorithm// Dietterieh T, Beeker S, Ghahramani Z, eds. Advances in Neural Information Processing Systems. Cambridge, USA : MIT Press, 2002, XIV : 849-856.
  • 8Fowlkes C, Belongie S, Chung F, et al. Spectral Grouping Using the Nystrom Method. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004, 26 (2) : 214-225.
  • 9Sun Z, Bebis G, Miller R. Object Detection Using Feature Subset Selection. Pattern Recognition, 2004, 37 (11):2165-2176.
  • 10Li Guozheng, Bu Hualong, Yang M Q, et al. Selecting Subsets of Newly Extracted Features from PCA and PLS in Microarray Data A-nalysis. BMC Genomies, 2008, 9(Z2):24.

共引文献32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部