A genetic graph-based approach for partitional clustering

Menéndez, Héctor D. ORCID: https://orcid.org/0000-0002-6314-3725, Barrero, D.F. and Camacho, David ORCID: https://orcid.org/0000-0002-5051-3475 (2014) A genetic graph-based approach for partitional clustering. International Journal of Neural Systems, 24 (3) , 1430008. ISSN 0129-0657 [Article] (doi:10.1142/S0129065714300083)

Preview

PDF - Final accepted version (with author's formatting) Download (597kB) | Preview

Abstract

Clustering is one of the most versatile tools for data analysis. In the recent years, clustering that seeks the continuity of data (in opposition to classical centroid-based approaches) has attracted an increasing research interest. It is a challenging problem with a remarkable practical interest. The most popular continuity clustering method is the spectral clustering (SC) algorithm, which is based on graph cut: It initially generates a similarity graph using a distance measure and then studies its graph spectrum to find the best cut. This approach is sensitive to the parameters of the metric, and a correct parameter choice is critical to the quality of the cluster. This work proposes a new algorithm, inspired by SC, that reduces the parameter dependency while maintaining the quality of the solution. The new algorithm, named genetic graph-based clustering (GGC), takes an evolutionary approach introducing a genetic algorithm (GA) to cluster the similarity graph. The experimental validation shows that GGC increases robustness of SC and has competitive performance in comparison with classical clustering methods, at least, in the synthetic and real dataset used in the experiments.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

348Downloads

6 month trend

138Hits

Additional statistics are available via IRStats2.