Kernel spectral clustering for dynamic data

Abstract

This paper introduces a novel spectral clustering approach based on kernels to analyze time-varying data. Our approach is developed within a multiple kernel learning framework, which, in this case is assumed as a linear combination model. To perform such linear combination, weighting factors are estimated by a ranking procedure yielding a vector calculated from the eigenvectors-derived-clustering-method. Particularly, the method named kernel spectral clustering is considered. Proposed method is compared to some conventional spectral clustering techniques, namely, kernel k-means and min-cuts. Standard k-means as well. The clustering performance is quantified by the normalized mutual information and Adjusted Rand Index measures. Experimental results prove that proposed approach is an useful tool for both tracking and clustering dynamic data, being able to manage applications for human motion analysis. © Springer-Verlag 2013.