:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Schubert, Erich, Rousseeuw, Peter J.
Format:	Preprint
Published:	2020
Subjects:	Machine Learning Artificial Intelligence
Online Access:	https://arxiv.org/abs/2008.05171
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms
by: Schubert, Erich, et al.
Published: (2018)

Accelerating k-Means Clustering with Cover Trees
by: Lang, Andreas, et al.
Published: (2024)

OneBatchPAM: A Fast and Frugal K-Medoids Algorithm
by: de Mathelin, Antoine, et al.
Published: (2025)

k-HyperEdge Medoids for Clustering Ensemble
by: Li, Feijiang, et al.
Published: (2024)

A Scalable k-Medoids Clustering via Whale Optimization Algorithm
by: Chenan, Huang, et al.
Published: (2024)

Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge
by: Guo, Longkun, et al.
Published: (2024)

Kernel $k$-Medoids as General Vector Quantization
by: Gerlach, Thore, et al.
Published: (2025)

Accelerating the k-means++ Algorithm by Using Geometric Information
by: Corominas, Guillem Rodríguez, et al.
Published: (2024)

kNN-Graph: An adaptive graph model for $k$-nearest neighbors
by: Li, Jiaye, et al.
Published: (2026)

Dying Clusters Is All You Need -- Deep Clustering With an Unknown Number of Clusters
by: Leiber, Collin, et al.
Published: (2024)

RSPO: Risk-Seeking Policy Optimization for Pass@k and Max@k Metrics in Large Language Models
by: Zhang, Kaichen, et al.
Published: (2025)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture
by: Brilliantov, Kirill, et al.
Published: (2026)

Efficient Quantum Approximate $k$NN Algorithm via Granular-Ball Computing
by: Xia, Shuyin, et al.
Published: (2025)

Surprisal Driven $k$-NN for Robust and Interpretable Nonparametric Learning
by: Banerjee, Amartya, et al.
Published: (2023)

Irredundant $k$-Fold Cross-Validation
by: Aguilar-Ruiz, Jesus S.
Published: (2025)

SIMPLE: A Gradient Estimator for $k$-Subset Sampling
by: Ahmed, Kareem, et al.
Published: (2022)

Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations
by: Barceló, Pablo, et al.
Published: (2025)

$\mathbb{R}^{2k}$ is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval
by: Wang, Zihao, et al.
Published: (2026)

MultiwayPAM: Multiway Partitioning Around Medoids for LLM-as-a-Judge Score Analysis
by: Watanabe, Chihiro, et al.
Published: (2026)

Kimi k1.5: Scaling Reinforcement Learning with LLMs
by: Kimi Team, et al.
Published: (2025)

Lookbehind-SAM: k steps back, 1 step forward
by: Mordido, Gonçalo, et al.
Published: (2023)

Generalized Policy Improvement Algorithms with Theoretically Supported Sample Reuse
by: Queeney, James, et al.
Published: (2022)

ZETA: Leveraging Z-order Curves for Efficient Top-k Attention
by: Zeng, Qiuhao, et al.
Published: (2025)

Towards Robust Knowledge Tracing Models via k-Sparse Attention
by: Huang, Shuyan, et al.
Published: (2024)

Optimizing Partial Area Under the Top-k Curve: Theory and Practice
by: Wang, Zitai, et al.
Published: (2022)

Foundations of Top-$k$ Decoding For Language Models
by: Noarov, Georgy, et al.
Published: (2025)

Mini-Batch Kernel $k$-means
by: Jourdan, Ben, et al.
Published: (2024)

Efficient Prediction of Pass@k Scaling in Large Language Models
by: Kazdan, Joshua, et al.
Published: (2025)

Personalized Top-k Set Queries Over Predicted Scores
by: Nia, Sohrab Namazi, et al.
Published: (2025)

Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs
by: Bai, Sen, et al.
Published: (2025)

Finding Clustering Algorithms in the Transformer Architecture
by: Clarkson, Kenneth L., et al.
Published: (2025)

Wittgenstein's Family Resemblance Clustering Algorithm
by: Amanpour, Golbahar, et al.
Published: (2026)

Linking Robustness and Generalization: A k* Distribution Analysis of Concept Clustering in Latent Space for Vision Models
by: Kotyan, Shashank, et al.
Published: (2024)

Leveraging LLM Inconsistency to Boost Pass@k Performance
by: Dalal, Uri, et al.
Published: (2025)

RAP: Runtime Adaptive Pruning for LLM Inference
by: Liu, Huanrong, et al.
Published: (2025)

Evaluation of k-means time series clustering based on z-normalization and NP-Free
by: Lee, Ming-Chang, et al.
Published: (2024)

K-frames: Scene-Driven Any-k Keyframe Selection for long video understanding
by: Yao, Yifeng, et al.
Published: (2025)

HiRE: High Recall Approximate Top-$k$ Estimation for Efficient LLM Inference
by: L, Yashas Samaga B, et al.
Published: (2024)

k-Maximum Inner Product Attention for Graph Transformers and the Expressive Power of GraphGPS
by: De Schouwer, Jonas, et al.
Published: (2026)