A Parallel and Hierarchical Markovian RBF Neural Network: Preliminary Performance Evaluation

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

Abstract

This paper presents a hierarchical Markovian Radial Basis Function (RBF) Neural Network, having embedded nature with many levels. The hidden RBF neurons in all the tree nodes of the hierarchy are composed of fully functional RBF Neural Networks that have the classical two synaptic link sets, one for the RBF centers and the other for the linear output weights. The Markov chain rule is specifically used in the RBF summations and permits this hierarchical functionality in a fractal-like fashion which supports a clear recursion. Thus the Neural Network operation is exactly the same at all levels. We further analyze the general framework where classical RBF Neural Network training algorithms can be applied, specifically for finding the centers and calculating the linear output weights. This framework is fast, simple and facilitates easy parallel implementations which are the main targets of this study. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Kokkinos, Y., & Margaritis, K. (2013). A Parallel and Hierarchical Markovian RBF Neural Network: Preliminary Performance Evaluation. In Communications in Computer and Information Science (Vol. 383 CCIS, pp. 340–349). Springer Verlag. https://doi.org/10.1007/978-3-642-41013-0_35

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