Modern classification techniques perform well when the number of training examples exceed the number of features. If, however, the number of features greatly exceed the number of training examples, then these same techniques can fail. To address this problem, we present a hierarchical Bayesian framework that shares information between features by modeling similarities between their parameters. We believe this approach is applicable to many sparse, high dimensional problems and especially relevant to those with both spatial and temporal components. One such problem is fMRI time series, and we present a case study that shows how we can successfully classify in this domain with 80,000 original features and only 2 training examples per class. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Palatucci, M., & Mitchell, T. M. (2007). Classification in very high dimensional problems with handfuls of examples. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4702 LNAI, pp. 212–223). Springer Verlag. https://doi.org/10.1007/978-3-540-74976-9_22
Mendeley helps you to discover research relevant for your work.