University of Cambridge > > Machine Learning @ CUED > Extending the Affinity Propagation Model

Extending the Affinity Propagation Model

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani.

Affinity Propagation (AP, Frey & Dueck, 2007) is an exemplar-based clustering algorithm that is based on loopy belief-propagation on a particular factor-graph. In my talk I will present an alternative formulation and derivation of AP that lends itself nicely to modifications and extensions of the basic algorithm. In particular, I will discuss a semi-supervised variant of Affinity Propagation that uses equivalence constraints, and demonstrate its applicability to user interactive image segmentation. Finally, I will describe some on-going work regarding interesting links between the alternative AP formulation and some graph-theoretical problems such as bi-partite weighted matching, which lead us to believe it may be possible to establish convergence criteria for AP in terms of solutions obtained by linear programming relaxations.

This talk is part of the Machine Learning @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity