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. 1312.3061
  4. Cited By
Fast Approximate $K$-Means via Cluster Closures

Fast Approximate KKK-Means via Cluster Closures

11 December 2013
Jing Wang
Jing Wang
Qifa Ke
Gang Zeng
Shipeng Li
ArXiv (abs)PDFHTML

Papers citing "Fast Approximate $K$-Means via Cluster Closures"

3 / 3 papers shown
Title
Scalable $k$-NN graph construction
Scalable kkk-NN graph construction
Jingdong Wang
Junchang Wang
Gang Zeng
Zhuowen Tu
Rui Gan
Shipeng Li
GNN
70
2
0
30 Jul 2013
Which Spatial Partition Trees are Adaptive to Intrinsic Dimension?
Which Spatial Partition Trees are Adaptive to Intrinsic Dimension?
Nakul Verma
Samory Kpotufe
S. Dasgupta
183
85
0
09 May 2012
Random Projections for $k$-means Clustering
Random Projections for kkk-means Clustering
Christos Boutsidis
Anastasios Zouzias
P. Drineas
CVBM
92
172
0
21 Nov 2010
1