Relevance and kernel self-organising maps

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We review the recently proposed method of Kernel Self-organising maps (KSOM) which has been shown to exhibit very fast convergence. We show that this is due to an interaction between the fact that we are working in an overcomplete basis and the fact that we are using a mixture of one-shot and incremental learning. We then review Relevance Vector Machines which is a supervised training method related to Support Vector Machines and apply it to creating the Relevance Self-Organising Map, RSOM. We show results on artificial data and on the iris data set. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Corchado, E., & Fyfe, C. (2003). Relevance and kernel self-organising maps. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2714, 280–287. https://doi.org/10.1007/3-540-44989-2_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free