BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Extending the Affinity Propagation Model - Inmar Givoni (Universit
 y of Toronto)
DTSTART:20090130T130000Z
DTEND:20090130T140000Z
UID:TALK16427@talks.cam.ac.uk
CONTACT:Zoubin Ghahramani
DESCRIPTION: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 formul
 ation and derivation of AP that lends itself nicely to modifications and e
 xtensions of the basic algorithm. In particular\, I will discuss a semi-su
 pervised variant of Affinity Propagation that uses equivalence constraints
 \, and demonstrate its applicability to user interactive image segmentatio
 n. Finally\, I will describe some on-going work regarding interesting link
 s between the alternative AP formulation and some graph-theoretical proble
 ms 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. 
LOCATION:Engineering Department\, CBL Room 438
END:VEVENT
END:VCALENDAR