The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Similarity Metric Learning for a Variable-Kernel Classifier
Abstract
Nearest-neighbor interpolation algorithms have many useful properties for applications to learning, but they often exhibit poor generalization. In this paper, it is shown that much better generalization can be obtained by using a variable interpolation kernel in combination with conjugate gradient optimization of the similarity metric and kernel size. The resulting method is called variable-kernel similarity metric (VSM) learning. It has been tested on several standard classification data sets, and on these problems it shows better generalization than backpropagation and most other learning methods. The number of parameters that must be determined through optimization are orders of magnitude less than for backpropagation or radial basis function (RBF) networks, which may indicate that the method better captures the essential degrees of variation in learning. Other features of VSM learning are discussed that make it relevant to models for biological learning in the brain.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Locally Weighted Regression: An Approach to Regression Analysis by Local Fitting
Cleveland, W. S., & Devlin, S. J. (1988) · Journal of the American Statistical Association · doi:10.1080/01621459.1988.10478639 · Cited by 5,742
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
Radial Basis Functions, Multi-Variable Functional Interpolation and Adaptive Networks
Broomhead, D. S., & Lowe, D. (1988) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3,443
Self-citationAn Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Advances in Neural Information Processing Systems 5
Zemel, R. S., Williams, C. K. I., & Mozer, M. C. (1993) · Cited by 1,896
Parallel Networks that Learn to Pronounce English Text
B, T. J. S. A. (1987) · Cited by 1,514
Stanfill, C., & Waltz, D. (1986) · Communications of the ACM · doi:10.1145/7902.7906 · Cited by 1,218
Analysis of hidden units in a layered network trained to classify sonar targets
Gorman, R. P., & Sejnowski, T. J. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90023-8 · Cited by 1,114
Discriminant adaptive nearest neighbor classification
Hastie, T., & Tibshirani, R. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.506411 · Cited by 833
A Theory of Networks for Approximation and Learning
Poggio, T., & Girosi, F. (1989) · Cited by 703
Bottou, L., & Vapnik, V. (1992) · Neural Computation · doi:10.1162/neco.1992.4.6.888 · Cited by 542
Refinements to nearest-neighbor searching ink-dimensional trees
Sproull, R. F. (1991) · Algorithmica · doi:10.1007/bf01759061 · Cited by 349
Finding Prototypes For Nearest Neighbor Classifiers
Chang, C.-L. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223827 · Cited by 324
LEARNING ARM KINEMATICS AND DYNAMICS
Atkeson, C. G. (1989) · Annual Review of Neuroscience · doi:10.1146/annurev.ne.12.030189.001105 · Cited by 265
Rules and exemplars in categorization, identification, and recognition.
Nosofsky, R. M., Clark, S. E., & Shin, H. J. (1989) · Journal of Experimental Psychology: Learning, Memory, and Cognition · doi:10.1037//0278-7393.15.2.282 · Cited by 236
Improving the Performance of Radial Basis Function Networks by Learning Center Locations
Wettschereck, D., & Dietterich, T. G. (1991) · Cited by 153
Using locally weighted regression for robot learning
Atkeson, C. G. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131713 · Cited by 112
Best-First Model Merging for Dynamic Learning and Recognition
Omohundro, S. M. (1991) · Cited by 41
Constructing a generalizer superior to NETtalk via a mathematical theory of generalization
Wolpert, D. H. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90027-i · Cited by 33
Local discriminative learning for pattern recognition
Peng, J., & Bhanu, B. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(99)00209-5 · Cited by 11
Cited by
Novel methods improve prediction of species’ distributions from occurrence data
Elith*, J., H. Graham*, C., P. Anderson, R., Dudík, M., Ferrier, S., Guisan, A., J. Hijmans, R., Huettmann, F., R. Leathwick, J., Lehmann, A., et al. (2006) · Ecography · doi:10.1111/j.2006.0906-7590.04596.x · Cited by 9,088
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006559212014 · Cited by 1,671
(2016) · neural information processing systems · Cited by 1,572
Reduction Techniques for Instance-Based Learning Algorithms
Wilson, D. R., & Martinez, T. R. (2000) · Machine Learning · doi:10.1023/a:1007626913721 · Cited by 1,182
Metadata
- Authors
- Lowe, D. G.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1995-01
- Volume
- 7
- Issue
- 1
- Pages
- 72-85
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2035871002
- Cited by
- 267
- References
- 23
- FWCI
- 10.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.