Growing Neural Gas approach for obtaining homogeneous maps by restricting the insertion of new nodes

The Growing Neural Gas model is used widely in artificial neural networks. However, its application is limited in some contexts by the proliferation of nodes in dense areas of the input space. In this study, we introduce some modifications to address this problem by imposing three restrictions on the insertion of new nodes. Each restriction aims to maintain the homogeneous values of selected criteria. One criterion is related to the square error of classification and an alternative approach is proposed for avoiding additional computational costs. Three parameters are added that allow the regulation of the restriction criteria. The resulting algorithm allows models to be obtained that suit specific needs by specifying meaningful parameters.

[1]  Thouraya Ayadi,et al.  2IBGSOM: interior and irregular boundaries growing self-organizing maps , 2007, Sixth International Conference on Machine Learning and Applications (ICMLA 2007).

[2]  Bernd Fritzke,et al.  Growing cell structures--A self-organizing network for unsupervised and supervised learning , 1994, Neural Networks.

[3]  T. Martínez,et al.  Competitive Hebbian Learning Rule Forms Perfectly Topology Preserving Maps , 1993 .

[4]  David G. Stork,et al.  Pattern Classification , 1973 .

[5]  Shen Furao,et al.  An enhanced self-organizing incremental neural network for online unsupervised learning , 2007, Neural Networks.

[6]  Bala Srinivasan,et al.  Dynamic self-organizing maps with controlled growth for knowledge discovery , 2000, IEEE Trans. Neural Networks Learn. Syst..

[7]  Thomas Villmann,et al.  Growing a hypercubical output space in a self-organizing feature map , 1997, IEEE Trans. Neural Networks.

[8]  Stanley Chan,et al.  Sparse Representation , 2014, Computer Vision, A Reference Guide.

[9]  Robert Tibshirani,et al.  A Framework for Feature Selection in Clustering , 2010, Journal of the American Statistical Association.

[10]  David G. Stork,et al.  Pattern classification, 2nd Edition , 2000 .

[11]  P. N. Suganthan,et al.  Robust growing neural gas algorithm with application in cluster analysis , 2004, Neural Networks.

[12]  Aluizio F. R. Araújo,et al.  Growing Self-Reconstruction Maps , 2010, IEEE Transactions on Neural Networks.

[13]  Marco Tomassini,et al.  Prototype Proliferation in the Growing Neural Gas Algorithm , 2008, ICANN.

[14]  Glenn Fung,et al.  Reducing a Biomarkers List via Mathematical Programming: Application to Gene Signatures to Detect Time-Dependent Hypoxia in Cancer , 2007, ICMLA 2007.

[15]  Thomas Villmann,et al.  Magnification Control in Self-Organizing Maps and Neural Gas , 2006, Neural Computation.

[16]  Thomas Villmann,et al.  Margin based Active Learning for LVQ Networks , 2007, ESANN.

[17]  Shigeo Abe DrEng Pattern Classification , 2001, Springer London.

[18]  Amel Hebboul,et al.  An incremental parallel neural network for unsupervised classification , 2011, International Workshop on Systems, Signal Processing and their Applications, WOSSPA.

[19]  Risto Miikkulainen,et al.  Incremental grid growing: encoding high-dimensional structure into a two-dimensional feature map , 1993, IEEE International Conference on Neural Networks.

[20]  Thomas Martinetz,et al.  'Neural-gas' network for vector quantization and its application to time-series prediction , 1993, IEEE Trans. Neural Networks.

[21]  Thomas Villmann,et al.  Sparse representation of data , 2010, ESANN.

[22]  Bernd Fritzke,et al.  A Growing Neural Gas Network Learns Topologies , 1994, NIPS.

[23]  Andreas Rauber,et al.  The growing hierarchical self-organizing map: exploratory analysis of high-dimensional data , 2002, IEEE Trans. Neural Networks.

[24]  Stephen R. Marsland,et al.  A self-organising network that grows when required , 2002, Neural Networks.

[25]  José García Rodríguez,et al.  Autonomous Growing Neural Gas for applications with time constraint: Optimal parameter estimation , 2012, Neural Networks.

[26]  M. V. Velzen,et al.  Self-organizing maps , 2007 .