메뉴 건너뛰기




Volumn 12, Issue 3, 2009, Pages 175-184

Language independent unsupervised learning of short message service dialect

Author keywords

Clustering; Noisy text; Unsupervised learning

Indexed keywords

ANECDOTAL EVIDENCES; BAUM-WELCH; BAUM-WELCH ALGORITHMS; CLUSTERING; COST EFFECTIVE; GENERATIVE MODEL; HUMAN INTERVENTION; INFERENCE ALGORITHM; INSTANT MESSENGERS; LOG LIKELIHOOD; LOG-LIKELIHOOD FUNCTIONS; MULTILINGUALITY; NOISY TEXT; PAIRWISE DISTANCES; QUALITY OF RESULTS; SHORT MESSAGE SERVICES; TEXT-MINING; TEXTUAL DATA; TRAINING PHASE; UNSUPERVISED METHOD;

EID: 70349967721     PISSN: 14332833     EISSN: 14332825     Source Type: Journal    
DOI: 10.1007/s10032-009-0093-9     Document Type: Conference Paper
Times cited : (6)

References (19)
  • 2
    • 0000353178 scopus 로고
    • A maximization technique occurring in the statistical analysis of probabilisitic functions of Markov chains
    • Baum L.E., Petrie T., Soules G., Weiss N.: A maximization technique occurring in the statistical analysis of probabilisitic functions of Markov chains. Ann. Math. Stat. 41(1), 164-171 (1970)
    • (1970) Ann. Math. Stat. , vol.41 , Issue.1 , pp. 164-171
    • Baum, L.E.1    Petrie, T.2    Soules, G.3    Weiss, N.4
  • 7
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the em algorithm
    • (Series B)
    • Dempster A.P., Laird N.M., Rubin D.B.: Maximum likelihood from incomplete data via the em algorithm. J. R. Stat. Soc. 39(Series B), 1-38 (1977)
    • (1977) J. R. Stat. Soc. , vol.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 8
    • 0344031459 scopus 로고    scopus 로고
    • Technical Report TR-98-042, International Computer Science Insitute, Berkeley
    • Hofmann, T., Puzicha, J.: Unsupervised learning from dyadic data. Technical Report TR-98-042, International Computer Science Insitute, Berkeley (1998)
    • (1998) Unsupervised Learning from Dyadic Data
    • Hofmann, T.1    Puzicha, J.2
  • 10
    • 0038163983 scopus 로고    scopus 로고
    • Technical Report #02-017. Department of Computer Science, University of Minnesota
    • Karypis, G.: CLUTO - a clustering toolkit. Technical Report #02-017. Department of Computer Science, University of Minnesota (2003)
    • (2003) CLUTO - A Clustering Toolkit
    • Karypis, G.1
  • 12
    • 0026979939 scopus 로고
    • Technique for automatically correcting words in text
    • Kukich K.: Technique for automatically correcting words in text. ACM Comput. Surv. 24, 377-439 (1992)
    • (1992) ACM Comput. Surv. , vol.24 , pp. 377-439
    • Kukich, K.1
  • 14
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • Navarro G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31-88 (2001)
    • (2001) ACM Comput. Surv. , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 15
    • 0024610919 scopus 로고
    • A tutorial on hidden Markov models and selected applications in speech recognition
    • Rabiner L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77(2), 257-286 (1989)
    • (1989) Proc. IEEE , vol.77 , Issue.2 , pp. 257-286
    • Rabiner, L.R.1
  • 17
    • 0031568356 scopus 로고
    • Probabilistic independence networks for hidden Markov probability models
    • Smyth P., Heckerman D., Jordan M.I.: Probabilistic independence networks for hidden Markov probability models. Neural Comput. 9(2), 227-269 (1992)
    • (1992) Neural Comput. , vol.9 , Issue.2 , pp. 227-269
    • Smyth, P.1    Heckerman, D.2    Jordan, M.I.3


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