Bumptrees for Efficient Function, Constraint, and Classification Learning (1990)
by
Stephen M. Omohundro
| Venue: | ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 3 |
| Citations: | 48 - 2 self |
BibTeX
@INPROCEEDINGS{Omohundro90bumptreesfor,
author = {Stephen M. Omohundro},
title = {Bumptrees for Efficient Function, Constraint, and Classification Learning},
booktitle = {ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 3},
year = {1990},
pages = {693--699},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. An empirical comparison with radial basis functions is presented on a robot arm mapping learning task. Applications to density estimation, classification, and constraint representation and learning are also outlined.
Citations
| 488 | an algorithm for finding best matches in logarithmic expected time - Friedman, Bentley, et al. - 1977 |
| 78 | Efficient algorithms with neural network behavior - Omohundro - 1987 |
| 46 | Five Balltree Construction Algorithms - Omohundro - 1989 |
| 25 | Connectionist Robot Motion Planning: A Neurally-Inspired Approach to Visually-Guided Reaching - Mel - 1990 |
| 19 | Nonparametric Density Estimation: The L1 - Devroye, Györfi - 1985 |
| 14 | Geometric learning algorithms - Omohundro - 1987 |
