Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Spalding-Jamieson, Jack, Robson, Eliot Wong, Zheng, Da Wei
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
by: Robson, Eliot W., et al.
Published: (2024)

Carving Polytopes with Saws in 3D
by: Robson, Eliot W., et al.
Published: (2024)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
by: Lynch, Jayson, et al.
Published: (2025)

Multi-Swap $k$-Means++
by: Beretta, Lorenzo, et al.
Published: (2023)

Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
by: Diwan, Haya, et al.
Published: (2024)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
by: Spalding-Jamieson, Jack
Published: (2025)

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
by: van der Laan, Joost, et al.
Published: (2026)

Angular Dispersion Accelerates $k$-Nearest Neighbors Machine Translation
by: Tokarchuk, Evgeniia, et al.
Published: (2025)

Morphing Planar Graph Drawings via Orthogonal Box Drawings
by: Biedl, Therese, et al.
Published: (2024)

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
by: Spalding-Jamieson, Jack, et al.
Published: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
by: Greenhut, Daniel, et al.
Published: (2025)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
by: Yu, Shangdi, et al.
Published: (2023)

Minimax Optimal Algorithms with Fixed-$k$-Nearest Neighbors
by: Ryu, J. Jon, et al.
Published: (2022)

The Road to the Closest Point is Paved by Good Neighbors
by: Har-Peled, Sariel, et al.
Published: (2025)

Slant/Gokigen Naname is NP-complete, and Some Variations are in P
by: Lynch, Jayson, et al.
Published: (2025)

CRINN: Contrastive Reinforcement Learning for Approximate Nearest Neighbor Search
by: Li, Xiaoya, et al.
Published: (2025)

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

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

Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2026)

SOAR: Improved Indexing for Approximate Nearest Neighbor Search
by: Sun, Philip, et al.
Published: (2024)

Scalable Disk-Based Approximate Nearest Neighbor Search with Page-Aligned Graph
by: Kang, Dingyi, et al.
Published: (2025)

Tensor-Train Point Cloud Compression and Efficient Approximate Nearest-Neighbor Search
by: Novikov, Georgii, et al.
Published: (2024)

Efficient Nearest Neighbor Search Using Dynamic Programming
by: Wang, Pengfei, et al.
Published: (2024)

Careful Seeding for k-Medois Clustering with Incremental k-Means++ Initialization
by: Cheng, Difei, et al.
Published: (2022)

Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
by: Krivošija, Amer, et al.
Published: (2025)

Consistency of the $k$-Nearest Neighbor Regressor under Complex Survey Designs
by: Hasler, Caren
Published: (2026)

Approximate Nearest Neighbor Search with Window Filters
by: Engels, Joshua, et al.
Published: (2024)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
by: Lu, Kejing, et al.
Published: (2024)

a-TMFG: Scalable Triangulated Maximally Filtered Graphs via Approximate Nearest Neighbors
by: Yelibi, Lionel
Published: (2026)

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms
by: Manohar, Magdalen Dobson, et al.
Published: (2023)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
by: Funk, Nicole, et al.
Published: (2026)

Improving Large-Scale k-Nearest Neighbor Text Categorization with Label Autoencoders
by: Ribadas-Pena, Francisco J., et al.
Published: (2024)

Linear time small coresets for k-mean clustering of segments with applications
by: Denisov, David, et al.
Published: (2025)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
by: Har-Peled, Sariel, et al.
Published: (2024)

Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph
by: Fu, Cong, et al.
Published: (2017)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
by: Zhang, Guangyi, et al.
Published: (2026)

Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search
by: Severo, Daniel, et al.
Published: (2025)

C-kNN-LSH: A Nearest-Neighbor Algorithm for Sequential Counterfactual Inference
by: Wang, Jing, et al.
Published: (2026)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
by: Abbasi, Fateme, et al.
Published: (2023)