Relational Extensions of Learning Vector Quantization

Prototype-based models offer an intuitive interface to given data sets by means of an inspection of the model prototypes. Supervised classification can be achieved by popular techniques such as learning vector quantization (LVQ) and extensions derived from cost functions such as generalized LVQ (GLVQ) and robust soft LVQ (RSLVQ). These methods, however, are restricted to Euclidean vectors and they cannot be used if data are characterized by a general dissimilarity matrix. In this approach, we propose relational extensions of GLVQ and RSLVQ which can directly be applied to general possibly non-Euclidean data sets characterized by a symmetric dissimilarity matrix.

[1]  Trinad Chakraborty,et al.  Rapid Identification and Typing of Listeria Species by Matrix-Assisted Laser Desorption Ionization-Time of Flight Mass Spectrometry , 2008, Applied and Environmental Microbiology.

[2]  Frank-Michael Schleif,et al.  Accelerating dissimilarity clustering for biomedical data analysis , 2011, IEEE CIBCB 2011.

[3]  Klaus Obermayer,et al.  Dynamic Hyperparameter Scaling Method for LVQ Algorithms , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

[4]  Atsushi Sato,et al.  Generalized Learning Vector Quantization , 1995, NIPS.

[5]  A. Kai Qin,et al.  A novel kernel prototype-based learning algorithm , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[6]  R. Duin,et al.  The dissimilarity representation for pattern recognition , a tutorial , 2009 .

[7]  Thomas Martinetz,et al.  'Neural-gas' network for vector quantization and its application to time-series prediction , 1993, IEEE Trans. Neural Networks.

[8]  Martin A. Riedmiller,et al.  Incremental GRLVQ: Learning relevant features for 3D object recognition , 2008, Neurocomputing.

[9]  E. Granum,et al.  Quantitative analysis of 6985 digitized trypsin G ‐banded human metaphase chromosomes , 1980, Clinical genetics.

[10]  Barbara Hammer,et al.  Topographic Mapping of Large Dissimilarity Data Sets , 2010, Neural Computation.

[11]  Michael Biehl,et al.  Adaptive Relevance Matrices in Learning Vector Quantization , 2009, Neural Computation.

[12]  Claus Bahlmann,et al.  Learning with Distance Substitution Kernels , 2004, DAGM-Symposium.

[13]  Heiko Wersing,et al.  Online figure-ground segmentation with adaptive metrics in generalized LVQ , 2009, Neurocomputing.

[14]  Michael Biehl,et al.  Hyperparameter learning in probabilistic prototype-based models , 2010, Neurocomputing.

[15]  T. Maier,et al.  Fast and reliable MALDI-TOF MS–based microorganism identification , 2006 .

[16]  Horst Bunke,et al.  Edit distance-based kernel functions for structural pattern classification , 2006, Pattern Recognit..

[17]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[18]  Robert P. W. Duin,et al.  The Dissimilarity Representation for Pattern Recognition - Foundations and Applications , 2005, Series in Machine Perception and Artificial Intelligence.

[19]  Frank-Michael Schleif,et al.  Accelerating kernel clustering for biomedical data analysis , 2011, 2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB).

[20]  Thomas Villmann,et al.  Generalized relevance learning vector quantization , 2002, Neural Networks.

[21]  Klaus Obermayer,et al.  Soft Learning Vector Quantization , 2003, Neural Computation.

[22]  Maya R. Gupta,et al.  Similarity-based Classification: Concepts and Algorithms , 2009, J. Mach. Learn. Res..

[23]  Christopher M. Bishop,et al.  GTM: The Generative Topographic Mapping , 1998, Neural Computation.

[24]  Barbara Hammer,et al.  Patch clustering for massive data sets , 2009, Neurocomputing.