Incremental multi-class semi-supervised clustering regularized by Kalman filtering

Siamak Mehrkanoon*, Oscar Mauricio Agudelo, Johan A. K. Suykens

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


This paper introduces an on-line semi-supervised learning algorithm formulated as a regularized kernel spectral clustering (KSC) approach. We consider the case where new data arrive sequentially but only a small fraction of it is labeled. The available labeled data act as prototypes and help to improve the performance of the algorithm to estimate the labels of the unlabeled data points. We adopt a recently proposed multi-class semi-supervised KSC based algorithm (MSS-KSC) and make it applicable for online data clustering. Given a few user-labeled data points the initial model is learned and then the class membership of the remaining data points in the current and subsequent time instants are estimated and propagated in an on-line fashion. The update of the memberships is carried out mainly using the out-of-sample extension property of the model. Initially the algorithm is tested on computer-generated data sets, then we show that video segmentation can be cast as a semi-supervised learning problem. Furthermore we show how the tracking capabilities of the Kalman filter can be used to provide the labels of objects in motion and thus regularizing the solution obtained by the MSS-KSC algorithm. In the experiments, we demonstrate the performance of the proposed method on synthetic data sets and real-life videos where the clusters evolve in a smooth fashion over time. (C) 2015 Elsevier Ltd. All rights reserved.

Original languageEnglish
Pages (from-to)88-104
Number of pages17
JournalNeural Networks
Publication statusPublished - Nov 2015
Externally publishedYes


  • Incremental semi-supervised clustering
  • Non-stationary data
  • Video segmentation
  • Low embedding dimension
  • Kernel spectral clustering
  • Kalman filtering

Cite this