A Note On k-Means Probabilistic Poverty

09/28/2019
by   Mieczysław A. Kłopotek, et al.
0

It is proven, by example, that the version of k-means with random initialization does not have the property probabilistic k-richness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2022

Probabilistic Alternatives to the Gower Distance: A Note on Deodata Predictors

A probabilistic alternative to the Gower distance is proposed. The proba...
research
03/24/2019

Generalization of k-means Related Algorithms

This article briefly introduced Arthur and Vassilvitshii's work on k-mea...
research
07/23/2020

Scalable Initialization Methods for Large-Scale Clustering

In this work, two new initialization methods for K-means clustering are ...
research
01/31/2023

Archetypal Analysis++: Rethinking the Initialization Strategy

Archetypal analysis is a matrix factorization method with convexity cons...
research
11/26/2022

Derandomization under Different Resource Constraints

We provide another proof to the EL Theorem. We show the tradeoff between...
research
02/18/2002

A note on Darwiche and Pearl

It is shown that Darwiche and Pearl's postulates imply an interesting pr...
research
05/25/2021

Prediction error quantification through probabilistic scaling – EXTENDED VERSION

In this paper, we address the probabilistic error quantification of a ge...

Please sign up or login with your details

Forgot password? Click here to reset