Subspace Clustering for all Seasons - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Subspace Clustering for all Seasons

(1, 2) , (2, 3, 1) , (2, 1)
1
2
3

Abstract

Subspace clustering is recognized as a more general and difficult task than standard clustering since it requires to identify not only objects sharing similar feature values but also the various subspaces where these similarities appear. Many approaches have been investigated for subspace clustering in the literature using various clustering paradigms. In this paper, we present Chameleoclust, an evolutionary subspace clustering algorithm that incorporates a genome having an evolvable structure. The genome is a coarse grained genome defined as a list of tuples (the "genes"), each tuple containing numbers. These tuples are mapped at the phenotype level to denote core point locations in different dimensions, which are then used to collectively build the subspace clusters, by grouping the data around the core points. The algorithm has been assessed using a reference framework for subspace clustering evaluation, and compared to state-of-the-art algorithms on both real and synthetic datasets. The results obtained with the Chameleoclust algorithm show that evolution of evolution, through an evolvable genome structure, is usefull to solve a difficult problem such as subspace clustering.
Fichier principal
Vignette du fichier
EvoEvo2015_submission_2.pdf (4.89 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01252793 , version 1 (08-01-2016)

Identifiers

  • HAL Id : hal-01252793 , version 1

Cite

Sergio Peignier, Christophe Rigotti, Guillaume Beslon. Subspace Clustering for all Seasons. EvoEvo Workshop (satellite workshop of ECAL 2015), Jul 2015, york, United Kingdom. pp.1-3. ⟨hal-01252793⟩
282 View
96 Download

Share

Gmail Facebook Twitter LinkedIn More