High dimensional gaussian classification

06/04/2008
by   Robin Girard, et al.
0

High dimensional data analysis is known to be as a challenging problem. In this article, we give a theoretical analysis of high dimensional classification of Gaussian data which relies on a geometrical analysis of the error measure. It links a problem of classification with a problem of nonparametric regression. We give an algorithm designed for high dimensional data which appears straightforward in the light of our theoretical work, together with the thresholding estimation theory. We finally attempt to give a general treatment of the problem that can be extended to frameworks other than gaussian.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2020

Parallel subgroup analysis of high-dimensional data via M-regression

It becomes an interesting problem to identify subgroup structures in dat...
research
09/03/2020

Kernel Interpolation of High Dimensional Scattered Data

Data sites selected from modeling high-dimensional problems often appear...
research
02/11/2004

Geometrical Complexity of Classification Problems

Despite encouraging recent progresses in ensemble approaches, classifica...
research
05/21/2019

A Two-stage Classification Method for High-dimensional Data and Point Clouds

High-dimensional data classification is a fundamental task in machine le...
research
09/06/2022

Weak Collocation Regression method: fast reveal hidden stochastic dynamics from high-dimensional aggregate data

Revealing hidden dynamics from the stochastic data is a challenging prob...
research
03/22/2021

If You Must Choose Among Your Children, Pick the Right One

Given a simplicial complex K and an injective function f from the vertic...
research
06/24/2023

Robust Classification of High-Dimensional Data using Data-Adaptive Energy Distance

Classification of high-dimensional low sample size (HDLSS) data poses a ...

Please sign up or login with your details

Forgot password? Click here to reset