An Impossibility Theorem for Clustering

Mel Chen

Friday 24th June, 2016 16:00-17:00 Maths 326


This talk will be based on the paper "An Impossibility Theorem for Clustering" by J. Kleinberg. I will give a brief introduction to clustering algorithms, as well as definitions of scale-invariance, richness, and consistency. The I'll give the proof of the theorem, as well as examples of clustering algorithms which satisfy two of the properties, and a relaxation of the third.

Add to your calendar

Download event information as iCalendar file (only this event)