Generalization of k-means Related Algorithms

03/24/2019
by   Yiwei Li, et al.
0

This article briefly introduced Arthur and Vassilvitshii's work on k-means++ algorithm and further generalized the center initialization process. It is found that choosing the most distant sample point from the nearest center as new center can mostly have the same effect as the center initialization process in the k-means++ algorithm.

READ FULL TEXT

page 1

page 2

page 3

research
10/25/2017

The Geodesic 2-center Problem in a Simple Polygon

The geodesic k-center problem in a simple polygon with n vertices consis...
research
02/18/2021

No-Substitution k-means Clustering with Low Center Complexity and Memory

Clustering is a fundamental task in machine learning. Given a dataset X ...
research
09/28/2019

A Note On k-Means Probabilistic Poverty

It is proven, by example, that the version of k-means with random initia...
research
01/05/2023

The Evolutionary Computation Methods No One Should Use

The center-bias (or zero-bias) operator has recently been identified as ...
research
12/29/2011

Automated PolyU Palmprint sample Registration and Coarse Classification

Biometric based authentication for secured access to resources has gaine...
research
07/30/2019

Parallelization of Kmeans++ using CUDA

K-means++ is an algorithm which is invented to improve the process of fi...
research
01/21/2022

Nearest Class-Center Simplification through Intermediate Layers

Recent advances in theoretical Deep Learning have introduced geometric p...

Please sign up or login with your details

Forgot password? Click here to reset