Name
Abstract | ||
|---|---|---|
If patterns are drawn from an n-dimensional feature space according to a probability distribution that obeys a weak smoothness criterion, we show that the probability that a random input pattern is misclassified by a nearest-neighbor classifier using M random reference patterns asymptoti(cid:173) cally satisfies |
Year | Venue | Keywords |
|---|---|---|
1990 | NIPS | nearest-neighbor classifier |
Field | DocType | ISBN |
Feature vector,Exponent,Curse of dimensionality,Probability distribution,Artificial intelligence,Classifier (linguistics),Margin classifier,Bayes error rate,Machine learning,Bayes classifier,Mathematics | Conference | 1-55860-184-8 |
Citations | PageRank | References |
2 | 0.75 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert R. Snapp | 1 | 56 | 52.96 |
| Demetri Psaltis | 2 | 431 | 209.24 |
| Santosh S. Venkatesh | 3 | 381 | 71.80 |