Frugal and Online Affinity Propagation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Frugal and Online Affinity Propagation

Xiangliang Zhang
  • Function : Author
  • PersonId : 849671
Cyril Furtlehner
  • Function : Author
  • PersonId : 849672
Michèle Sebag
  • Function : Author
  • PersonId : 836537


A new Data Clustering algorithm, Affinity Propagation suffers from its quadratic complexity in function of the number of data items. Several extensions of Affinity Propagation were proposed aiming at online clustering in the data stream framework. Firstly, the case of multiply defined items, or weighted items is handled using Weighted Affinity Propagation(WAP). Secondly, Hierarchical AP achieves distributed AP and uses WAP to merge the sets of exemplars learned from subsets. Based on these two building blocks, the third algorithm performs Incremental Affinity Propagation on data streams. The paper validates the two algorithms both on benchmark and on real-world datasets. The experimental results show that the proposed approaches perform better than $K$-centers based approaches.
Fichier principal
Vignette du fichier
v5_for_final.pdf (150.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00287381 , version 1 (11-06-2008)


  • HAL Id : inria-00287381 , version 1


Xiangliang Zhang, Cyril Furtlehner, Michèle Sebag. Frugal and Online Affinity Propagation. Conférence francophone sur l'Apprentissage (CAP), May 2008, Ile de Porquerolles, France. ⟨inria-00287381⟩
261 View
262 Download


Gmail Facebook X LinkedIn More