BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:H-Infinity Clustering - Prof. Sam Roweis (Toronto)
DTSTART:20080528T130000Z
DTEND:20080528T140000Z
UID:TALK12213@talks.cam.ac.uk
CONTACT:Zoubin Ghahramani
DESCRIPTION:Normally in clustering we try to optimize some average distort
 ion between the items and the prototypes. I'll review a setup for clusteri
 ng (vector quantization) in which the quantity of interest is the worst di
 stortion between any item and its chosen prototype. Optimizing this (or a 
 bound on it) creates a minimax problem similar to problems with a rich his
 tory in control theory and operations research. I'll review a linear progr
 amming relaxation which solves the problem and discuss extensions to the s
 etting of classification.
LOCATION:Engineering Department\, CBL Room 438
END:VEVENT
END:VCALENDAR