Abstract

Multiple kernel clustering (MKC) attracts considerable attention due to its competitive performance in unsupervised learning. However, we observe that most of the existing MKC approaches do not sufficiently consider the correlation between different clustering partitions. As a result, the existing methods would cause redundant and low diversity of selected clustering partitions which deteriorate clustering performance. To address these issues, we propose an effective and efficient multiple kernel $k$ -means clustering method termed Consensus Multiple Kernel Clustering with Late Fusion Alignment and Matrix-Induced Regularization (CMKC-LFA-MR) . Specifically, the correlations between different clustering partitions are calculated as a matrix-induced regularization to encourage the diversity of clustering results. Moreover, we propose to maximally align the consensus partition with the weighted base partitions. The proposed algorithm jointly optimizes the basic clustering partitions and the optimal consensus clustering result. To solve the resultant optimization problem, a three-step alternate algorithm is proposed with both theoretically and experimentally proved convergence. As demonstrated by the experiments on six benchmark datasets, our algorithm outperforms the existing state-of-the-art multi-kernel methods in clustering performance with less time complexity, which demonstrates the effectiveness and efficiency of our proposed algorithm.

Highlights

  • Clustering is one of the most fundamental learning tasks in machine learning and data mining fields

  • We propose a novel algorithm termed Consensus Multiple Kernel Clustering with Late Fusion Alignment Maximization and Matrix-induced Regularization (CMKC-LFA-MR) in this paper

  • MULTI-KERNEL K-MEANS (MKKM) In multiple kernel setting, we suppose that X = {xi}ni=1 ⊆ X is a collection of n samples, and φp(·) : x ∈ X → Hp be the p-th feature mapping which transfers x into a reproducing kernel Hilbert space Hp (1 ≤ p ≤ m)

Read more

Summary

INTRODUCTION

Clustering is one of the most fundamental learning tasks in machine learning and data mining fields. Ii) The 1 norm constraint on weights in [32] leads to sparse solution, which reduces the diversity of selected partitions and leads to unsatisfying clustering performance To address these issues, we propose a novel algorithm termed Consensus Multiple Kernel Clustering with Late Fusion Alignment Maximization and Matrix-induced Regularization (CMKC-LFA-MR) in this paper. The contributions of this paper are summarized as follows, The proposed CMKC-LFA-MR integrates multiple kernels via a late fusion manner It jointly optimizes the consensus partition, rotation matrices and weight coefficients.

PRELIMINARIES
CONSENSUS MULTIPLE-KERNEL K-MEANS WITH
PROPOSED FORMULATION
CONVERGENCE ANALYSIS
COMPUTATIONAL COMPLEXITY
DISCUSSION AND EXTENSIONS
EXPERIMENTS
COMPARED ALGORITHM
Findings
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call