Core-Sets: Updated Survey

Dan Feldman

doi:https://doi.org/10.1007/978-3-030-29349-9_2

Core-Sets: Updated Survey

Dan Feldman

Department of Computer Science

University of Haifa

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering problems, the input is a set of points in some metric space, and a common goal is to compute a set of centers in some other space (points, lines) that will minimize the sum of distances to these points. In database queries, we may need to compute such a sum for a specific query set of k centers.

Original language	American English
Title of host publication	Sampling Techniques for Supervised or Unsupervised Tasks
Editors	Frédéric Ros, Serge Guillaume
Place of Publication	Cham
Pages	23-44
Number of pages	22
DOIs	https://doi.org/10.1007/978-3-030-29349-9_2
State	Published - 2020

Access to Document

https://doi.org/10.1007/978-3-030-29349-9_2

Cite this

@inbook{d01295a20c4643929f8b5062b05a8751,

title = "Core-Sets: Updated Survey",

abstract = "In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering problems, the input is a set of points in some metric space, and a common goal is to compute a set of centers in some other space (points, lines) that will minimize the sum of distances to these points. In database queries, we may need to compute such a sum for a specific query set of k centers.",

author = "Dan Feldman",

year = "2020",

doi = "https://doi.org/10.1007/978-3-030-29349-9_2",

language = "American English",

isbn = "978-3-030-29349-9",

pages = "23--44",

editor = "Fr{\'e}d{\'e}ric Ros and Serge Guillaume",

booktitle = "Sampling Techniques for Supervised or Unsupervised Tasks",

}

TY - CHAP

T1 - Core-Sets

T2 - Updated Survey

AU - Feldman, Dan

PY - 2020

Y1 - 2020

N2 - In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering problems, the input is a set of points in some metric space, and a common goal is to compute a set of centers in some other space (points, lines) that will minimize the sum of distances to these points. In database queries, we may need to compute such a sum for a specific query set of k centers.

AB - In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering problems, the input is a set of points in some metric space, and a common goal is to compute a set of centers in some other space (points, lines) that will minimize the sum of distances to these points. In database queries, we may need to compute such a sum for a specific query set of k centers.

U2 - https://doi.org/10.1007/978-3-030-29349-9_2

DO - https://doi.org/10.1007/978-3-030-29349-9_2

M3 - Chapter

SN - 978-3-030-29349-9

SP - 23

EP - 44

BT - Sampling Techniques for Supervised or Unsupervised Tasks

A2 - Ros, Frédéric

A2 - Guillaume, Serge

CY - Cham

ER -

Core-Sets: Updated Survey

Abstract

Access to Document

Fingerprint

Cite this