Publication

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Lingxiao Huang
2018
Conference Papers

Abstract

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of X, it holds that Sigma(x is an element of S) w(x).d(z) (x, C) is an element of (1 +/- epsilon) . Sigma(x is an element of X) d(z) (x, C).

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Chat with Graph Search

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Planning urban proximities: An empirical analysis of how residential preferences conflict with the urban morphologies and residential practices

Geometric Learning: Leveraging differential geometry for learning and control