Greedy network-growing algorithm with Minkowski distances

References

• Ahalt , S.C. , Krishnamurthy , A.K. , Chen , P. and Melton , D.E. 1990 . Competitive learning algorithms for vector quantization . Neural Networks , 3 : 277 – 290 .
   Web of Science ®Google Scholar
• Atick , J.J. and Redlich , A.N. 1990 . Toward a theory of early visual processing . Neural Computation , 2 : 308 – 320 .
   Web of Science ®Google Scholar
• Becker , S. and Hinton , G.E. 1993 . Learning mixture models of spatial coherence . Neural Computation , 5 : 267 – 277 .
   Web of Science ®Google Scholar
• Brooks , D.R. and Wiley , E.O. 1986 . Evolution as Entropy , Chicago : The University of Chicago Press .
   Google Scholar
• DeSieno , D. 1988 . “ Adding a conscience to competitive learning ” . In Proceedings of IEEE International Conference on Neural Networks , 117 – 124 . San Diego : IEEE .
   Google Scholar
• Deco , G. , Finnof , W. and Zimmermann , H.G. 1995 . Unsupervised mutual information criterion for elimination of overtraining in supervised multiplayer Networks . Neural Computation , 7 : 86 – 107 .
   Web of Science ®Google Scholar
• Dopazo , J. and Carazo , J.M. 1997 . Phylogenetic reconstruction using a growing neural network that adopts the tyopology of a phylogenetic tree . Journal of Molecular Evolution , 44 : 226 – 233 .
   PubMedGoogle Scholar
• Fahlman , S.E. and Lebiere , C. 1990 . “ The cascade-correlation learning architecture ” . In Advances in Neural Information Processing , Vol. 2 , 524 – 532 . San Mateo, CA : Morgan Kaufmann Publishers .
   Google Scholar
• Fritzke , B. 1991 . “ Unsupervised clustering with growing cell structures ” . In Proceedings of IEEE International Joint Conference on Neural Networks 531 – 536 . IEEE and INNS, IEEE
   Google Scholar
• Fritzke , B. 1994 . Growing cell structures—a self-organizing network for unsupervised and supervised learning . Neural Networks , 7 ( 9 ) : 1441 – 1460 .
   Web of Science ®Google Scholar
• Fritzke , B. 1996 . “ Unsupervised ontogenetic networks ” . In Handbook of Neural Computation , Edited by: Fiesler , E. and Beale , R. New York, NY : Institute of Physics Publishing and Oxford University Press .
   Google Scholar
• Gatlin , L.L. 1972 . Information Theory and Living Systems , New York, NY : Columbia University Press .
   Google Scholar
• Grossberg , S. 1987 . Competitive learning: from interactive activation to adaptive resonance . Cognitive Science , 11 : 23 – 63 .
   Web of Science ®Google Scholar
• Herrero , J. , Valencia , A. and Dopazo , J. 2001 . A hierarchical unsupervised growing neural network for clustering gene expression patterns . Bioinformatics , 17 ( 2 ) : 126 – 136 .
   PubMed Web of Science ®Google Scholar
• Kamimura , R. , Kamimura , T. and Takeuchi , H. 2002 . Greedy information acquisition algorithm: a new information theoretic approach to dynamic information acquisition in neural networks . Connection Science , 13 ( 4 ) : 323 – 347 .
   Google Scholar
• Kamimura , R. 2003 . Progressive feature extraction by greedy network-growing algorithm . To appear in Complex Systems
   Google Scholar
• Kamimura , R. and Nakanishi , S. 1995a . Improving generalization performance by information minimization . IEICE Transactions on Information Systems , E78-D ( 2 ) : 163 – 173 .
   Google Scholar
• Kamimura , R. and Nakanishi , S. 1995b . Hidden information maximization for feature detection and rule discovery . Network , 6 : 577 – 622 .
   Web of Science ®Google Scholar
• Kamimura , R. , Kamimura , T. and Shultz , T.R. 2001 . Information theoretic competitive learning and linguistic rule acquistion . Transaction of the Japanese Society Artificial Intelligence , 16 ( 2 ) : 287 – 298 .
   Google Scholar
• Kamimura, R., 2003, Competitive learning by information maximization: eliminating dead neurons in competitive learning. To appear in proceedings of icann/iconip
   Google Scholar
• Lehtokangas , M. 1999 . Modelling with constructive back propagation architecture . Neural Networks , 12 : 707 – 716 .
   PubMedGoogle Scholar
• Linsker , R. 1988 . Self-organization in a perceptual network . Computer , 21 : 105 – 117 .
   Web of Science ®Google Scholar
• Linsker , R. 1989 . How to generate ordered maps by maximizing the mutual information between input and output . Neural Computation , 1 : 402 – 411 .
   Web of Science ®Google Scholar
• Linsker , R. 1992 . Local synaptic rules suffice to maximize mutual information in a linear network . Neural Computation , 4 : 691 – 702 .
   Web of Science ®Google Scholar
• Luk , A. and Lien , S. 2000 . “ Properties of the generalized lotto-type competitive learning ” . In Proceedings of International Conference on Neural Information Processing , 1180 – 1185 . San Mateo, CA : Morgan Kaufmann Publishers .
   Google Scholar
• Rumelhart , D.E. and McClelland , J.L. 1986 . “ On learning the past tenses of english verbs ” . In Parallel Distributed Processing , Edited by: Rumelhart , D.E. , Hinton , G.E. and Williams , R.J. Vol. 2 , 216 – 271 . Cambridge : MIT Press .
   Google Scholar
• Shultz , T.A. and Rivest , F. 2001 . Knowledge-based cascade-correlation: using knowledge to speed learning . Connection Science , 13 : 43 – 72 .
   Web of Science ®Google Scholar
• Xu , L. 1993 . Rival penalized competitive learning for clustering analysis, RBF net, and curve detection . IEEE Transaction on Neural Networks , 4 ( 4 ) : 636 – 649 .
   PubMed Web of Science ®Google Scholar