Kernel-Kohonen networks.
We investigate the combination of the Kohonen networks with the kernel methods in the context of classification. We use the idea of kernel functions to handle products of vectors of arbitrary dimension. We indicate how to build Kohonen networks with robust classification performance by transformation of the original data vectors into a possibly infinite dimensional space. The resulting Kohonen networks preserve a non-Euclidean neighborhood structure of the input space that fits the properties of the data. We show how to optimize the transformation of the data vectors in order to obtain higher classification performance. We compare the kernel-Kohonen networks with the regular Kohonen networks in the context of a classification task.
András
Péter
P
Department of Psychology, University of Newcastle upon Tyne, Newcastle upon Tyne, NE1 7RU, UK. peter.andras@ncl.ac.uk
D000465:Algorithms; D001185:Artificial Intelligence; D002965:Classification; D003627:Data Interpretation, Statistical; D004467:Economics; D016571:Neural Networks, Computer; D016011:Normal Distribution