Comparison Between Gustafson-Kessel Clustering and Fuzzy C-Means Clustering

Loading...
Thumbnail Image

URL

Journal Title

Journal ISSN

Volume Title

Insinööritieteiden korkeakoulu | Bachelor's thesis

Department

Mcode

ENG3082

Language

en

Pages

26

Series

Abstract

Clustering is an important technique utilized in unsupervised learning that groups data points based on similarity. This grouping facilitates the discovery of hidden trends in unexplored data. Nonetheless, many classical algorithms are insufficient for real-world data, since they cannot create multiclass classifications or detect overlapping clusters. To counter the problem, existing clustering methods were combined with fuzzy logic, leading to more versatile algorithms, such as fuzzy c-means and Gustafson-Kessel. Therefore, this thesis analyzes the performance of the standard Gustafson-Kessel algorithm and one of its variants and compares it to fuzzy c-means on the Iris dataset. Furthermore, it describes the implementation of both the standard and the modified Gustafson-Kessel algorithms in the programming language Julia. The results of the study indicate that the modification is required for the stability of Gustafson-Kessel for datasets with few data points or linear clusters. Nonetheless, its usage on general datasets significantly decreased the average performance compared to the standard version and even fuzzy c-means.

Description

Supervisor

St-Pierre, Luc

Thesis advisor

Ferranti, Luca

Other note

Citation