Study and Comparison of Partitioning Clustering Algorithms

Faezeh Hosseininezhad, Afshin Salajegheh



Clustering is one of the main operations in data mining and its aim is to group similar objects in clusters. This technique seeks to discover structure of dataset by considering similarities or differences between data. Clustering algorithms can be divided into several categories including partitioning clustering algorithms, hierarchical algorithms and density based algorithms. In this paper we investigate some partitioning algorithms and consider them in term of some important parameters and finally compare them.


Han Jiawei, Kamber Micheline, “data mining consept and techniques, Elsevier,2006.

Jain Anil k.,” Data clustering: 50 years beyond K-means”, Pattern Recognition Letters.2009.

Huang Zhexue, “Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values”,

Velmurugan T. , Santhanam T., “A survey of partition based clustering algorithms in data mining: An experimental approach”, Information Technology Journal, pp. 478-484, 2011

Ahmadi Abbas, Karry Fakhri, Kamel Mohamed. “Flocking based approach for data clustering”, springer, 2009.

Cui Xiaohui, Potok Thomas E., Palathingal Paul, “Document clustering using particle swarm optimization”,2005 IEEE.

Rai Pradeep, Singh Shubha, “A survey of clustering technigues”, international journal of computer application, vol. 7, no. 12, 2010.

Agarwal Parul, Alam M. Afshar, Biswas Ranjit,” Issues, Challenges and Tools of Clustering Algorithms”, International Journal of Computer Science Issues(IJCSI), Vol. 8, Issue 3, No. 2, May 2011.


  • There are currently no refbacks.