A Note on Archetypal Analysis and the Approximation of Convex Hulls
Numerical Analysis
2014-10-03 v1 Computational Geometry
Abstract
We briefly review the basic ideas behind archetypal analysis for matrix factorization and discuss its behavior in approximating the convex hull of a data sample. We then ask how good such approximations can be and consider different cases. Understanding archetypal analysis as the problem of computing a convexity constrained low-rank approximation of the identity matrix provides estimates for archetypal analysis and the SiVM heuristic.
Keywords
Cite
@article{arxiv.1410.0642,
title = {A Note on Archetypal Analysis and the Approximation of Convex Hulls},
author = {Christian Bauckhage},
journal= {arXiv preprint arXiv:1410.0642},
year = {2014}
}