H-Infinity Clustering

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

• Prof. Sam Roweis (Toronto)
• Wednesday 28 May 2008, 14:00-15:00
• Engineering Department, CBL Room 438.

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

Normally in clustering we try to optimize some average distortion between the items and the prototypes. I’ll review a setup for clustering (vector quantization) in which the quantity of interest is the worst distortion between any item and its chosen prototype. Optimizing this (or a bound on it) creates a minimax problem similar to problems with a rich history in control theory and operations research. I’ll review a linear programming relaxation which solves the problem and discuss extensions to the setting of classification.

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

This talk is included in these lists:

• Seminar
• All Talks (aka the CURE list)
• Biology
• CBL important
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge Neuroscience Seminars
• Cambridge talks
• Chris Davis' list
• Creating transparent intact animal organs for high-resolution 3D deep-tissue imaging
• Engineering Department, CBL Room 438
• Featured lists
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Summary
• Information Engineering Division seminar list
• Interested Talks
• Joint Machine Learning Seminars
• Life Science
• Life Sciences
• ML
• Machine Learning @ CUED
• Machine Learning Summary
• Neuroscience
• Neuroscience Seminars
• Neuroscience Seminars
• Required lists for MLG
• Simon Baker's List
• Stem Cells & Regenerative Medicine
• Trust & Technology Initiative - interesting events
• bld31
• dh539
• kt532's list
• ndk22's list
• ob366-ai4er
• rp587
• yk373's list

Note that ex-directory lists are not shown.