NDLI: Fast approximate k-means via cluster closures

Content Provider	IEEE Xplore Digital Library
Author	Jing Wang Jingdong Wang Qifa Ke Gang Zeng Shipeng Li
Copyright Year	2012
Description	Author affiliation: Microsoft Research Asia (Jingdong Wang; Shipeng Li) \|\| Peking University (Jing Wang; Gang Zeng) \|\| Microsoft Research Silicon Valley (Qifa Ke)
Abstract	K-means, a simple and effective clustering algorithm, is one of the most widely used algorithms in computer vision community. Traditional k-means is an iterative algorithm — in each iteration new cluster centers are computed and each data point is re-assigned to its nearest center. The cluster re-assignment step becomes prohibitively expensive when the number of data points and cluster centers are large. In this paper, we propose a novel approximate k-means algorithm to greatly reduce the computational complexity in the assignment step. Our approach is motivated by the observation that most active points changing their cluster assignments at each iteration are located on or near cluster boundaries. The idea is to efficiently identify those active points by pre-assembling the data into groups of neighboring points using multiple random spatial partition trees, and to use the neighborhood information to construct a closure for each cluster, in such a way only a small number of cluster candidates need to be considered when assigning a data point to its nearest cluster. Using complexity analysis, real data clustering, and applications to image retrieval, we show that our approach out-performs state-of-the-art approximate k-means algorithms in terms of clustering quality and efficiency.
Starting Page	3037
Ending Page	3044
File Size	308301
Page Count	8
File Format	PDF
ISBN	9781467312264
ISSN	10636919
e-ISBN	9781467312288
e-ISBN	9781467312271
DOI	10.1109/CVPR.2012.6248034
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-16
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clustering algorithms Vegetation Image retrieval Visualization Complexity theory Algorithm design and analysis Instruction sets
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast Approximate k-Means via Cluster Closures∗

Fast Approximate $K$-Means via Cluster Closures

Contribution-based clustering algorithm for content-based image retrieval

Accessing relevant images: Fuzzy K-Means

Efficient Implementation of the Fuzzy c-Means Clustering Algorithms

K-Means Graph Database Clustering and Matching for Fingerprint Recognition

An efficient K-Means clustering algorithm for reducing time complexity using uniform distribution data points

A Novel Fast Massive Data Retrieval Method

Transitive Distance Clustering with K-Means Duality

Fast approximate k-means via cluster closures

Similar Documents

Fast Approximate k-Means via Cluster Closures∗

Fast Approximate $K$-Means via Cluster Closures

Contribution-based clustering algorithm for content-based image retrieval

Accessing relevant images: Fuzzy K-Means

Efficient Implementation of the Fuzzy c-Means Clustering Algorithms

K-Means Graph Database Clustering and Matching for Fingerprint Recognition

An efficient K-Means clustering algorithm for reducing time complexity using uniform distribution data points

A Novel Fast Massive Data Retrieval Method

Transitive Distance Clustering with K-Means Duality

Fast approximate k-means via cluster closures