- In com****tional geometry, a
coreset is a
small set of
points that
approximates the
shape of a
larger point set, in the
sense that
applying some geometric...
- {\displaystyle r} is the
smallest possible radius of a
bounding sphere. A
coreset is a
small subset, that a 1 + ε {\displaystyle 1+\varepsilon } expansion...
-
points near the
boundary of the
convex hull of the
input are used as a
coreset, a
small set of
points whose optimum bounding box
approximates the optimum...
- Broderick,
Tamara (2017). "Automated
scalable Bayesian inference via
Hilbert coresets". arXiv:1710.05053 [stat.ML]. Schröder,
Ernst (1870). "Ueber
iterirte Functionen"...
-
involves algorithms for
cluster analysis,
including approximation algorithms,
coresets,
algorithmic fairness, and inapproximability. She
holds the
chair for Algorithms...
-
Schwiegelshohn and Omar Ali Sheikh-Omar: An
Empirical Evaluation of k-Means
Coresets Zoe Xi and
William Kuszmaul:
Approximating Dynamic Time
Warping Distance...
- 62 (2): 432. doi:10.1016/0022-247X(78)90137-3. Clarkson, K. L. (2010). "
Coresets, sp****
greedy approximation, and the Frank-Wolfe algorithm". ACM Transactions...
-
approximation is NP hard as ε is arbitrary. One
approach based on the
coreset concept is
proposed with
execution complexity of O ( 2 O ( k log k /...
-
Christian (June 6, 2007). "A PTAS for k-means
clustering based on weak
coresets".
Proceedings of the twenty-third
annual symposium on Com****tional geometry...
