University of Cambridge > Talks.cam > Machine Learning @ CUED > H-Infinity Clustering

Log in

University Account

External (via Google)

Information on

Subscribing to talks details

Finding a talk details

Adding a talk details

Disseminating talks details

Help and Documentation details

H-Infinity Clustering

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Log in

🔐 Log In

Information on

ℹ️ Information

H-Infinity Clustering

This talk is included in these lists:

H-Infinity Clustering

Abstract

Included in Lists

Log in

🔐 Log In

Information on

ℹ️ Information

H-Infinity Clustering

This talk is included in these lists:

Other lists

Other talks

H-Infinity Clustering

Abstract

Included in Lists