A framework for statistical clustering with constant time approximation algorithms for K -median and K -means clustering

Author： Ben-David Shai  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.66, Iss.2-3, 2007-03, pp. : 243-257

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Novel Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance

By  

International Journal of Ambient Computing and Intelligence (IJACI), Vol. 7, Iss. 2, 2016-07 ,pp. : 47-74

IGI Global_journal

Access to resources Recommend Favorite

Feature Weighting in k -Means Clustering

By Modha D.S.  

Machine Learning, Vol. 52, Iss. 3, 2003-09 ,pp. : 217-237

Springer Publishing Company

Access to resources Recommend Favorite

Adapting k-means for supervised clustering

By Al-Harbi S.   Rayward-Smith V.  

Applied Intelligence, Vol. 24, Iss. 3, 2006-06 ,pp. : 219-226

Springer Publishing Company

Access to resources Recommend Favorite

Stability and model selection in k -means clustering

By Shamir Ohad  

Machine Learning, Vol. 80, Iss. 2-3, 2010-09 ,pp. : 213-243

Springer Publishing Company

Access to resources Recommend Favorite

ABK-means: an algorithm for data clustering using ABC and K-means algorithm

By Krishnamoorthi M.   Natarajan A.M.  

International Journal of Computational Science and Engineering, Vol. 8, Iss. 4, 2013-10 ,pp. : 383-391

Inderscience Publishers

Access to resources Recommend Favorite