Data Stream Clustering with Affinity Propagation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Knowledge and Data Engineering Year : 2014

Data Stream Clustering with Affinity Propagation

Abstract

Data stream clustering provides insights into the under- lying patterns of data flows. This paper focuses on selecting the best representatives from clusters of streaming data. There are two main challenges: how to cluster with the best representatives and how to handle the evolving patterns that are important characteristics of streaming data with dynamic distributions. We employ the Affinity Propagation (AP) algorithm presented in 2007 by Frey and Dueck for the first challenge, as it offers good guarantees of clustering optimality for selecting exemplars. The second challenging problem is solved by change detection. The presented STRAP algorithm com- bines AP with a statistical change point detection test; the clustering model is rebuilt whenever the test detects a change in the underlying data distribution. Besides the validation on two benchmark data sets, the presented algorithm is validated on a real-world application, monitoring the data flow of jobs submitted to the EGEE grid.
Fichier principal
Vignette du fichier
strap_final_revision.pdf (1.11 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00862941 , version 1 (17-09-2013)

Identifiers

  • HAL Id : hal-00862941 , version 1

Cite

Xiangliang Zhang, Cyril Furtlehner, Cecile Germain-Renaud, Michèle Sebag. Data Stream Clustering with Affinity Propagation. IEEE Transactions on Knowledge and Data Engineering, 2014, 26 (7), pp.1. ⟨hal-00862941⟩
512 View
1355 Download

Share

Gmail Mastodon Facebook X LinkedIn More