期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

多层核心集凝聚算法 被引量：20

Multilevel Core-Sets Based Aggregation Clustering Algorithm
在线阅读 下载PDF
导出
摘要 许多经典的聚类算法,如平均链接,K-means,K-medoids,Clara,Clarans等,都是利用单一的聚类中心进行聚类.为克服单一聚类中心只能描述凸状聚类的缺陷,CURE,DBSCAN等算法使用多个代表点(或稠密点)表述任意形状的聚类结构,但仍难以聚类重叠和噪声数据.为此,提出一种基于多层聚类中心(称为核心集)的凝聚聚类算法(MulCA).该算法使用了多层核心集表述聚类结构,使得每一层数据集向其核心集凝聚.同时,上层的核心集自动成为下层的数据集.随着每层核心集规模按比例迅速减少,控制了凝聚过程的迭代次数.此外,引入了基于随机采样计算-核心集(RBC)的技巧,将MulCA算法应用于大规模数据集.大量的数值实验充分验证了MulCA算法的有效性. Many classical clustering algorithms like Average-link, K-means, K-medoids, Clara, Clarans and so on are all based on a single cluster-center and are only apt to discover convex-structured clusters. Other methods, e.g., CURE and DBSCAN, use more than one point to represent a cluster and can find some well-separated clusters of arbitrary shape. However, they only consider the original scale of the input data; thus, they cannot depart over-lapped or noisy clusters. To this end, this paper is used to propose a multilevel core-set based agglomerative clustering algorithm （MulCA）. The idea of MulCA is that the clustering structure is described by multi-level core set. Clustering process is achieved through procedure which the top of the core set automatically becomes the underlying data set. In addition, through the introduction of random sampling based ε-core set （RBC）, MulCA algorithm is applied to large-scale data sets. A large number of
作者 马儒宁 王秀丽 丁军娣
机构地区 南京航空航天大学理学院 南京理工大学计算机科学与技术学院
出处 《软件学报》 EI CSCD 北大核心 2013年第3期490-506,共17页 Journal of Software
基金 国家自然科学基金(61103058 61233011 61272220)
关键词 多层 核心集 凝聚 大规模 multilevel core-set aggregation large size
分类号 TP181 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献22

  • 1Kaufman L, Rousseeuw PJ. Finding Groups in Data: An Introduction to Cluster Analysis. New Jersey: John Wiley & Sons, 1990.
  • 2Jain AK, Murty MN, Flynn PJ. Data clustering: A review. ACM Computing Surveys, 1999,31(3):264-323. [doi: 10.1145/331499. 331504].
  • 3Xu R, Wunsch D. Survey of clustering algorithms. IEEE Trans. on Neural Networks, 2005,16(3):645-678. [doi: 10.1109/TNN. 2005.845141].
  • 4Shi JB, Malik J. Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2000,22(8): 888-905. [doi: 10.1109/34.868688].
  • 5Pal NR, Pal SK. A review on image segmentation techniques. Pattern Recognition, 1993,26(9):1277-1294. [doi: 10.1016/0031- 3203(93)90135-J].
  • 6Datta R, Joshi D, Li J, Wang JZ. Image retrieval: Ideas, influences, and trends of the new age. ACM Computing Surveys, 2008, 40(2):1-60. [doi: 10.1145/1348246.1348248].
  • 7MacQueen JB. Some methods for classification and analysis of multivariate observations. In: Proc. of the 5th Berkeley Symp. on Mathematical Statistics and Probability. 1967.281-297.
  • 8Park HS, Jun CH. A simple and fast algorithm for K-medoids clustering. Expert Systems with Applications, 2009,36(2):3336-3341. [doi: 10.1016/j.eswa.2008.01.039].
  • 9Ng R, Han J. CLARANS: A method for clustering objects for spatial data mining. IEEE Trans. on Knowledge and Data Engineering, 2002,14(5): 1003-1016. [doi: 10.1109/TKDE.2002.1033770].
  • 10Guha S, Rastogi R, Shim K. CURE: An efficient clustering algorithm for large databases. In: Proc. of the ACM SIGMOD. New York: ACM Press, 1998.73-84. [doi: 10.1145/276304.276312].

二级参考文献21

  • 1Theodoridis S, Koutroumbas K. Pattern Recognition. 2nd ed., New York: Academic Press, 1999.
  • 2Han J, Kamber M. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
  • 3Chen SC, Zhang DQ. Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure. IEEE Trans. on Systems, Man, and Cybernetics-Part B: Cybernetics, 2004,34(4):1907-1916.
  • 4Shi J, Malik J. Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2000,26(8): 888-905.
  • 5Breitenbach M, Grudic GZ. Clustering through ranking on manifolds. In: Proc. of the 22nd Int'l Conf. on Machine Learning (ICML 2005), Vol.119. New York: ACM, 2005.73-80.
  • 6Hofmann T, Buhmann JM. Pairwise data clustering by deterministic annealing. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1997,19(1):1-14.
  • 7Fischer B, Zoller T, Buhmann JM. Path based pairwise data clustering with application to texture segmentation. Energy Minimization Methods in Computer Vision and Pattern Recognition. 2001. 235-250.
  • 8Fischer B, Buhmann JM. Bagging for path-based clustering. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2003, 25(11):1411-1415.
  • 9Chang H, Yeung DY. Robust path-based spectral clustering with application to image segmentation. In: Proc. of the 10th IEEE Int'l Conf. on Computer Vision (ICCV). Beijing: IEEE Computer Society, 2005. 278-285.
  • 10Ester M, Kriegel HP, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad U, eds. Proc. of the 2nd Int'l Conf. on Knowledge Discovery and Data Mining. Beijing: The AAAI Press, 1996. 221-226.

共引文献3

同被引文献172

引证文献20

二级引证文献124

软件学报
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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