메뉴 건너뛰기




Volumn 5326 LNCS, Issue , 2008, Pages 148-155

Feature discovery by enhancement and relaxation of competitive units

Author keywords

[No Author keywords available]

Indexed keywords

SELF ORGANIZING MAPS;

EID: 58049083902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88906-9_19     Document Type: Conference Paper
Times cited : (12)

References (13)
  • 2
    • 14844296969 scopus 로고    scopus 로고
    • Vector-quantization using information theoretic concepts
    • Lehn-Schioler, D.E.T., Hegde, A., Principe, J.C.: Vector-quantization using information theoretic concepts. Natural Computation 4(1), 39-51 (2004)
    • (2004) Natural Computation , vol.4 , Issue.1 , pp. 39-51
    • Lehn-Schioler, D.E.T.1    Hegde, A.2    Principe, J.C.3
  • 3
    • 1942450610 scopus 로고    scopus 로고
    • Feature extraction by non-parametric mutual information maximization
    • Torkkola, K.: Feature extraction by non-parametric mutual information maximization. Journal of Machine Learning Research 3, 1415-1438 (2003)
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 1415-1438
    • Torkkola, K.1
  • 4
    • 0023981750 scopus 로고
    • Self-organization in a perceptual network
    • Linsker, R.: Self-organization in a perceptual network. Computer 21, 105-117 (1988)
    • (1988) Computer , vol.21 , pp. 105-117
    • Linsker, R.1
  • 5
    • 0000353243 scopus 로고
    • How to generate ordered maps by maximizing the mutual information between input and output
    • Linsker, R.: How to generate ordered maps by maximizing the mutual information between input and output. Neural Computation 1, 402-411 (1989)
    • (1989) Neural Computation , vol.1 , pp. 402-411
    • Linsker, R.1
  • 6
    • 0029411030 scopus 로고
    • An information-maximization approach to blind separation and blind deconvolution
    • Bell, A.J., Sejnowski, T.J.: An information-maximization approach to blind separation and blind deconvolution. Neural Computation 7(6), 1129-1159 (1995)
    • (1995) Neural Computation , vol.7 , Issue.6 , pp. 1129-1159
    • Bell, A.J.1    Sejnowski, T.J.2
  • 7
    • 0842343631 scopus 로고    scopus 로고
    • Information-theoretic competitive learning with inverse euclidean distance
    • Kamimura, R.: Information-theoretic competitive learning with inverse euclidean distance. Neural Processing Letters 18, 163-184 (2003)
    • (2003) Neural Processing Letters , vol.18 , pp. 163-184
    • Kamimura, R.1
  • 8
    • 27744599915 scopus 로고    scopus 로고
    • Unifying cost and information in information-theoretic competitive learning
    • Kamimura, R.: Unifying cost and information in information-theoretic competitive learning. Neural Networks 18, 711-718 (2006)
    • (2006) Neural Networks , vol.18 , pp. 711-718
    • Kamimura, R.1
  • 9
    • 84892167083 scopus 로고
    • Using relevance to reduce network size automatically
    • Mozer, M.C., Smolensky, P.: Using relevance to reduce network size automatically. Connection Science 1(1), 3-16 (1989)
    • (1989) Connection Science , vol.1 , Issue.1 , pp. 3-16
    • Mozer, M.C.1    Smolensky, P.2
  • 10
    • 0025447562 scopus 로고
    • A simple procedure for pruning back-propagation trained neural networks
    • Karnin, E.D.: A simple procedure for pruning back-propagation trained neural networks. IEEE Transactions on Neural Networks 1(2) (1990)
    • (1990) IEEE Transactions on Neural Networks , vol.1 , Issue.2
    • Karnin, E.D.1
  • 13
    • 0002656190 scopus 로고    scopus 로고
    • Feature discover}' by competitive learning
    • Rumelhart, D.E., Zipser, D.: Feature discover}' by competitive learning. Cognitive Science 9, 75-112
    • Cognitive Science , vol.9 , pp. 75-112
    • Rumelhart, D.E.1    Zipser, D.2


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