Geometrical Complexity of Classification Problems

02/11/2004
by   Tin Kam Ho, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2008

High dimensional gaussian classification

High dimensional data analysis is known to be as a challenging problem. ...
research
08/12/2019

Measure Dependent Asymptotic Rate of the Mean: Geometrical and Topological Smeariness

We revisit the generalized central limit theorem (CLT) for the Fréchet m...
research
02/20/2019

Mexican Hat Wavelet Kernel ELM for Multiclass Classification

Kernel extreme learning machine (KELM) is a novel feedforward neural net...
research
02/11/2013

Geometrical complexity of data approximators

There are many methods developed to approximate a cloud of vectors embed...
research
08/10/2020

Measuring shape relations using r-parallel sets

Geometrical measurements of biological objects form the basis of many qu...
research
04/29/2018

A Nonparametric Ensemble Binary Classifier and its Statistical Properties

In this work, we propose an ensemble of classification trees (CT) and ar...
research
01/02/2022

Analysis of the Concepts of Plaster Decorations and Epigraphs in the Altar of the Great Mosque of Urmia

Ilkhanid art has a unique and special status in the arts of Islamic peri...

Please sign up or login with your details

Forgot password? Click here to reset