High-Dimensional Wide Gap k-Means Versus Clustering Axioms

11/30/2022
by   Mieczysław A. Kłopotek, et al.
0

Kleinberg's axioms for distance based clustering proved to be contradictory. Various efforts have been made to overcome this problem. Here we make an attempt to handle the issue by embedding in high-dimensional space and granting wide gaps between clusters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2015

A Probabilistic ℓ_1 Method for Clustering High Dimensional Data

In general, the clustering problem is NP-hard, and global optimality can...
research
08/31/2021

GeodesicEmbedding (GE): A High-Dimensional Embedding Approach for Fast Geodesic Distance Queries

In this paper, we develop a novel method for fast geodesic distance quer...
research
01/13/2022

How I learned to stop worrying and love the curse of dimensionality: an appraisal of cluster validation in high-dimensional spaces

The failure of the Euclidean norm to reliably distinguish between nearby...
research
08/29/2023

Bridging Distribution Learning and Image Clustering in High-dimensional Space

Distribution learning focuses on learning the probability density functi...
research
01/30/2018

Links: A High-Dimensional Online Clustering Method

We present a novel algorithm, called Links, designed to perform online c...
research
09/03/2022

Hypergraph convolutional neural network-based clustering technique

This paper constitutes the novel hypergraph convolutional neural network...
research
02/07/2023

Revised Conditional t-SNE: Looking Beyond the Nearest Neighbors

Conditional t-SNE (ct-SNE) is a recent extension to t-SNE that allows re...

Please sign up or login with your details

Forgot password? Click here to reset