A nonlinear aggregation type classifier

09/04/2015
by   Alejandro Cholaquidis, et al.
0

We introduce a nonlinear aggregation type classifier for functional data defined on a separable and complete metric space. The new rule is built up from a collection of M arbitrary training classifiers. If the classifiers are consistent, then so is the aggregation rule. Moreover, asymptotically the aggregation rule behaves as well as the best of the M classifiers. The results of a small simulation are reported both, for high dimensional and functional data, and a real data example is analyzed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2020

A learning problem whose consistency is equivalent to the non-existence of real-valued measurable cardinals

We show that the k-nearest neighbour learning rule is universally consis...
research
01/20/2013

Cellular Tree Classifiers

The cellular tree classifier model addresses a fundamental problem in th...
research
12/21/2014

Principal Sensitivity Analysis

We present a novel algorithm (Principal Sensitivity Analysis; PSA) to an...
research
03/08/2021

A reproducing kernel Hilbert space framework for functional data classification

We encounter a bottleneck when we try to borrow the strength of classica...
research
05/11/2022

Analysis of convolutional neural network image classifiers in a rotationally symmetric model

Convolutional neural network image classifiers are defined and the rate ...
research
09/28/2021

Confusion-based rank similarity filters for computationally-efficient machine learning on high dimensional data

We introduce a novel type of computationally efficient artificial neural...
research
02/11/2021

Continuum centroid classifier for functional data

Aiming at the binary classification of functional data, we propose the c...

Please sign up or login with your details

Forgot password? Click here to reset