evolutionary clustering with arbitrary subspaces
Subspace clustering algorithms in their most general form attempt to describe data with clusters that are not constrained to index a common set of attributes. Previous evolutionary approaches to this problem have assumed a weaker model in which clusters are built in a common subset. Moreover, a filter method is generally assumed in which a classical clustering algorithm is employed in the inner loop. Needless to say, this presents a considerable computational overhead. In this work we recognize the utility of assuming a `bottom-up' approach to subspace clustering. Specifically, we apply a classical clustering algorithm to each attribute to establish 1-d clusters that are then indexed by a MOGA to design a population of subspace clusters. The ensuing search is entirely in terms of a combinatorial optimization problem, thus computationally very efficient. A final single objective GA is then applied to search the set of subspace clusters identified under the MOGA for the most suitable combination.
subspace clustering multi-objective genetic algorithm