메뉴 건너뛰기




Volumn 4669 LNCS, Issue PART 2, 2007, Pages 291-300

Split-Merge Incremental LEarning (SMILE) of mixture models

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; MAXIMUM LIKELIHOOD;

EID: 38149010607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74695-9_30     Document Type: Conference Paper
Times cited : (21)

References (11)
  • 5
    • 0002629270 scopus 로고
    • Maximum Likelihood from incomplete data via the EM algorithm
    • Dempster, A., Laird, N., Rubin, D.: Maximum Likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. B 39, 1-38 (1977)
    • (1977) J. Roy. Statist. Soc. B , vol.39 , pp. 1-38
    • Dempster, A.1    Laird, N.2    Rubin, D.3
  • 7
    • 0036469527 scopus 로고    scopus 로고
    • A greedy EM algorithm for Gaussian mixture learning
    • Vlassis, N., Likas, A.: A greedy EM algorithm for Gaussian mixture learning. Neural Processing Letters 15, 77-87 (2001)
    • (2001) Neural Processing Letters , vol.15 , pp. 77-87
    • Vlassis, N.1    Likas, A.2
  • 11
    • 21544432712 scopus 로고    scopus 로고
    • BrainWeb: Online interface to a 3D MRI simulated brain database
    • 2/4
    • Cocosco, C., Kollokian, V., Kwan, R.S., Evans, A.: BrainWeb: Online interface to a 3D MRI simulated brain database. Neurolmage 5(3), 2/4, S425 (1997)
    • (1997) Neurolmage , vol.5 , Issue.3
    • Cocosco, C.1    Kollokian, V.2    Kwan, R.S.3    Evans, A.4


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