Permutation Tests for Classification

Polina Golland, Feng Liang, Sayan Mukherjee, Dmitry Panchenko

Abstract

We describe a permutation procedure used extensively in classification problems in computational biology and medical imaging. We empirically study the procedure on simulated data and real examples from neuroimaging studies and DNA microarray analysis. A theoretical analysis is also suggested to assess the asymptotic behavior of the test. An interesting observation is that concentration of the permutation procedure is controlled by a Rademacher average which also controls the concentration of empirical errors to expected errors.
BibTeX
@inproceedings{golland2005permutation,
  author = {Polina Golland and Feng Liang and Sayan Mukherjee and Dmitry Panchenko},
  title = {{Permutation Tests for Classification}},
  booktitle = {Conference on Learning Theory},
  year = {2005},
  doi = {10.1007/11503415\_34},
}

Loading related content...

Figure