ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2008.05171
  4. Cited By
Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the
  PAM, CLARA, and CLARANS Algorithms
v1v2 (latest)

Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithms

Information Systems (Inf. Syst.), 2020
12 August 2020
Erich Schubert
P. Rousseeuw
ArXiv (abs)PDFHTML

Papers citing "Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithms"

27 / 27 papers shown
CSMapping: Scalable Crowdsourced Semantic Mapping and Topology Inference for Autonomous Driving
CSMapping: Scalable Crowdsourced Semantic Mapping and Topology Inference for Autonomous Driving
Zhijian Qiao
Zehuan Yu
Tong Li
Chih-Chung Chou
Wenchao Ding
Shaojie Shen
160
0
0
03 Dec 2025
Effectiveness of High-Dimensional Distance Metrics on Solar Flare Time Series
Effectiveness of High-Dimensional Distance Metrics on Solar Flare Time Series
Elaina Rohlfing
Azim Ahmadzadeh
V Aparna
138
0
0
21 Oct 2025
Atlas-based Manifold Representations for Interpretable Riemannian Machine Learning
Atlas-based Manifold Representations for Interpretable Riemannian Machine Learning
Ryan A. Robinett
Sophia A. Madejski
Kyle Ruark
Samantha J. Riesenfeld
Lorenzo Orecchia
131
0
0
20 Oct 2025
Density-Aware Farthest Point Sampling
Density-Aware Farthest Point Sampling
Paolo Climaco
Jochen Garcke
220
0
0
16 Sep 2025
Dimensionally Reduced Open-World Clustering: DROWCULA
Dimensionally Reduced Open-World Clustering: DROWCULA
Erencem Ozbey
Dimitrios I. Diochnos
232
0
0
08 Sep 2025
Forest-Guided Clustering -- Shedding Light into the Random Forest Black Box
Forest-Guided Clustering -- Shedding Light into the Random Forest Black Box
Lisa Barros de Andrade e Sousa
Gregor Miller
Ronan Le Gleut
Dominik Thalmeier
Helena Pelin
Marie Piraud
194
1
0
25 Jul 2025
Diverse Mini-Batch Selection in Reinforcement Learning for Efficient Chemical Exploration in de novo Drug Design
Diverse Mini-Batch Selection in Reinforcement Learning for Efficient Chemical Exploration in de novo Drug Design
Hampus Gummesson Svensson
Ola Engkvist
J. Janet
C. Tyrchan
M. Chehreghani
OffRL
407
1
0
26 Jun 2025
Random Forest Autoencoders for Guided Representation Learning
Random Forest Autoencoders for Guided Representation Learning
Adrien Aumon
Shuang Ni
Myriam Lizotte
Guy Wolf
Kevin R. Moon
Jake S. Rhodes
547
6
0
18 Feb 2025
Uncertainty Herding: One Active Learning Method for All Label Budgets
Uncertainty Herding: One Active Learning Method for All Label BudgetsInternational Conference on Learning Representations (ICLR), 2024
Wonho Bae
Gabriel L. Oliveira
Danica J. Sutherland
UQCV
896
6
0
30 Dec 2024
Interactive Counterfactual Exploration of Algorithmic Harms in
  Recommender Systems
Interactive Counterfactual Exploration of Algorithmic Harms in Recommender Systems
Yongsu Ahn
Quinn K. Wolter
Jonilyn Dick
Janet Dick
Yu-Ru Lin
HAI
360
2
0
10 Sep 2024
Re-localization acceleration with Medoid Silhouette Clustering
Re-localization acceleration with Medoid Silhouette Clustering
Hongyi Zhang
Walterio W. Mayol-Cuevas
259
0
0
30 Jul 2024
Generalized Coverage for More Robust Low-Budget Active Learning
Generalized Coverage for More Robust Low-Budget Active Learning
Wonho Bae
Junhyug Noh
Danica J. Sutherland
580
10
0
16 Jul 2024
EKM: An exact, polynomial-time algorithm for the $K$-medoids problem
EKM: An exact, polynomial-time algorithm for the KKK-medoids problem
Xi He
Max A. Little
113
2
0
16 May 2024
Impact of Extensions on Browser Performance: An Empirical Study on
  Google Chrome
