Empirical comparison of fast partitioning-based clustering algorithms for large data sets

Author： Wei C.-P.   Lee Y.-H.   Hsu C.-M.  

Publisher： Elsevier

ISSN： 0957-4174

Source： Expert Systems with Applications, Vol.24, Iss.4, 2003-05, pp. : 351-363

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

Accelerated EM-based clustering of large data sets

By Verbeek Jakob   Nunnink Jan   Vlassis Nikos  

Data Mining and Knowledge Discovery, Vol. 13, Iss. 3, 2006-11 ,pp. : 291-307

Springer Publishing Company

Access to resources Recommend Favorite

LARGE SCALE DATA MINING BASED ON DATA PARTITIONING

By Zhang Shichao  

Applied Artificial Intelligence, Vol. 15, Iss. 2, 2001-02 ,pp. : 129-139

Taylor & Francis Ltd

Access to resources Recommend Favorite

Hypergraph Models and Algorithms for Data-Pattern-Based Clustering

By Ozdal Muhammet   Aykanat Cevdet  

Data Mining and Knowledge Discovery, Vol. 9, Iss. 1, 2004-07 ,pp. : 29-57

Springer Publishing Company

Access to resources Recommend Favorite

Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values

By Huang Zhexue  

Data Mining and Knowledge Discovery, Vol. 2, Iss. 3, 1998-09 ,pp. : 283-304

Springer Publishing Company

Access to resources Recommend Favorite

Leaders-Subleaders: An efficient hierarchical clustering algorithm for large data sets

By Vijaya P.A.   Narasimha Murty M.   Subramanian D.K.  

Pattern Recognition Letters, Vol. 25, Iss. 4, 2004-03 ,pp. : 505-513

Elsevier

Access to resources Recommend Favorite