ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2212.12189
  4. Cited By
Stop using the elbow criterion for k-means and how to choose the number
  of clusters instead

Stop using the elbow criterion for k-means and how to choose the number of clusters instead

23 December 2022
Erich Schubert
ArXiv (abs)PDFHTML

Papers citing "Stop using the elbow criterion for k-means and how to choose the number of clusters instead"

14 / 14 papers shown
Title
Cosmos-Drive-Dreams: Scalable Synthetic Driving Data Generation with World Foundation Models
Xuanchi Ren
Y. Lu
Tianshi Cao
Ruiyuan Gao
S. Huang
...
Jun Gao
Laura Leal-Taixe
Mike Chen
Sanja Fidler
Huan Ling
VGen
64
0
0
10 Jun 2025
A Tutorial on Discriminative Clustering and Mutual Information
A Tutorial on Discriminative Clustering and Mutual Information
Louis Ohl
Pierre-Alexandre Mattei
F. Precioso
114
0
0
07 May 2025
Anomalous Agreement: How to find the Ideal Number of Anomaly Classes in Correlated, Multivariate Time Series Data
Anomalous Agreement: How to find the Ideal Number of Anomaly Classes in Correlated, Multivariate Time Series Data
Ferdinand Rewicki
Joachim Denzler
Julia Niebling
61
0
0
13 Jan 2025
SurfPatch: Enabling Patch Matching for Exploratory Stream Surface Visualization
Delin An
Chaoli Wang
45
0
0
01 Jan 2025
Multivariate Time Series Clustering for Environmental State
  Characterization of Ground-Based Gravitational-Wave Detectors
Multivariate Time Series Clustering for Environmental State Characterization of Ground-Based Gravitational-Wave Detectors
Rutuja Gurav
Isaac Kelly
Pooyan Goodarzi
Anamaria Effler
Barry Barish
Evangelos E. Papalexakis
Jonathan Richardson
79
0
0
13 Dec 2024
Accelerating k-Means Clustering with Cover Trees
Accelerating k-Means Clustering with Cover Trees
Andreas Lang
Erich Schubert
16
0
0
19 Oct 2024
Dying Clusters Is All You Need -- Deep Clustering With an Unknown Number
  of Clusters
Dying Clusters Is All You Need -- Deep Clustering With an Unknown Number of Clusters
Collin Leiber
Niklas Strauß
Matthias Schubert
Thomas Seidl
27
0
0
12 Oct 2024
LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph
  Clustering
LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering
Li Sun
Zhenhao Huang
Hao Peng
Yujie Wang
Chunyang Liu
Philip S. Yu
GNN
81
11
0
20 May 2024
Revisiting Silhouette Aggregation
Revisiting Silhouette Aggregation
John Pavlopoulos
Georgios Vardakas
A. Likas
23
2
0
11 Jan 2024
A Multivariate Unimodality Test Harnessing the Dip Statistic of
  Mahalanobis Distances Over Random Projections
A Multivariate Unimodality Test Harnessing the Dip Statistic of Mahalanobis Distances Over Random Projections
Prodromos Kolyvakis
A. Likas
37
2
0
28 Nov 2023
Medoid Silhouette clustering with automatic cluster number selection
Medoid Silhouette clustering with automatic cluster number selection
Lars Lenssen
Erich Schubert
29
18
0
07 Sep 2023
CARL-G: Clustering-Accelerated Representation Learning on Graphs
CARL-G: Clustering-Accelerated Representation Learning on Graphs
William Shiao
Uday Singh Saini
Yozen Liu
Tong Zhao
Neil Shah
Evangelos E. Papalexakis
SSLOOD
84
7
0
12 Jun 2023
Influence of various text embeddings on clustering performance in NLP
Influence of various text embeddings on clustering performance in NLP
Rohan Saha
13
1
0
04 May 2023
Detecting Novelties with Empty Classes
Detecting Novelties with Empty Classes
Svenja Uhlemeyer
Julian Lienen
Eyke Hüllermeier
Hanno Gottschalk
48
1
0
30 Apr 2023
1