메뉴 건너뛰기
Machine Learning
Volumn 66, Issue 2-3, 2007, Pages 151-163
A new PAC bound for intersection-closed concept classes
Author keywords

Intersection closed classes; PAC bounds
Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING;
EID: 33847663803     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-006-8638-3     Document Type: Article
Times cited : (26)
References (9)
  • 1
    • 0346044653 scopus 로고    scopus 로고
    • Learning nested differences in the presence of malicious noise
    • Auer, P. (1997). Learning nested differences in the presence of malicious noise. Theor. Comput. Sci., 185(1), 159-175.
    • (1997) Theor. Comput. Sci , vol.185 , Issue.1 , pp. 159-175
    • Auer, P.1
  • 2
    • 0042376985 scopus 로고    scopus 로고
    • On-line learning with malicious noise and the closure algorithm
    • Auer, P., & Cesa-Bianchi, N. (1998). On-line learning with malicious noise and the closure algorithm. Ann. Math. Artif. Intell., 23 (1-2), 83-99.
    • (1998) Ann. Math. Artif. Intell , vol.23 , Issue.1-2 , pp. 83-99
    • Auer, P.1    Cesa-Bianchi, N.2
  • 3
    • 0032302519 scopus 로고    scopus 로고
    • Approximating hyper-rectangles: Learning and pseudorandom sets
    • Auer, P., Long, P.M., & Srinivasan, A. (1998). Approximating hyper-rectangles: Learning and pseudorandom sets. J. Comput. Syst. Sci., 57(3), 376-388.
    • (1998) J. Comput. Syst. Sci , vol.57 , Issue.3 , pp. 376-388
    • Auer, P.1    Long, P.M.2    Srinivasan, A.3
  • 4
    • 0024750852 scopus 로고
    • Learnability and the Vapnik-Chervonenkis dimension
    • Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1989). Learnability and the Vapnik-Chervonenkis dimension. J. ACM, 36(4), 929-965.
    • (1989) J. ACM , vol.36 , Issue.4 , pp. 929-965
    • Blumer, A.1    Ehrenfeucht, A.2    Haussler, D.3    Warmuth, M.4
  • 5
    • 0024739191 scopus 로고
    • A general lower bound on the number of examples needed for learning
    • Ehrenfeucht, A., Haussler, D., Kearns, M. J., & Valiant, L. G. (1989). A general lower bound on the number of examples needed for learning. Inf. Comput., 82(3), 247-261.
    • (1989) Inf. Comput , vol.82 , Issue.3 , pp. 247-261
    • Ehrenfeucht, A.1    Haussler, D.2    Kearns, M.J.3    Valiant, L.G.4
  • 6
    • 0029521676 scopus 로고
    • Sample compression, learnability, and the Vapnik-Chervonenkis dimension
    • Floyd, A., & Warmuth, M. (1995). Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, 21(3), 269-304.
    • (1995) Machine Learning , vol.21 , Issue.3 , pp. 269-304
    • Floyd, A.1    Warmuth, M.2
  • 7
    • 43949159818 scopus 로고
    • Predicting {0,l}-functions on randomly drawn points
    • Haussler, D., Littlestone, N., & Warmuth, M. (1994). Predicting {0,l}-functions on randomly drawn points. Inf. Comput., 115(2), 248-292.
    • (1994) Inf. Comput , vol.115 , Issue.2 , pp. 248-292
    • Haussler, D.1    Littlestone, N.2    Warmuth, M.3
  • 8
    • 0025446773 scopus 로고
    • Learning nested differences of intersection-closed concept classes
    • Helmbold, D., Sloan, R., & Warmuth, M. (1990). Learning nested differences of intersection-closed concept classes. Machine Learning 5, 165-196.
    • (1990) Machine Learning , vol.5 , pp. 165-196
    • Helmbold, D.1    Sloan, R.2    Warmuth, M.3
  • 9
    • 0001703864 scopus 로고
    • On the density of families of sets
    • Sauer, N. (1972). On the density of families of sets. J. Combin. Theory Ser. A, 13, 145-147.
    • (1972) J. Combin. Theory Ser. A , vol.13 , pp. 145-147
    • Sauer, N.1

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