arXiv Analytics

Sign in

arXiv:cs/0402020 [cs.CV]AbstractReferencesReviewsResources

Geometrical Complexity of Classification Problems

Tin Kam Ho

Published 2004-02-11Version 1

Despite encouraging recent progresses in ensemble approaches, classification methods seem to have reached a plateau in development. Further advances depend on a better understanding of geometrical and topological characteristics of point sets in high-dimensional spaces, the preservation of such characteristics under feature transformations and sampling processes, and their interaction with geometrical models used in classifiers. We discuss an attempt to measure such properties from data sets and relate them to classifier accuracies.

Comments: Proceedings of the 7th Course on Ensemble Methods for Learning Machines at the International School on Neural Nets ``E.R. Caianiello''
Categories: cs.CV
Subjects: I.5.0
Related articles: Most relevant | Search more
arXiv:1901.02783 [cs.CV] (Published 2019-01-09)
The Use of Mutual Coherence to Prove $\ell^1/\ell^0$-Equivalence in Classification Problems
arXiv:1410.4393 [cs.CV] (Published 2014-10-16)
The HAWKwood Database
arXiv:2006.14086 [cs.CV] (Published 2020-06-24)
The flag manifold as a tool for analyzing and comparing data sets