@k.e.

Towards Effective Subspace Clustering with an Evolutionary Algorithm

, , , und . in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC’03, (2003)

Zusammenfassung

This paper proposes a new evolutionary algorithm for subspace clustering in very large and high dimensional databases. The design includes task-specific coding and genetic operators, along with a non-random initialization procedure. Reported experimental results show the algorithm scales almost linearly with the size and dimensionality of the database as well as the dimensionality of the hidden clusters.

Beschreibung

Towards Effective Subspace Clustering with an Evolutionary Algorithm

Links und Ressourcen

Tags