Dipanjyoti Paul
ABSTRACT
Subspace clustering techniques become popular in identifying local patterns from high dimensional data. In this paper, we present a multiobjective optimization based evolutionary algorithm in order to tackle the subspace clustering problem. Previous state-of-the-art algorithms on subspace clustering optimize implicitly or explicitly a single cluster quality measure. The proposed approach optimizes two cluster quality measures namely PBM-index and XB-index simultaneously. The developed algorithm is applied to seven standard real-life datasets for identifying different subspace clusters. Experimentation reveals that the proposed algorithm is able to take advantages of its evolvable genomic structure and multiobjective based framework and it can be applied to any data set.
- Bernard Desgraupes. 2013. Clustering indices. University of Paris Ouest-Lab ModalX 1 (2013), 34.Google Scholar
- Saku Kukkonen and Kalyanmoy Deb. 2006. Improved pruning of non-dominated solutions based on crowding distance for bi-objective optimization problems. In Evolutionary Computation, 2006. CEC 2006. IEEE Congress on. IEEE, 1179--1186.Google ScholarCross Ref
- M. Lichman. 2013. UCI Machine Learning Repository. (2013). http://archive.ics.uci.edu/mlGoogle Scholar
- Emmanuel Müller, Stephan Günnemann, Ira Assent, and Thomas Seidl. 2009. Evaluating clustering in subspace projections of high dimensional data. Proceedings of the VLDB Endowment 2, 1 (2009), 1270--1281. Google ScholarDigital Library
- Anne Patrikainen and Marina Meila. 2006. Comparing subspace clusterings. IEEE Transactions on knowledge and data engineering 18, 7 (2006), 902--916. Google ScholarDigital Library
- Peignier. S. 2017. Subspace clustering on static datasets and dynamic data streams using bio-inspired algorithms. PhD thesis, INSA, Lyon, France. (2017).Google Scholar
- Sriparna Saha and Sanghamitra Bandyopadhyay. 2013. A generalized automatic clustering algorithm in a multiobjective framework. Applied Soft Computing 13, 1 (2013), 89--108. Google ScholarDigital Library
Recommendations
Fusion of evolvable genome structure and multi-objective optimization for subspace clustering
Highlights- This paper reports the first attempt in integrating multiobjective opti- mization (MOO) and genomic structure for solving the subspace clustering problem.
AbstractSubspace clustering techniques become paramount in pattern recognition for detecting local variations from high dimensional data. Several techniques exist in the recent literature for subspace clustering, majority of which optimize ...
Subspace Clustering Using Evolvable Genome Structure
GECCO '15: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary ComputationIn this paper we present an evolutionary algorithm to tackle the subspace clustering problem. Subspace clustering is recognized as more difficult than standard clustering since it requires to identify not only the clusters but also the various subspaces ...
Subspace Clustering for High-Dimensional Data Using Cluster Structure Similarity
This article describes how recently, because of the curse of dimensionality in high dimensional data, a significant amount of research has been conducted on subspace clustering aiming at discovering clusters embedded in any possible attributes ...
Comments