메뉴 건너뛰기




Volumn 34, Issue 3, 2005, Pages 219-233

Improving information-theoretic competitive learning by accentuated information maximization

Author keywords

Accentuated information maximization; Competitive learning; Mutual information maximization; Rth power; Winner take all

Indexed keywords

ACCENTUATED INFORMATION MAXIMIZATION; COMPETITIVE LEARNING; MUTUAL INFORMATION MAXIMIZATION; RTH POWER; WINNER-TAKE-ALL;

EID: 27344446063     PISSN: 03081079     EISSN: 15635104     Source Type: Journal    
DOI: 10.1080/03081070500065759     Document Type: Review
Times cited : (19)

References (28)
  • 1
    • 0025225150 scopus 로고
    • Competitive learning algorithms for vector quantization
    • S.C. Ahalt, A.K. Krishnamurthy, P. Chen and D.E. Melton, "Competitive learning algorithms for vector quantization", Neural Netw., 3, 1990, pp. 277-290.
    • (1990) Neural Netw. , vol.3 , pp. 277-290
    • Ahalt, S.C.1    Krishnamurthy, A.K.2    Chen, P.3    Melton, D.E.4
  • 2
    • 0000302918 scopus 로고
    • Toward a theory of early visual processing
    • J.J. Atick and A.N. Redlich, "Toward a theory of early visual processing", Neural Comput., 2, 1990, pp. 308-320.
    • (1990) Neural Comput. , vol.2 , pp. 308-320
    • Atick, J.J.1    Redlich, A.N.2
  • 3
    • 0001471775 scopus 로고
    • Unsupervised learning
    • H.B. Barlow, "Unsupervised learning", Neural Comput., 1, 1989, pp. 295-311.
    • (1989) Neural Comput. , vol.1 , pp. 295-311
    • Barlow, H.B.1
  • 5
    • 0002469309 scopus 로고    scopus 로고
    • Mutual information maximization: Models of cortical self-organization
    • S. Becker, "Mutual information maximization: Models of cortical self-organization", Netw. Comput. Neural Syst., 7, 1996, pp. 7-31.
    • (1996) Netw. Comput. Neural Syst. , vol.7 , pp. 7-31
    • Becker, S.1
  • 6
    • 0000840323 scopus 로고
    • Learning mixture models of spatial coherence
    • S. Becker and G.E. Hinton, "Learning mixture models of spatial coherence", Neural Comput., 5, 1993, pp. 267-277.
    • (1993) Neural Comput. , vol.5 , pp. 267-277
    • Becker, S.1    Hinton, G.E.2
  • 7
    • 0002515823 scopus 로고
    • Unsupervised mutual information criterion for elimination of overtraining in supervised multiplayer networks
    • G. Deco, W. Finnof and H.G. Zimmermann, "Unsupervised mutual information criterion for elimination of overtraining in supervised multiplayer networks", Neural Comput., 7, 1995, pp. 86-107.
    • (1995) Neural Comput. , vol.7 , pp. 86-107
    • Deco, G.1    Finnof, W.2    Zimmermann, H.G.3
  • 9
    • 0016758101 scopus 로고
    • Cognitron: A self-organizing multi-layered neural network
    • K. Fukushima, "Cognitron: A self-organizing multi-layered neural network", Biol. Cybern., 20, 1975, pp. 121-136.
    • (1975) Biol. Cybern. , vol.20 , pp. 121-136
    • Fukushima, K.1
  • 11
    • 5244352553 scopus 로고
    • Competitive learning: From interactive activation to adaptive resonance
    • S. Grossberg, "Competitive learning: From interactive activation to adaptive resonance", Cogn. Sci., 11, 1987, pp. 23-63.
    • (1987) Cogn. Sci. , vol.11 , pp. 23-63
    • Grossberg, S.1
  • 12
    • 0005671334 scopus 로고    scopus 로고
    • The formation of topographic maps that maximize the average mutual information of the output responses to noiseless input signals
    • M.M.V. Hulle, "The formation of topographic maps that maximize the average mutual information of the output responses to noiseless input signals", Neural Comput., 9(3), 1997, pp. 595-606.
    • (1997) Neural Comput. , vol.9 , Issue.3 , pp. 595-606
    • Hulle, M.M.V.1
  • 13
    • 0037612920 scopus 로고    scopus 로고
    • Minimizing α-information for generalization and interpretation
    • R. Kamimura, "Minimizing α-information for generalization and interpretation", Algorithmica, 22, 1998, pp. 173-197.
    • (1998) Algorithmica , vol.22 , pp. 173-197
    • Kamimura, R.1
  • 14
    • 0842343631 scopus 로고    scopus 로고
    • Information-theoretic competitive learning with inverse euclidean distance
    • To appear
    • R. Kamimura, "Information-theoretic competitive learning with inverse euclidean distance", Neural Process. Lett., 2003a (To appear).
    • (2003) Neural Process. Lett.
    • Kamimura, R.1
  • 15
    • 0141689654 scopus 로고    scopus 로고
    • Progressive feature extraction by greedy network-growing algorithm
    • R. Kamimura, "Progressive feature extraction by greedy network-growing algorithm", Complex Syst., 14(2), pp. 127-153, 2003b.
    • (2003) Complex Syst. , vol.14 , Issue.2 , pp. 127-153
    • Kamimura, R.1
  • 16
    • 0000167218 scopus 로고
    • Hidden information maximization for feature detection and rule discovery
    • R. Kamimura and S. Nakanishi, "Hidden information maximization for feature detection and rule discovery", Network, 6, 1995a, pp. 577-622.
    • (1995) Network , vol.6 , pp. 577-622
    • Kamimura, R.1    Nakanishi, S.2
  • 17
    • 0029254124 scopus 로고
    • Improving generalization performance by information minimization
    • R. Kamimura and S. Nakanishi, "Improving generalization performance by information minimization", IEICE Trans. Inf. Syst., E78-D(2), 1995b, pp. 163-173.
    • (1995) IEICE Trans. Inf. Syst. , vol.E78-D , Issue.2 , pp. 163-173
    • Kamimura, R.1    Nakanishi, S.2
  • 18
    • 0012588765 scopus 로고    scopus 로고
    • Information theoretic competitive learning and linguistic rule acquistion
    • R. Kamimura, T. Kamimura and T.R. Shultz, "Information theoretic competitive learning and linguistic rule acquistion", Trans. Jpn. Soc. Artif. Intell., 16(2), 2001a, pp. 287-298.
    • (2001) Trans. Jpn. Soc. Artif. Intell. , vol.16 , Issue.2 , pp. 287-298
    • Kamimura, R.1    Kamimura, T.2    Shultz, T.R.3
  • 19
    • 0035528493 scopus 로고    scopus 로고
    • Flexible feature discovery and structural information
    • R. Kamimura, T. Kamimura and O. Uchida, "Flexible feature discovery and structural information", Connect. Sci., 13(4), 2001b, pp. 323-347.
    • (2001) Connect. Sci. , vol.13 , Issue.4 , pp. 323-347
    • Kamimura, R.1    Kamimura, T.2    Uchida, O.3
  • 20
    • 0036626892 scopus 로고    scopus 로고
    • Greedy information acquisition algorithm: A new information theoretic approach to dynamic information acquisition in neural networks
    • R. Kamimura, T. Kamimura and H. Takeuchi, "Greedy information acquisition algorithm: A new information theoretic approach to dynamic information acquisition in neural networks", Connect. Sci., 14(2), 2002, pp. 137-162.
    • (2002) Connect. Sci. , vol.14 , Issue.2 , pp. 137-162
    • Kamimura, R.1    Kamimura, T.2    Takeuchi, H.3
  • 21
    • 0023981750 scopus 로고
    • Self-organization in a perceptual network
    • R. Linsker, "Self-organization in a perceptual network", Computer, 21, 1988, pp. 105-117.
    • (1988) Computer , vol.21 , pp. 105-117
    • Linsker, R.1
  • 22
    • 0000353243 scopus 로고
    • How to generate ordered maps by maximizing the mutual information between input and output
    • R. Linsker, "How to generate ordered maps by maximizing the mutual information between input and output", Neural Comput., 1, 1989, pp. 402-411.
    • (1989) Neural Comput. , vol.1 , pp. 402-411
    • Linsker, R.1
  • 23
    • 0001525549 scopus 로고
    • Local synaptic rules suffice to maximize mutual information in a linear network
    • R. Linsker, "Local synaptic rules suffice to maximize mutual information in a linear network", Neural Comput., 4, 1992, pp. 691-702.
    • (1992) Neural Comput. , vol.4 , pp. 691-702
    • Linsker, R.1
  • 24
    • 0003161471 scopus 로고    scopus 로고
    • Properties of the generalized lotto-type competitive learning
    • CA, San Mateo: Morgan Kaufmann Publishers
    • A. Luk and S. Lien, "Properties of the generalized lotto-type competitive learning", Proceedings of International conference on neural information processing, CA, San Mateo: Morgan Kaufmann Publishers, 2000, pp. 1180-1185.
    • (2000) Proceedings of International Conference on Neural Information Processing , pp. 1180-1185
    • Luk, A.1    Lien, S.2
  • 25
    • 0027266879 scopus 로고
    • Constraints on plasticity in a connectionist model of the English past tense
    • V.A. Marchman, "Constraints on plasticity in a connectionist model of the English past tense", J. Cogn. Neurosci., 5(2), 1993, pp. 215-234.
    • (1993) J. Cogn. Neurosci. , vol.5 , Issue.2 , pp. 215-234
    • Marchman, V.A.1
  • 26
    • 0000213389 scopus 로고
    • On learning the past tenses of English verbs
    • D.E. Rumelhart, G.E. Hinton and R.J. Williams, Eds., Cambrige: MIT Press
    • D.E. Rumelhart and J.L. McClelland, "On learning the past tenses of English verbs", in Parallel Distributed Processing, D.E. Rumelhart, G.E. Hinton and R.J. Williams, Eds., Cambrige: MIT Press, 1986, Vol. 2, pp. 216-271.
    • (1986) Parallel Distributed Processing , vol.2 , pp. 216-271
    • Rumelhart, D.E.1    McClelland, J.L.2
  • 27
    • 0001608026 scopus 로고
    • Feature discovery by competitive learning
    • D.E. Rumelhart, G.E. Hinton and R.N. Williams, Eds., Cambridge: MIT Press
    • D.E. Rumelhart and D. Zipser, "Feature discovery by competitive learning", in Parallel Distributed Processing, D.E. Rumelhart, G.E. Hinton and R.N. Williams, Eds., Cambridge: MIT Press, 1986, Vol. 1, pp. 151-193.
    • (1986) Parallel Distributed Processing , vol.1 , pp. 151-193
    • Rumelhart, D.E.1    Zipser, D.2
  • 28
    • 0027629412 scopus 로고
    • Rival penalized competitive learning for clustering analysis, RBF net, and curve detection
    • L. Xu, "Rival penalized competitive learning for clustering analysis, RBF net, and curve detection", IEEE Trans. Neural Netw., 4(4), 1993, pp. 636-649.
    • (1993) IEEE Trans. Neural Netw. , vol.4 , Issue.4 , pp. 636-649
    • Xu, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.