Autonomous and deterministic probabilistic neural network using global k-means

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

Abstract

We present a comparative study between Expectation-Maximization (EM) trained probabilistic neural network (PNN) with random initialization and with initialization from Global it-means. To make the results more comprehensive, the algorithm was tested on both homoscedastic and heteroscedastic PNNs. Normally, user have to define the number of clusters through trial and error method, which makes random initialization to be of stochastic nature. Global k-means was chosen as the initialization method because it can autonomously find the number of clusters using a selection criterion and can provide deterministic clustering results. The proposed algorithm was tested on benchmark datasets and real world data from the cooling water system in a power plant. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Chang, R. K. Y., Loo, C. K., & Rao, M. V. C. (2006). Autonomous and deterministic probabilistic neural network using global k-means. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 830–836). Springer Verlag. https://doi.org/10.1007/11759966_122

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