Sparse classification boundaries

Details Sparse classification boundaries Sparse classification boundaries

2009-03-27

arxiv.org/abs/0903.4807v1

Mathematics

Statistics Theory

Scientific paper

Given a training sample of size $m$ from a $d$-dimensional population, we wish to allocate a new observation $Z\in \R^d$ to this population or to the noise. We suppose that the difference between the distribution of the population and that of the noise is only in a shift, which is a sparse vector. For the Gaussian noise, fixed sample size $m$, and the dimension $d$ that tends to infinity, we obtain the sharp classification boundary and we propose classifiers attaining this boundary. We also give extensions of this result to the case where the sample size $m$ depends on $d$ and satisfies the condition $(\log m)/\log d \to \gamma$, $0\le \gamma<1$, and to the case of non-Gaussian noise satisfying the Cram\'er condition.

Affiliated with

Also associated with

No associations

Rating

Sparse classification boundaries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sparse classification boundaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse classification boundaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21581