K-Means Kernel Classifier

12/23/2020
by   M. Andrecut, et al.
0

We combine K-means clustering with the least-squares kernel classification method. K-means clustering is used to extract a set of representative vectors for each class. The least-squares kernel method uses these representative vectors as a training set for the classification task. We show that this combination of unsupervised and supervised learning algorithms performs very well, and we illustrate this approach using the MNIST dataset

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2018

Multiple Kernel k-Means Clustering by Selecting Representative Kernels

To cluster data that are not linearly separable in the original feature ...
research
10/06/2021

Coresets for Kernel Clustering

We devise the first coreset for kernel k-Means, and use it to obtain new...
research
06/09/2017

Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds

Kernel k-means clustering can correctly identify and extract a far more ...
research
05/11/2020

SimpleMKKM: Simple Multiple Kernel K-means

We propose a simple yet effective multiple kernel clustering algorithm, ...
research
01/19/2017

On the Existence of Kernel Function for Kernel-Trick of k-Means

This paper corrects the proof of the Theorem 2 from the Gower's paper [p...
research
06/06/2016

On Robustness of Kernel Clustering

Clustering is one of the most important unsupervised problems in machine...
research
05/01/2022

Generalized Reference Kernel for One-class Classification

In this paper, we formulate a new generalized reference kernel hoping to...

Please sign up or login with your details

Forgot password? Click here to reset