Abstract
Kernel Generalised Learning Vector Quantisation (KGLVQ) was proposed to extend Generalised Learning Vector Quantisation into the kernel feature space to deal with complex class boundaries and thus yield promising performance for complex classification tasks in pattern recognition. However KGLVQ does not follow the maximal margin principle which is crucial for kernel-based learning methods. In this paper we propose a maximal margin approach to Kernel Generalised Learning Vector Quantisation algorithm which inherits the merits of KGLVQ and follows the maximal margin principle to favour the generalisation capability. Experiments performed on the well-known data set III of BCI competition II show promising classification results for the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burges, C.J.C.: A Tutorial on Support Vector Machines for Pattern Recognition. Data Min. Knowl. Dis. 2, 121–167 (1998)
Cortes, C., Vapnik, V.: Support-Vector Networks. Mach. Learn., 273–297 (1995)
Crammer, K., Gilad-bachrach, R., Navot, A., Tishby, N.: Margin Analysis of the LVQ Algorithm. In: Advances in Neural Information Processing Systems 2002, pp. 462–469 (2002)
Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. J. Comput. Syst. Sci. 55, 119–139 (1997)
Hammer, B., Villmann, T.: Generalized Relevance Learning Vector Quantization. Neural Netw. 15, 1059–1068 (2002)
Kohonen, T.: Self-organization and Associative Memory, 3rd edn. Springer, Berlin (1989)
Kohonen, T.: Learning Vector Quantization. In: The Handbook of Brain Theory and Neural Networks, pp. 537–540 (1995)
Liu, C.L., Nakagawa, M.: Evaluation of Prototype Learning Algorithms for Nearest-Neighbor Classifier in Application to Handwritten Character Recognition. Pattern Recogn. 34, 601–615 (2001)
Pfurtscheller, G., Schlögl, A.: Data Set III in BCI Competition II, http://www.bbci.de/competition/ii
Qinand, A.K., Suganthan, P.N.: A Novel Kernel Prototype-Based Learning Algorithm. In: 17th International Conference on Pattern Recognition, pp. 621–624 (2004)
Sato, A.: Discriminative Dimensionality Reduction Based on Generalized LVQ. In: Dorffner, G., Bischof, H., Hornik, K. (eds.) ICANN 2001. LNCS, vol. 2130, pp. 65–72. Springer, Heidelberg (2001)
Sato, A., Yamada, K.: Generalized Learning Vector Quantization. In: Neural Information Processing Systems Conference, pp. 423–429 (1995)
Vapnik, V.: The Nature of Statistical Learning Theory. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le, T., Tran, D., Hoang, T., Sharma, D. (2012). Maximal Margin Approach to Kernel Generalised Learning Vector Quantisation for Brain-Computer Interface. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34487-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-34487-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34486-2
Online ISBN: 978-3-642-34487-9
eBook Packages: Computer ScienceComputer Science (R0)