MULTIPLE KERNEL K-MEANS CLUSTERING WITH SIMULTANEOUS SPECTRAL ROTATION

被引:14
作者
Lu, Jitao [1 ,2 ,3 ]
Lu, Yihang [1 ,2 ,3 ]
Wang, Rong [2 ,3 ]
Nie, Feiping [1 ,2 ,3 ]
Li, Xuelong [2 ,3 ]
机构
[1] Northwestern Polytech Univ, Sch Comp Sci, Xian 710072, Peoples R China
[2] Northwestern Polytech Univ, Sch Artificial Intelligence Opt & Elect iOPEN, Minist Ind & Informat Technol, Xian 710072, Shaanxi, Peoples R China
[3] Northwestern Polytech Univ, Key Lab Intelligent Interact & Applicat, Minist Ind & Informat Technol, Xian 710072, Shaanxi, Peoples R China
来源
2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP) | 2022年
基金
中国国家自然科学基金;
关键词
kernel method; kernel k-means; multiple kernel clustering;
D O I
10.1109/ICASSP43922.2022.9746905
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Multiple kernel k-means clustering (MKKM) and its variants have been thoroughly studied over the past decades. However, most existing models utilize a spectrum-based two-step approach to solve the clustering objective, which may deviate from the final cluster labels and lead to suboptimal performance. To address this issue, we elaborate a novel MKKM-R framework that simultaneously optimizes the discrete and continuous cluster labels by incorporating spectral rotation into MKKM. In addition, the proposed model can be easily integrated with other MKKM models to boost their performance. What's more, an efficient alternative algorithm is proposed to solve the joint optimization problem. Extensive experiments on real-world datasets demonstrate the superiorities of the proposed framework.
引用
收藏
页码:4143 / 4147
页数:5
相关论文
共 50 条
  • [41] Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment
    P. L. Lekshmy
    M. Abdul Rahiman
    Journal of Network and Systems Management, 2020, 28 : 398 - 422
  • [42] Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment
    Lekshmy, P. L.
    Rahiman, M. Abdul
    JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2020, 28 (02) : 398 - 422
  • [43] Hypermetric k-Means Clustering for Content-Based Document Management
    Decherchi, Sergio
    Gastaldo, Paolo
    Redi, Judith
    Zunino, Rodolfo
    PROCEEDINGS OF THE INTERNATIONAL WORKSHOP ON COMPUTATIONAL INTELLIGENCE IN SECURITY FOR INFORMATION SYSTEMS CISIS 2008, 2009, 53 : 61 - 68
  • [44] The Use of k-Means Algorithm to Improve Kernel Method via Instance Selection
    Wang, Lulu
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, KSEM 2015, 2015, 9403 : 554 - 559
  • [45] Popcorn: Accelerating Kernel K-means on GPUs through Sparse Linear Algebra
    Bellavita, Julian
    Pasquali, Thomas
    Martin, Laura Del Rio
    Vella, Flavio
    Guidi, Giulia
    PROCEEDINGS OF THE 2025 THE 30TH ACM SIGPLAN ANNUAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, PPOPP 2025, 2025, : 426 - 440
  • [46] Simultaneous learning coefficient matrix and affinity graph for multiple kernel clustering
    Ren, Zhenwen
    Lei, Haoyun
    Sun, Quansen
    Yang, Chao
    INFORMATION SCIENCES, 2021, 547 : 289 - 306
  • [47] A Novel Multiple Kernel Clustering Method
    Zhang, Lujiang
    Hu, Xiaohui
    EMERGING INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, 2012, 304 : 87 - 92
  • [48] Multiple kernel clustering with corrupted kernels
    Li, Teng
    Dou, Yong
    Liu, Xinwang
    Zhao, Yang
    Lv, Qi
    NEUROCOMPUTING, 2017, 267 : 447 - 454
  • [49] Efficient High-Dimensional Kernel k-Means plus plus with Random Projection
    Chan, Jan Y. K.
    Leung, Alex Po
    Xie, Yunbo
    APPLIED SCIENCES-BASEL, 2021, 11 (15):
  • [50] Self-adaptive kernel K-means algorithm based on the shuffled frog leaping algorithm
    Fan, Shuyan
    Ding, Shifei
    Xue, Yu
    SOFT COMPUTING, 2018, 22 (03) : 861 - 872