Twin Learning for Similarity and Clustering: A Unified Kernel Approach
Zhao Kang, Chong Peng, Qiang Cheng

TL;DR
This paper introduces a unified kernel-based model that simultaneously learns similarity matrices and cluster indicators, effectively handling nonlinear similarities and optimizing kernel selection for improved clustering performance.
Contribution
The paper presents a novel joint learning framework for similarity and clustering in kernel spaces, including multiple kernel learning, with theoretical analysis and extensive experiments.
Findings
Effective in capturing nonlinear similarities
Automatically selects optimal kernels for clustering
Outperforms existing methods in experiments
Abstract
Many similarity-based clustering methods work in two separate steps including similarity matrix computation and subsequent spectral clustering. However, similarity measurement is challenging because it is usually impacted by many factors, e.g., the choice of similarity metric, neighborhood size, scale of data, noise and outliers. Thus the learned similarity matrix is often not suitable, let alone optimal, for the subsequent clustering. In addition, nonlinear similarity often exists in many real world data which, however, has not been effectively considered by most existing methods. To tackle these two challenges, we propose a model to simultaneously learn cluster indicator matrix and similarity information in kernel spaces in a principled way. We show theoretical relationships to kernel k-means, k-means, and spectral clustering methods. Then, to address the practical issue of how to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition · Remote-Sensing Image Classification · Advanced Clustering Algorithms Research
