Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Spalding-Jamieson, Jack, Robson, Eliot Wong, Zheng, Da Wei
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
par: Robson, Eliot W., et autres
Publié: (2024)

Carving Polytopes with Saws in 3D
par: Robson, Eliot W., et autres
Publié: (2024)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
par: Lynch, Jayson, et autres
Publié: (2025)

Multi-Swap $k$-Means++
par: Beretta, Lorenzo, et autres
Publié: (2023)

Graph-Based Nearest-Neighbor Search without the Spread
par: Giliberti, Jeff, et autres
Publié: (2026)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
par: Diwan, Haya, et autres
Publié: (2024)

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

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
par: van der Laan, Joost, et autres
Publié: (2026)

Angular Dispersion Accelerates $k$-Nearest Neighbors Machine Translation
par: Tokarchuk, Evgeniia, et autres
Publié: (2025)

Morphing Planar Graph Drawings via Orthogonal Box Drawings
par: Biedl, Therese, et autres
Publié: (2024)

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
par: Spalding-Jamieson, Jack, et autres
Publié: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
par: Greenhut, Daniel, et autres
Publié: (2025)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
par: Yu, Shangdi, et autres
Publié: (2023)

Minimax Optimal Algorithms with Fixed-$k$-Nearest Neighbors
par: Ryu, J. Jon, et autres
Publié: (2022)

The Road to the Closest Point is Paved by Good Neighbors
par: Har-Peled, Sariel, et autres
Publié: (2025)

Slant/Gokigen Naname is NP-complete, and Some Variations are in P
par: Lynch, Jayson, et autres
Publié: (2025)

CRINN: Contrastive Reinforcement Learning for Approximate Nearest Neighbor Search
par: Li, Xiaoya, et autres
Publié: (2025)

Nearest Neighbor Searching in a Dynamic Simple Polygon
par: de Berg, Sarita, et autres
Publié: (2025)

Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations
par: Barceló, Pablo, et autres
Publié: (2025)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
par: Krauthgamer, Robert, et autres
Publié: (2026)

SOAR: Improved Indexing for Approximate Nearest Neighbor Search
par: Sun, Philip, et autres
Publié: (2024)

Scalable Disk-Based Approximate Nearest Neighbor Search with Page-Aligned Graph
par: Kang, Dingyi, et autres
Publié: (2025)

Tensor-Train Point Cloud Compression and Efficient Approximate Nearest-Neighbor Search
par: Novikov, Georgii, et autres
Publié: (2024)

Efficient Nearest Neighbor Search Using Dynamic Programming
par: Wang, Pengfei, et autres
Publié: (2024)

Careful Seeding for k-Medois Clustering with Incremental k-Means++ Initialization
par: Cheng, Difei, et autres
Publié: (2022)

Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
par: Krivošija, Amer, et autres
Publié: (2025)

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

Approximate Nearest Neighbor Search with Window Filters
par: Engels, Joshua, et autres
Publié: (2024)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
par: Lu, Kejing, et autres
Publié: (2024)

a-TMFG: Scalable Triangulated Maximally Filtered Graphs via Approximate Nearest Neighbors
par: Yelibi, Lionel
Publié: (2026)

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms
par: Manohar, Magdalen Dobson, et autres
Publié: (2023)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
par: Funk, Nicole, et autres
Publié: (2026)

Improving Large-Scale k-Nearest Neighbor Text Categorization with Label Autoencoders
par: Ribadas-Pena, Francisco J., et autres
Publié: (2024)

Linear time small coresets for k-mean clustering of segments with applications
par: Denisov, David, et autres
Publié: (2025)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
par: Har-Peled, Sariel, et autres
Publié: (2024)

Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph
par: Fu, Cong, et autres
Publié: (2017)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
par: Zhang, Guangyi, et autres
Publié: (2026)

Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search
par: Severo, Daniel, et autres
Publié: (2025)

C-kNN-LSH: A Nearest-Neighbor Algorithm for Sequential Counterfactual Inference
par: Wang, Jing, et autres
Publié: (2026)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
par: Abbasi, Fateme, et autres
Publié: (2023)