Averaging ensembles of self-organizing mixture networks for density estimation

Yin, Hujun and Allinson, Nigel (1999) Averaging ensembles of self-organizing mixture networks for density estimation. In: International Joint Conference on Neural Networks (IJCNN'99), 10-16 July 1999, Washington, DC, USA.

Full content URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?...

Full text not available from this repository.

Item Type:Conference or Workshop contribution (Paper)
Item Status:Live Archive

Abstract

The self-organizing mixture network (SOMN) is a learning algorithm for mixture densities, derived from minimizing the Kullback-Leibler information by means of stochastic approximation methods. It has been shown the SOMN converges faster than the EM-based algorithms and generalizes better as it is based on the expected likelihood rather than the sample likelihood. The derived algorithm has similar updating forms to the self-organizing map (SOM), thus reveals the mixture interpreter role of the neighbourhood function used in the SOM. When the sample set is small, overfitting problems often occur in most algorithms. Further improvement can be achieved by averaging ensembles of the SOMNs. The algorithms have been applied to both experimental data and real-world problems. The results show that smoothed mixtures with improved accuracy have been obtained. Estimation variance has been reduced.

Keywords:Approximation theory, Convergence of numerical methods, Learning algorithms, Random processes, Self-organizing map (SOM), Self-organizing mixture network (SOMN), Neural networks
Subjects:G Mathematical and Computer Sciences > G400 Computer Science
Divisions:College of Science > School of Computer Science
ID Code:8586
Deposited On:17 Apr 2013 14:49

Repository Staff Only: item control page