Stochastic subspace search for top-k multi-view clustering
Geng Li, Stephan Günnemann, Mohammed Javeed Zaki · 2013
Finding multiple clustering solutions has recently gained much attention. Based on the observation that data is often multi-faceted, novel clustering methods have been introduced capable of detecting multiple, diverse clusterings. In this work-in-progress paper, we present a novel stochastic subspace search principle that tackles the requirements of multi-view clustering. The main idea is to consider each subspace as a state in a Markov chain and using Monte Carlo methods to sample the multi-view subspaces. By dynamically adapting the underlying probability density function we realize the generation of alternative clustering views. We present preliminary experimental results of our method and we describe future research directions.