Loading...
Please wait, while we are loading the content...
Similar Documents
Nonparametric Classification with Polynomial MPMC Cascades (2004)
| Content Provider | CiteSeerX |
|---|---|
| Author | Bohte, Sander M. Breitenbach, Markus Grudic, Gregory Z. |
| Abstract | A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial cascades is based on Minimax Probability Machine Classification (MPMC), which results in direct estimates of classification accuracy, and provides a simple stopping criteria that does not require expensive cross-validation measures. This Polynomial MPMC Cascade (PMC) algorithm is constructed in linear time with respect to the input space dimensionality, and linear time in the number of examples, making it a potentially attractive alternative to algorithms like support vector machines and standard MPMC. Experimental evidence is given showing that, compared to state-of-the-art classifiers, PMCs are competitive; inherently fast to compute; not prone to overfitting; and generally yield accurate estimates of the maximum error rate on unseen data. |
| File Format | |
| Publisher Date | 2004-01-01 |
| Access Restriction | Open |
| Subject Keyword | Maximum Error Rate Direct Estimate State-of-the-art Classifier Nonparametric Classification Polynomial Cascade Polynomial Mpmc Cascade Nonparametric Algorithm Standard Mpmc Low Dimensional Polynomial Structure Expensive Cross-validation Measure High-dimensional Binary Classification Minimax Probability Machine Classification Input Space Dimensionality Unseen Data Simple Stopping Criterion |
| Content Type | Text |
