Scaling up kernel grower clustering method for large data sets via core-sets

被引:0
|
作者
Chang, Liang [1 ]
Deng, Xiao-Ming [2 ,3 ]
Zheng, Sui-Wu [1 ]
Wang, Yong-Qing [1 ]
机构
[1] Key Laboratory of Complex System and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, Beijing 100080, China
[2] Virtual Reality Laboratory, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China
[3] National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing 100080, China
来源
基金
中国国家自然科学基金;
关键词
Data mining - Data structures - Image segmentation - Pattern recognition - Self organizing maps;
D O I
10.3724/SP.J.1004.2008.00376
中图分类号
学科分类号
摘要
Kernel grower is a novel kernel clustering method proposed recently by Camastra and Verri. It shows good performance for various data sets and compares favorably with respect to popular clustering algorithms. However, the main drawback of the method is the weak scaling ability in dealing with large data sets, which restricts its application greatly. In this paper, we propose a scaled-up kernel grower method using core-sets, which is significantly faster than the original method for large data clustering. Meanwhile, it can deal with very large data sets. Numerical experiments on benchmark data sets as well as synthetic data sets show the efficiency of the proposed method. The method is also applied to real image segmentation to illustrate its performance.
引用
收藏
页码:376 / 382
相关论文
共 50 条
  • [1] Scaling up support vector data description by using core-sets
    Chu, CS
    Tsang, IW
    Kwok, JT
    [J]. 2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, : 425 - 430
  • [2] Multilevel core-sets based aggregation clustering algorithm
    Ma, Ru-Ning
    Wang, Xiu-Li
    Ding, Jun-Di
    [J]. Ruan Jian Xue Bao/Journal of Software, 2013, 24 (03): : 490 - 506
  • [3] Core-sets for Fair and Diverse Data Summarization
    Mahabadi, Sepideh
    Trajanovski, Stojan
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [4] Scaling kernel-based systems to large data sets
    Tresp, V
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2001, 5 (03) : 197 - 211
  • [5] Scaling Kernel-Based Systems to Large Data Sets
    Volker Tresp
    [J]. Data Mining and Knowledge Discovery, 2001, 5 : 197 - 211
  • [6] Speeding-up the prototype based kernel k-means clustering method for large data sets
    Sarma, T. Hitendra
    Viswanath, P.
    Negi, Atul
    [J]. 2016 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2016, : 1903 - 1910
  • [7] Drawing Density Core-Sets from Incomplete Relational Data
    Liu, Yongnan
    Li, Jianzhong
    Gao, Hong
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2017), PT II, 2017, 10178 : 527 - 542
  • [8] Semi-supervised clustering of large data sets with kernel methods
    Fausser, Stefan
    Schwenker, Friedhelm
    [J]. PATTERN RECOGNITION LETTERS, 2014, 37 : 78 - 84
  • [9] A clustering method for very large mixed data sets
    Sánchez-Díaz, G
    Ruiz-Shulcloper, J
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 643 - 644
  • [10] An investigation of mountain method clustering for large data sets
    Velthuizen, RP
    Hall, LO
    Clarke, LP
    Silbiger, ML
    [J]. PATTERN RECOGNITION, 1997, 30 (07) : 1121 - 1135