Standard approaches for the classification of high dimensional data require the selection of features, the projection of the features to a lower dimensional space, and the construction of the classifier in the lower dimensional space. Two fundamental issues arise in determining an appropriate projection to a lower dimensional space: the target dimensionality for the projection must be determined, and a particular projection must be selected from a specified family. We present an algorithm which is designed specifically for classification task and addresses both these issues. The family of nonlinear projections considered is based on interpoint distances - in particular, we consider point-to-subset distances. Our algorithm selects both the number of subsets to use and the subsets themselves. The methodology is applied to an artificial nose odorant classification task.
[1]
J. Kauer,et al.
Rapid analyte recognition in a device based on optical sensors and the olfactory system.
,
1996,
Analytical chemistry.
[2]
R. Bartoszynski,et al.
Reducing multidimensional two-sample data to one-dimensional interpoint comparisons
,
1996
.
[3]
D. W. Scott,et al.
Multivariate Density Estimation, Theory, Practice and Visualization
,
1992
.
[4]
L. Cowen,et al.
Approximate Distance Classiication
,
1998
.
[5]
J. Kauer,et al.
A chemical-detecting system based on a cross-reactive optical sensor array
,
1996,
Nature.