Impact of Extensions on Browser Performance: An Empirical Study on Google ChromeEmpirical Software Engineering (EMSE), 2024
Bihui Jin
Heng Li
Ying Zou
150
3
0
10 Apr 2024
A Rapid Review of Clustering Algorithms
A Rapid Review of Clustering Algorithms
Hui Yin
Amir Aryani
Stephen Petrie
Aishwarya Nambissan
Aland Astudillo
Shengyuan Cao
221
35
0
14 Jan 2024
UniForCE: The Unimodality Forest Method for Clustering and Estimation of
  the Number of Clusters
UniForCE: The Unimodality Forest Method for Clustering and Estimation of the Number of Clusters
Georgios Vardakas
Argyris Kalogeratos
A. Likas
312
3
0
18 Dec 2023
Mitigating Pilot Contamination and Enabling IoT Scalability in Massive
  MIMO Systems
Mitigating Pilot Contamination and Enabling IoT Scalability in Massive MIMO SystemsGlobal Communications Conference (GLOBECOM), 2023
Muhammad Kamran Saeed
Ahmed E. Kamal
Ashfaq A. Khokhar
169
6
0
05 Oct 2023
Medoid Silhouette clustering with automatic cluster number selection
Medoid Silhouette clustering with automatic cluster number selectionInformation Systems (Inf. Syst.), 2023
Lars Lenssen
Erich Schubert
85
38
0
07 Sep 2023
Data Aggregation for Hierarchical Clustering
Data Aggregation for Hierarchical Clustering
Sibylle Hess
Andreas Lang
159
2
0
05 Sep 2023
Intelligent sampling for surrogate modeling, hyperparameter
  optimization, and data analysis
Intelligent sampling for surrogate modeling, hyperparameter optimization, and data analysisMachine Learning with Applications (MLWA), 2021
C. Kamath
186
39
0
06 Jun 2023
Min-Max-Jump distance and its applications
Min-Max-Jump distance and its applications
Gangli Liu
306
2
0
15 Jan 2023
A review of clustering models in educational data science towards
  fairness-aware learning
A review of clustering models in educational data science towards fairness-aware learning
Tai Le Quy
Gunnar Friege
Eirini Ntoutsi
FaML
351
25
0
09 Jan 2023
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 insteadSIGKDD Explorations (SIGKDD Explor.), 2022
Erich Schubert
109
148
0
23 Dec 2022
Clustering by Direct Optimization of the Medoid Silhouette
Clustering by Direct Optimization of the Medoid SilhouetteSimilarity Search and Applications (SISAP), 2022
Lars Lenssen
Erich Schubert
233
11
0
26 Sep 2022
Socially Fair Center-based and Linear Subspace Clustering
Socially Fair Center-based and Linear Subspace Clustering
Sruthi Gorantla
Kishen N. Gowda
Amit Deshpande
Anand Louis
248
2
0
22 Aug 2022
No Pattern, No Recognition: a Survey about Reproducibility and
  Distortion Issues of Text Clustering and Topic Modeling
No Pattern, No Recognition: a Survey about Reproducibility and Distortion Issues of Text Clustering and Topic Modeling
Marília Costa Rosendo Silva
Felipe Siqueira
João Pedro M. Tarrega
João Vitor P. Beinotti
Augusto Sousa Nunes
M. Gardini
Vinicius Silva
Nádia Félix Felipe da Silva
A. C. P. L. F. D. Carvalho
271
2
0
02 Aug 2022
K-Means for Noise-Insensitive Multi-Dimensional Feature Learning
K-Means for Noise-Insensitive Multi-Dimensional Feature LearningPattern Recognition Letters (PR), 2022
Nicholas Pellegrino
Paul Fieguth
P. H. Reza
230
8
0
15 Feb 2022
1
Page 1 of 1