Local Sample-weighted Multiple Kernel Clustering with Consensus Discriminative Graph

07/05/2022
by   Liang Li, et al.
0

Multiple kernel clustering (MKC) is committed to achieving optimal information fusion from a set of base kernels. Constructing precise and local kernel matrices is proved to be of vital significance in applications since the unreliable distant-distance similarity estimation would degrade clustering per-formance. Although existing localized MKC algorithms exhibit improved performance compared to globally-designed competi-tors, most of them widely adopt KNN mechanism to localize kernel matrix by accounting for τ -nearest neighbors. However, such a coarse manner follows an unreasonable strategy that the ranking importance of different neighbors is equal, which is impractical in applications. To alleviate such problems, this paper proposes a novel local sample-weighted multiple kernel clustering (LSWMKC) model. We first construct a consensus discriminative affinity graph in kernel space, revealing the latent local structures. Further, an optimal neighborhood kernel for the learned affinity graph is output with naturally sparse property and clear block diagonal structure. Moreover, LSWMKC im-plicitly optimizes adaptive weights on different neighbors with corresponding samples. Experimental results demonstrate that our LSWMKC possesses better local manifold representation and outperforms existing kernel or graph-based clustering algo-rithms. The source code of LSWMKC can be publicly accessed from https://github.com/liliangnudt/LSWMKC.

READ FULL TEXT

page 1

page 9

page 10

research
03/14/2019

Low-rank Kernel Learning for Graph-based Clustering

Constructing the adjacency graph is fundamental to graph-based clusterin...
research
04/15/2019

Multiple kernel learning for integrative consensus clustering of genomic datasets

Diverse applications - particularly in tumour subtyping - have demonstra...
research
09/30/2020

Manifold Adaptive Multiple Kernel K-Means for Clustering

Multiple kernel methods based on k-means aims to integrate a group of ke...
research
05/21/2019

Clustering with Similarity Preserving

Graph-based clustering has shown promising performance in many tasks. A ...
research
06/24/2020

Affinity Fusion Graph-based Framework for Natural Image Segmentation

This paper proposes an affinity fusion graph framework to effectively co...
research
08/25/2012

Graph Degree Linkage: Agglomerative Clustering on a Directed Graph

This paper proposes a simple but effective graph-based agglomerative alg...
research
08/19/2022

IAN: Iterated Adaptive Neighborhoods for manifold learning and dimensionality estimation

Invoking the manifold assumption in machine learning requires knowledge ...

Please sign up or login with your details

Forgot password? Click here to reset