Fast Approximate k-Means via Cluster Closures∗ Jing Wang† † Peking University Jingdong Wang‡ Qifa Ke§ Gang Zeng† Shipeng Li‡ - Wang Jing - Document - PDFSEARCH.IO

First Page	Meta Content
	Fast Approximate k-Means via Cluster Closures∗ Jing Wang† † Peking University Jingdong Wang‡ Qifa Ke§ Gang Zeng† Shipeng Li‡ Add to Reading List Document Date: 2012-03-30 05:59:51 Open Document File Size: 279,39 KB Share Result on Facebook City Oxford / Closure / / Company AKM / Microsoft Research Asia / / / Event Reorganization / / Facility University of Oxford / / IndustryTerm search range / image retrieval applications / iterative algorithm / approximate k-means algorithm / http / MarketIndex set 55 / / Organization idf / University of Oxford / Peking University / / Person Gang Zeng† Shipeng Li / Jing Wang / Gang Zeng / S. Netanyahu / / PublishedMedium IEEE Transactions on Information Theory / / Technology Lloyd algorithm / filtering algorithm / approximate k-means algorithm / proposed clustering algorithm / clustering algorithms / state-of-theart algorithms / accelerated algorithm / Canopy algorithm / machine learning / Coremeans algorithm / kmeans clustering algorithm / k-means algorithm / proposed algorithm / approximate k-means algorithms / k-means clustering algorithm / four clustering algorithms / iterative algorithm / iterative clustering algorithm / four approximate k-means algorithms / / URL http / SocialTag Cluster analysis Data mining Machine learning Geostatistics K-means clustering Nearest neighbor search Clustering high-dimensional data Consensus clustering Statistics Computational statistics

Fast Approximate k-Means via Cluster Closures∗ Jing Wang† † Peking University Jingdong Wang‡ Qifa Ke§ Gang Zeng† Shipeng Li‡Add to Reading List