
MJ
Michael Joswig, Marek Kaluba, Lukas Ruff
· 1 min read
ResearcharXiv cs.LG
Random Polytope Descriptors
arXiv:2009.13987v3 Announce Type: replace
Abstract: We introduce a class of random polytopes which simultaneously generalizes several known constructions. While being fairly general, these polytopes are also computationally exceptionally benign. We indicate how these properties can be exploited for classification and clustering tasks in data analysis. Crucially, our construction lets users smoothly trade off between a tighter description of the data and faster computation.
Original source
This story was published by arXiv cs.LG and written by Michael Joswig, Marek Kaluba, Lukas Ruff. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


