Large Margin Nearest Neighbor Classifiers

Authors:
Sergio Bermejo;Joan Cabestany
Affiliations:
-;-
Venue:
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Year:
2001

Citing 4
Cited 1

Self-organizing maps

Self-organizing maps
Learning with Nearest Neighbour Classifiers

Neural Processing Letters
Lessons in neural network training: overfitting may be harder than expected

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

IEEE Transactions on Information Theory

A Semi-Supervised Metric Learning for Content-Based Image Retrieval

International Journal of Computer Vision and Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Large margin classifiers are computed to assign patterns to a class with high confidence. This strategy helps controlling the capacity of the learning device so good generalization is presumably achieved. Two recent examples of large margin classifiers are support vector learning machines (SVM) [12] and boosting classifiers[10]. In this paper we show that it is possible to compute large-margin maximum classifiers using a gradient-based learning based on a cost function directly connected with their average margin. We also prove that the use of this procedure in nearestneighbor (NN) classifiers induce solutions closely related to support vectors.