메뉴 건너뛰기




Volumn , Issue , 2009, Pages 65-72

A transductive bound for the voted classifier with an application to semi-supervised learning

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; RISK PERCEPTION; SUPERVISED LEARNING;

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

References (12)
  • 4
    • 24344495921 scopus 로고    scopus 로고
    • Explicit learning curves for transduction and application to clustering and compression algorithms
    • Derbeko, P., El-Yaniv, R. & Meir, R. (2004) Explicit learning curves for transduction and application to clustering and compression algorithms. Journal of Artificial Intelligence Research 22:117-142. (Pubitemid 41525884)
    • (2004) Journal of Artificial Intelligence Research , vol.22 , pp. 117-142
    • Derbeko, P.1    El-Yaniv, R.2    Meir, R.3
  • 6
  • 9
    • 9444279514 scopus 로고    scopus 로고
    • Simplified PAC-Bayesian margin bounds
    • Learning Theory and Kernel Machines
    • th Annual Conference on Learning Theory, Lecture Notes in Artificial Intelligence, 203-215. (Pubitemid 37053205)
    • (2003) Lecture Notes in Computer Science , Issue.2777 , pp. 203-215
    • McAllester, D.1
  • 11
    • 13544261390 scopus 로고    scopus 로고
    • Combining active and semi-supervised learning for spoken language understanding
    • DOI 10.1016/j.specom.2004.08.002, PII S0167639304000962
    • Tür, G., Hakkani-Tür, D.Z. & Schapire, R.E. (2005) Combining active and semi-supervised learning for spoken language understanding. Journal of Speech Communication 45(2):171-186. (Pubitemid 40220192)
    • (2005) Speech Communication , vol.45 , Issue.2 , pp. 171-186
    • Tur, G.1    Hakkani-Tur, D.2    Schapire, R.E.3


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