Adaptive relevance matrices in learning vector quantization

Neural Computation

Volumn 21, Issue 12, 2009, Pages 3532-3561

  Schneider, Petra ^a   Biehl, Michael ^a   Hammer, Barbara ^b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTIFICIAL INTELLIGENCE; BRAIN; HUMAN; INFORMATION PROCESSING; INFORMATION SCIENCE; LEARNING; LETTER; PHYSIOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; AUTOMATIC DATA PROCESSING; BRAIN; HUMANS; INFORMATION THEORY; LEARNING; PROBABILITY LEARNING;

EID: 72249111970     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/neco.2009.11-08-908     Document Type: Letter

References (27)

1. Bartlett, P. L., & Mendelson, S. (2003). Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3, 463-482.
2. Bertsekas, D. (1976). On the Goldstein-Levitin-Polyak gradient projection method. IEEE Transactions on Automatic Control, 21(2), 174-184.
3. Biehl, M., Ghosh, A., & Hammer, B. (2006). Learning vector quantization: The dynamics of winner-takes-all algorithms. Neurocomputing, 69(7-9), 660-670.
4. Biehl, M., Ghosh, A., & Hammer, B. (2007). Dynamics and generalization ability of LVQ algorithms. Journal of Machine Learning Research, 8, 323-360.
5. Bojer, T., Hammer, B., Schunk, D., & von Toschanowitz, K. T. (2001). Relevance determination in learning vector quantization. In M. Verleysen (Ed.), European symposium on artificial neural networks (pp. 271-276). Brussels: D-Facto Publishing.
6. Bunte, K., Schneider, P., Hammer, B., Schleif, F.-M., Villmann, T., & Biehl, M. (2008). Discriminative visualization by limited rank matrix learning (Tech. Rep. No. MLR-03-2008). Leipzig: University of Leipzig. Available online at http://www.uni-leipzig.de/~compint/mlr/mlr_03_2008.pdf.
7. Crammer, K., Gilad-Bachrach, R., Navot, A., & Tishby, A (2003). Margin analysis of the LVQ algorithm. In S. Becker, S. Thrün, & K. Obermayer (Eds.), Advances in neural information processing systems, 15 (pp. 462-469). Cambridge, MA: MIT Press.
8. Duda, R.O., Hart, P. E., & Stork, D. G. (2000). Pattern classification (2nd ed.).Hoboken, NJ:Wiley-Interscience.
9. Gath, I., & Geva, A. B. (1989). Unsupervised optimal fuzzy clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(7), 773-780.
10. Ghosh, A., Biehl,M., & Hammer, B. (2006). Performance analysis of LVQ algorithms: A statistical physics approach. Neural Networks, 19(6), 817-829.
11. Gustafson, E., & Kessel, W. (1979). Fuzzy clustering with a fuzzy covariance matrix. In IEEE conference on decision and control, (pp. 761-766). Piscataway, NJ: IEEE Press.
12. Hammer, B., Schleif, F.-M., & Villmann, T. (2005). On the generalization ability of prototype-based classifiers with local relevance determination (Tech. Rep. No. Ifi-05-14). Clausthal-Zellerfeld, Germany: Clausthal University of Technology.
13. Hammer, B., Strickert, M., & Villmann, T. (2004). Prototype based recognition of splice sites. In U. Seiffert, L. C. Jain, & P. Schweizer (Eds.), Bioinformatics using computational intelligence paradigms (pp. 25-56). New York: Springer.
14. Hammer, B., Strickert, M., & Villmann, T. (2005a). On the generalization ability of GRLVQ networks. Neural Processing Letters, 21(2), 109-120.
15. Hammer, B., Strickert,M.,&Villmann, T. (2005b). Supervised neural gas with general similarity measure. Neural Processing Letters, 21(1), 21-44.
16. Hammer, B., & Villmann, T. (2002). Generalized relevance learning vector quantization. Neural Networks, 15(8-9), 1059-1068.
17. Kohonen, T. (1997). Self-organizing maps (2nd ed.). Berlin: Springer.
18. Ledoux, M., & Talagrand, M. (1991). Probability in Banach spaces. Berlin: Springer.
19. Neural Networks Research Centre, Helsinki University of Technology. (2002). Bibliography on the Self-Organizing Map (SOM) and Learning Vector Quantization (LVQ). Espoo: Author.
20. Newman, D. J., Hettich, S., Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases. Available online at http://archive.ics.uci.edu/ml/. University of California, Department of Information and Computer Science.
21. Prudent, Y., & Ennaji, A (2005). A K nearest classifier design. Electronic Letters on Computer Vision and Image Analysis, 5(2), 58-71.
22. Rätsch, G., & Sonnenburg, S. (2004). Accurate splice site prediction for Caenorhabditis elegans. In B. Schölkopf, K. Tsuda, & J.-P. Vert (Eds.), Kernel methods in computational biology (pp. 277-298). Cambridge, MA: MIT Press.
23. Sato, A., & Yamada, K. (1996). Generalized learning vector quantization. In D. S. Touretzky, M. Mozer, & M. E. Hasselmo (Eds.), Advances in neural information processing systems, 8 (pp. 423-429). Cambridge, MA: MIT Press.
24. Seo, S., Bode, M., & Obermayer, K. (2003). Soft nearest prototype classification. IEEE Transactions on Neural Networks, 14, 390-398.
25. Seo, S., & Obermayer, K. (2003). Soft learning vector quantization. Neural Computation, 15(7), 1589-1604.
26. Shalev-Schwartz, S., Singer, Y., & Ng, A. (2004). Online and batch learning of pseudo-metrics. Proceedings of the 21st International Conference on Machine Learning (p. 94). New York: ACM.
27. Weinberger, K., Blitzer, J., & Saul, L. (2006). Distance metric learning for large margin nearest neighbor classification. In Y.Weiss, B. Schölkopf, & J. Platt (Eds.), Advances in neural information processing systems, 18 (pp. 1473-1480). Cambridge, MA: MIT Press.