Machine Learning Meetings and Events
Group Meetings: Group meetings are held Mondays from 11am to Noon (talk starts 11:10am) in D.L. Pratt 290C unless otherwise noted. Meetings are coordinated by Hugo Larochelle.
Tea Talks: Tea talks are held every Wednesday at 4:00pm in D.L. Pratt 290C. Talks should be simple, accessible, and not exceed 15 minutes. Speakers bring snacks, make tea, and provide a copy of the presented paper.
Group Meeting Nov 9, 2009: Hierarchical Affinity Propagation
- Speaker: Inmar Givoni
- Abstract:
Affinity Propagation is an exemplar-based clustering algorithm that finds a set of data-points that best exemplify the data, and associates each data-point with one exemplar. In this work we extend affinity propagation in a principled way to solve the hierarchical clustering problem - an important variant of clustering that is useful for analyzing biological data, decision making in operational research domains, and many other tasks. We describe several variants of the problem, including a hierarchical facility location formulation, and we derive their respective inference algorithms. We demonstrate that our method is able to outperform greedy, initialization-sensitive methods.