2020, Vol. 5, Issue 4, Part C
Comparing clustering algorithms performance using multiple-objective functions
Author(s): Avinash Navlani and Dr. VB Gupta
Abstract: Clustering is the bunching of the data into groups of identical objects. Here each bunch is known as a cluster, each object is identical to its objects of the same cluster and different from other clusters. In this paper, we are doing an experimental study for comparing clustering algorithms using multiple-objective functions. We have investigated K-means a Partitioning-based clustering, Hierarchical clustering, Spectral clustering, Gaussian Mixture Model Clustering, and Clustering using Hidden Markov Model. The performance of these methods was compared using multiple objective functions. Multiple objectives have two core objectives: Cluster Homogeneity and separation. These multiple objective functions will be a great help to discover robust clusters in a more efficient way.
Pages: 246-248 | Views: 817 | Downloads: 9Download Full Article: Click Here
How to cite this article:
Avinash Navlani, Dr. VB Gupta. Comparing clustering algorithms performance using multiple-objective functions. Int J Stat Appl Math 2020;5(4):246-248.
