TY - GEN
T1 - A dynamic growing neural network for supervised or unsupervised learning
AU - Tian, Daxin
AU - Liu, Yanheng
AU - Wei, Da
PY - 2006
Y1 - 2006
N2 - A Dynamic Growing Neural Network (DGNN) for supervised learning of pattern recognition or unsupervised learning of clustering is presented. The main ideas included in DGNN are Growing, Resonance, and Post-prune. DGNN is called Dynamic Growing because it is based on the Hebbian learning rule and adds new neurons under certain conditions. When DGNN performs supervised learning, resonance will happen if the winner can't match the training example; this rule combines the ART/ ARTMAP neural network and WTA learning rule. When DGNN performs unsupervised learning, post-prune is carried out to prevent over fitting the training data just like decision tree learning. DGNN's prune rule is based on the distance threshold. DGNN has some advantages: learning not only is stable because it grows under certain conditions; but also it is faster than back-propagation rules and favorable learned predictive accuracy in small, noisy, online or offline data sets. Three classes of simulations are performed on the primary benchmarks: Circle-in-the-Square and Two-spirals-apart benchmarks are used to check DGNN's supervised learning and compare it with ARTMAP and BP neural networks; DGNN's unsupervised learning ability is checked on UCI Machine Learning Archive's Synthetic Control Chart Time Series data set.
AB - A Dynamic Growing Neural Network (DGNN) for supervised learning of pattern recognition or unsupervised learning of clustering is presented. The main ideas included in DGNN are Growing, Resonance, and Post-prune. DGNN is called Dynamic Growing because it is based on the Hebbian learning rule and adds new neurons under certain conditions. When DGNN performs supervised learning, resonance will happen if the winner can't match the training example; this rule combines the ART/ ARTMAP neural network and WTA learning rule. When DGNN performs unsupervised learning, post-prune is carried out to prevent over fitting the training data just like decision tree learning. DGNN's prune rule is based on the distance threshold. DGNN has some advantages: learning not only is stable because it grows under certain conditions; but also it is faster than back-propagation rules and favorable learned predictive accuracy in small, noisy, online or offline data sets. Three classes of simulations are performed on the primary benchmarks: Circle-in-the-Square and Two-spirals-apart benchmarks are used to check DGNN's supervised learning and compare it with ARTMAP and BP neural networks; DGNN's unsupervised learning ability is checked on UCI Machine Learning Archive's Synthetic Control Chart Time Series data set.
KW - Neural network
KW - Supervised learning
KW - Unsupervised learning
UR - https://www.scopus.com/pages/publications/34047195374
U2 - 10.1109/WCICA.2006.1712893
DO - 10.1109/WCICA.2006.1712893
M3 - 会议稿件
AN - SCOPUS:34047195374
SN - 1424403324
SN - 9781424403325
T3 - Proceedings of the World Congress on Intelligent Control and Automation (WCICA)
SP - 2886
EP - 2890
BT - Proceedings of the World Congress on Intelligent Control and Automation (WCICA)
T2 - 6th World Congress on Intelligent Control and Automation, WCICA 2006
Y2 - 21 June 2006 through 23 June 2006
ER -