Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing

Pattern Recognition

Volumn 30, Issue 2, 1997, Pages 281-288

  Decaestecker, Christine ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Annealing; Classifier; Gradient; Nearest neighbour; Optimisation; Prototypical reference vectors; Supervised learning

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; SIMULATED ANNEALING;

CLASSIFIER; NEAREST NEIGHBOUR; PROTOTYPICAL REFERENCE VECTORS; SUPERVISED LEARNING;

PATTERN RECOGNITION;

EID: 0031062148     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(96)00072-6     Document Type: Article

References (20)

1. B. V. Dasarathy (ed.), Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos, California (1991).
2. C. L. Chang, Finding prototypes for nearest neighbor classifiers, IEEE Trans. Comput. C-23, 1179-1184 (1974).
3. D. L. Reilly, L. N. Cooper and C. Elbaum, A neural model for category learning, Biol. Cybernetics 45, 35-41 (1982).
4. T. Kohonen, The self-organizing map, Proc. IEEE 9, 1464-1480 (1990).
5. H. Yan, Prototype optimization for nearest neighbor classifiers using a two-layer perceptron, Pattern Recognition 2, 317-324 (1993).
6. C. Decaestecker, A prototype-based neural net classifier, BENELEARN-94 (Proc. Belgian-Dutch Conference on Machine Learning), Technical Report EUR-CS-94-05, Department of Computer Sciences, Erasmus University Rotterdam, 217-229 (1994).
7. T. Kohonen, J. Kangas, J. Laaksonen and K. Torkkola, LVQ_PAK: A program package for correct application of learning vector quantization algorithms, Proc. IEEE Int. Joint Conf. on Neural Networks, Baltimore, I.725-I.730 (1992).
8. T. Van de Merckt, NFDT: A system that learns flexible concepts based on decision trees for numerical attributes, in Machine Learning (Proceedings of the 9th International Workshop), D. Sleeman and P. Edwards, eds, pp. 322-331. Morgan Kaufmann, Los Altos, California (1992).
9. K. Rose, E. Gurewitz and G. Fox, Statistical mechanics and phase transitions in clustering, Phys. Rev. Lett. 8, 945-948 (1990).
10. K. Rose, E. Gurewitz and G. Fox, A deterministic annealing approach to clustering, Pattern Recognition Lett. 11, 589-594 (1990).
11. K. Rose, E. Gurewitz and G. Fox, Deterministic annealing, constrained clustering and optimization, Proc. IEEE Int. Joint Conf. on Neural Net., Singapore, 2515-2520 (1991).
12. D. L. Medin and L. W. Barsalou, Categorization processes and categorical perception, in Categorical Perception: The Groundwork of Cognition, S. Harnard, ed., pp. 455-490. Cambridge University Press, Cambridge (1987).
13. J. R. Quinlan, C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, California (1993).
14. C. Decaestecker and M. Saerens, Comparisons of different RBF networks for pattern classification, Proc. Int. Conf. on Artificial Neural Networks (ICANN'95), Paris, 591-596 (1995).
15. L. Breiman, J. H. Friedman, R. A. Olshen and C. J. Stone, Classification and Regression Trees. Wadsworth and Brooks, Pacific Grove, California (1984).
16. D. W. Aha, D. Kibler and K. M. Albert, Instance-based learning algorithms, Machine Learning 6, 37-66 (1991).
17. C. Decaestecker and T. Van de Merckt, How to "secure" the decisions of a NN classifier, Proc. 1994 IEEE Int. Conf. on Neural Networks, Orlando, U.S.A., 263-268 (1994).
18. M. A. Kramer and J. A. Leonard, Diagnosis using backpropagation neural networks - Analysis and criticism. Comput. Chem. Engng. 14, 1323-1338 (1990).
19. D. G. Lowe, Similarity metric learning for a variable-kernel classifier, Neural Comput. 7, 72-85 (1995).
20. E. Hartman and J. D. Keeler, Predicting the future: Advantages of semilocal units, Neural Comput. 3, 566-578 (1991).