Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, January 28, 2010, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Johannes Blömer (Paderborn University)

We consider the k-median problem, i.e. the problem of partitioning a set of n points into k disjoint sets called clusters, such that the sum of the distances of each point to the center of gravity of its cluster is minimized. To measure the distance between points we use so-called Bregman divergences which include among other distance measures the squared Euclidean distance and the Kulback-Leibler divergence from information theory. We show that a non-uniform sampling strategy analogous to the k-means++ method from Arthur and Vassilvitskii computes a constant factor approximation for well-separated instances of the k-median clustering for Bregman divergences.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login