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
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
Ferrier, S., Manion, G., Elith, J., & Richardson, K. (2007) · Diversity and Distributions · doi:10.1111/j.1472-4642.2007.00341.x · Cited by 1,035
Multi-Similarity Loss With General Pair Weighting for Deep Metric Learning
Wang, X., Han, X., Huang, W., Dong, D., & Scott, M. R. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00516 · Cited by 854
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
Relevance feedback in image retrieval: A comprehensive review
Zhou, X. S., & Huang, T. S. (2003) · Multimedia Systems · doi:10.1007/s00530-002-0070-3 · Cited by 826
Wettschereck, D., Aha, D. W., & Mohri, T. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006593614256 · Cited by 717
Prototype Selection for Nearest Neighbor Classification: Taxonomy and Empirical Study
Garcia, S., Derrac, J., Cano, J. R., & Herrera, F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.142 · Cited by 695
Bottou, L., & Vapnik, V. (1992) · Neural Computation · doi:10.1162/neco.1992.4.6.888 · Cited by 542
Constructive Incremental Learning from Only Local Information
Schaal, S., & Atkeson, C. G. (1998) · Neural Computation · doi:10.1162/089976698300016963 · Cited by 517
Supervised Nonlinear Dimensionality Reduction for Visualization and Classification
Geng, X., Zhan, D.-C., & Zhou, Z.-H. (2005) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.850151 · Cited by 430
Artificial intelligence: foundations of computational agents
(2010) · Choice Reviews Online · doi:10.5860/choice.48-2130 · Cited by 415
Centroid-Based Document Classification: Analysis and Experimental Results
Han, E.-H., & Karypis, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_46 · Cited by 409
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification
Han, E.-H., Karypis, G., & Kumar, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45357-1_9 · Cited by 354
DeCLUTR: Deep Contrastive Learning for Unsupervised Textual Representations
Giorgi, J., Nitski, O., Wang, B., & Bader, G. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.72 · Cited by 350
Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study
Cano, J. R., Herrera, F., & Lozano, M. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819265 · Cited by 332
Atkeson, C. G., Moore, A. W., & Schaal, S. (1997) · Lazy Learning · doi:10.1007/978-94-017-2053-3_2 · Cited by 308
Locally adaptive metric nearest-neighbor classification
Domeniconi, C., Peng, J., & Gunopulos, D. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1033219 · Cited by 307
Prototype selection for dissimilarity-based classifiers
Pękalska, E., Duin, R. P. W., & Paclík, P. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2005.06.012 · Cited by 302
Combining Estimates in Regression and Classification
Leblanc, M., & Tibshirani, R. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476733 · Cited by 290
Randomized Clustering Forests for Image Classification
Moosmann, F., Nowak, E., & Jurie, F. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70822 · Cited by 287
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.