On the Spectral Clustering for Dynamic Data

Spectral clustering has shown to be a powerful technique for grouping and/or rank data as well as a proper alternative for unlabeled problems. Particularly, it is a suitable alternative when dealing with pattern recognition problems involving highly hardly separable classes. Due to its versatility, applicability and feasibility, this clustering technique results appealing for many applications. Nevertheless, conventional spectral clustering approaches lack the ability to process dynamic or time-varying data. Within a spectral framework, this work presents an overview of clustering techniques as well as their extensions to dynamic data analysis.