메뉴 건너뛰기




Volumn , Issue , 2007, Pages 25-30

Model collisions in the dissimilarity SOM

(1)  Rossi, Fabrice a  

a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND APPROACHES; DISSIMILARITY DATUM; MODEL REPRESENTATION;

EID: 67650335397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (12)
  • 4
    • 33746866554 scopus 로고    scopus 로고
    • A self organizing map for dissimilarity data
    • In D. Banks, L. House, F. R. McMorris, P. Arabie, and W. Gaul, editors, Chicago, Illinois (USA), July, IFCS, Springer
    • A. El Golli, B. Conan-Guez, and F. Rossi. A self organizing map for dissimilarity data. In D. Banks, L. House, F. R. McMorris, P. Arabie, and W. Gaul, editors, Classification, Clustering, and Data Mining Applications (Proceedings of IFCS 2004), pages 61-68, Chicago, Illinois (USA), July 2004. IFCS, Springer.
    • (2004) Classification, Clustering, and Data Mining Applications (Proceedings of IFCS 2004) , pp. 61-68
    • Golli, A.E.1    Conan-Guez, B.2    Rossi, F.3
  • 5
    • 0344972928 scopus 로고    scopus 로고
    • Self-organizing maps: Generalizations and new optimization techniques
    • November
    • T. Graepel, M. Burger, and K. Obermayer. Self-organizing maps: Generalizations and new optimization techniques. Neurocomputing, 21:173-190, November 1998.
    • (1998) Neurocomputing , vol.21 , pp. 173-190
    • Graepel, T.1    Burger, M.2    Obermayer, K.3
  • 6
    • 0344972931 scopus 로고    scopus 로고
    • Self-organizing maps of symbol strings
    • T. Kohonen and P. J. Somervuo. Self-organizing maps of symbol strings. Neurocomputing, 21:19-30, 1998.
    • (1998) Neurocomputing , vol.21 , pp. 19-30
    • Kohonen, T.1    Somervuo, P.J.2
  • 7
    • 0036790769 scopus 로고    scopus 로고
    • How to make large self-organizing maps for nonvectorial data
    • T. Kohonen and P. J. Somervuo. How to make large self-organizing maps for nonvectorial data. Neural Networks, 15(8):945-952, 2002.
    • (2002) Neural Networks , vol.15 , Issue.8 , pp. 945-952
    • Kohonen, T.1    Somervuo, P.J.2
  • 8
    • 0001173632 scopus 로고
    • An automatic method for solving discrete programming problems
    • A. H. Land and A. G. Doig. An automatic method for solving discrete programming problems. Econometrica, 28:497-520, 1960.
    • (1960) Econometrica , vol.28 , pp. 497-520
    • Land, A.H.1    Doig, A.G.2
  • 9
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6:707-710, 1966.
    • (1966) Sov Phys. Dokl , vol.6 , pp. 707-710
    • Levenshtein, V.I.1
  • 10
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • M. F. Porter. An algorithm for suffix stripping. Program, 14(3):130-137, 1980.
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, M.F.1
  • 12
    • 84958976659 scopus 로고    scopus 로고
    • Neighborhood preservation in nonlinear projection methods: An experimental study
    • In G. Dorffner, H. Bischof, and K. Hornik, editors, Berlin, Springer
    • J. Venna and S. Kaski. Neighborhood preservation in nonlinear projection methods: An experimental study. In G. Dorffner, H. Bischof, and K. Hornik, editors, Proceedings of the International Conference on Artificial Neural Networks (ICANN 2001), pages 485-491, Berlin, 2001. Springer.
    • (2001) Proceedings of the International Conference On Artificial Neural Networks (ICANN 2001) , pp. 485-491
    • Venna, J.1    Kaski, S.2


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