Parallelism, localization and chain gradient tuning combinations for fast scalable probabilistic neural networks in data mining applications

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

Abstract

This work investigates the scalability of Probabilistic Neural Networks via parallelization and localization, and a chain gradient tuning. Since PNN model is inherently parallel three common parallel approaches are studied here, namely data parallel, neuron parallel and pipelining. Localization methods via clustering algorithms are utilized to reduce the hidden layer size of PNNs. A problem of localization may be present in the case of multi-class data. In this paper we propose two simple fast approximate solutions. The first is using sigma smoothing parameters obtained from the parallel PNN initial training directly to clustering. In this case a substantial reduction of neurons is achieved without significant loss of recognition accuracy. The second is an effort for an additional tuning. Via confidence outputs we employ a chain training approach to tune for the best possible PNN architecture. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Kokkinos, Y., & Margaritis, K. (2012). Parallelism, localization and chain gradient tuning combinations for fast scalable probabilistic neural networks in data mining applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7297 LNCS, pp. 41–48). https://doi.org/10.1007/978-3-642-30448-4_6

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