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.
|Title of host publication||Sampling Techniques for Supervised or Unsupervised Tasks|
|Editors||Frédéric Ros, Serge Guillaume|
|Place of Publication||Cham|
|Publisher||Springer International Publishing AG|
|Number of pages||22|
|State||Published - 2020|