References
References
- Ahalt , SC , Krishnamurthy , AK , Chen , P and Melton , DE . 1990 . Competitive learning algorithms for vector quantization . Neural Netw. , 3 : 277 – 290 .
- Atick , JJ and Redlich , AN . 1990 . Toward a theory of early visual processing . Neural Comput. , 2 : 308 – 320 .
- Barlow , HB . 1989 . Unsupervised learning . Neural Comput. , 1 : 295 – 311 .
- Barlow , HB , Kaushal , TP and Mitchison , GJ . 1989 . Finding minimum entropy code . Neural Comput. , 1 : 412 – 423 .
- Becker , S . 1996 . Mutual information maximization: Models of cortical self-organization . Netw. Comput. Neural Syst. , 7 : 7 – 31 .
- Becker , S and Hinton , GE . 1993 . Learning mixture models of spatial coherence . Neural Comput. , 5 : 267 – 277 .
- Deco , G , Finnof , W and Zimmermann , HG . 1995 . Unsupervised mutual information criterion for elimination of overtraining in supervised multiplayer networks . Neural Comput. , 7 : 86 – 107 .
- DeSieno D Adding a conscience to competitive learning Proceedings of IEEE International Conference on Neural Networks San Diego IEEE 1988 117 124
- Fukushima , K . 1975 . Cognitron: A self-organizing multi-layered neural network . Biol. Cybern. , 20 : 121 – 136 .
- Gatlin LL Information Theory and Living Systems, Columbia University Press 1972
- Grossberg , S . 1987 . Competitive learning: From interactive activation to adaptive resonance . Cogn. Sci. , 11 : 23 – 63 .
- Hulle , MMV . 1997 . The formation of topographic maps that maximize the average mutual information of the output responses to noiseless input signals . Neural Comput. , 9 ( 3 ) : 595 – 606 .
- Kamimura , R . 1998 . Minimizing α-information for generalization and interpretation . Algorithmica , 22 : 173 – 197 .
- Kamimura R Information-theoretic competitive learning with inverse euclidean distance Neural Process. Lett. 2003a (To appear)
- Kamimura , R . 2003b . Progressive feature extraction by greedy network-growing algorithm . Complex Syst. , 14 ( 2 ) : 127 – 153 .
- Kamimura , R and Nakanishi , S . 1995a . Hidden information maximization for feature detection and rule discovery . Network , 6 : 577 – 622 .
- Kamimura , R and Nakanishi , S . 1995b . Improving generalization performance by information minimization . IEICE Trans. Inf. Syst. , E78-D ( 2 ) : 163 – 173 .
- Kamimura , R , Kamimura , T and Shultz , TR . 2001a . Information theoretic competitive learning and linguistic rule acquistion . Trans. Jpn. Soc. Artif. Intell. , 16 ( 2 ) : 287 – 298 .
- Kamimura , R , Kamimura , T and Uchida , O . 2001b . Flexible feature discovery and structural information . Connect. Sci. , 13 ( 4 ) : 323 – 347 .
- Kamimura , R , Kamimura , T and Takeuchi , H . 2002 . Greedy information acquisition algorithm: A new information theoretic approach to dynamic information acquisition in neural networks . Connect. Sci. , 14 ( 2 ) : 137 – 162 .
- Linsker , R . 1988 . Self-organization in a perceptual network . Computer , 21 : 105 – 117 .
- Linsker , R . 1989 . How to generate ordered maps by maximizing the mutual information between input and output . Neural Comput. , 1 : 402 – 411 .
- Linsker , R . 1992 . Local synaptic rules suffice to maximize mutual information in a linear network . Neural Comput. , 4 : 691 – 702 .
- Luk A Lien S Properties of the generalized lotto-type competitive learning Proceedings of International conference on neural information processing CA, San Mateo Morgan Kaufmann Publishers 2000 1180 1185
- Marchman , VA . 1993 . Constraints on plasticity in a connectionist model of the English past tense . J. Cogn. Neurosci. , 5 ( 2 ) : 215 – 234 .
- Rumelhart DE McClelland JL On learning the past tenses of English verbs Parallel Distributed Processing Rumelhart DE Hinton GE Williams RJ Cambrige MIT Press 1986 Vol. 2 216 271
- Rumelhart DE Zipser D Feature discovery by competitive learning Parallel Distributed Processing Rumelhart DE Hinton GE Williams RN Cambridge MIT Press 1986 Vol. 1 151 193
- Xu , L . 1993 . Rival penalized competitive learning for clustering analysis, RBF net, and curve detection . IEEE Trans. Neural Netw. , 4 ( 4 ) : 636 – 649 .