메뉴 건너뛰기




Volumn 2225, Issue , 2001, Pages 106-118

Learning of boolean functions using support vector machines

Author keywords

[No Author keywords available]

Indexed keywords

SUPPORT VECTOR MACHINES;

EID: 84948143092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45583-3_10     Document Type: Conference Paper
Times cited : (28)

References (16)
  • 1
    • 0000710299 scopus 로고
    • Queries and concept learning
    • D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
    • (1988) Machine Learning , vol.2 , pp. 319-342
    • Angluin, D.1
  • 2
    • 0345581486 scopus 로고
    • The complexity of approximating a nonlinear program
    • World Scientific
    • M. Bellare and P. Rogaway. The complexity of approximating a nonlinear program. In Complexity of Numerical Optimization, pages 16-32. World Scientific, 1993.
    • (1993) Complexity of Numerical Optimization , pp. 16-32
    • Bellare, M.1    Rogaway, P.2
  • 5
    • 0031269184 scopus 로고    scopus 로고
    • On the optimality of the simple Bayesian classifier under zero-one loss
    • P. Domingos. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29:103-130, 1997.
    • (1997) Machine Learning , vol.29 , pp. 103-130
    • Domingos, P.1
  • 6
    • 22844456607 scopus 로고    scopus 로고
    • The role of Occam’s razor in knowledge discovery
    • P. Domingos. The role of Occam’s razor in knowledge discovery. Data Mining and Knowledge Discovery, 3:409-425, 1999.
    • (1999) Data Mining and Knowledge Discovery , vol.3 , pp. 409-425
    • Domingos, P.1
  • 7
    • 0023545078 scopus 로고
    • On the learnability of Boolean formulae
    • M. Kearns, Ming Li, L. Pitt, and L.G. Valiant. On the learnability of Boolean formulae. ACM, pages 285-295, 1987.
    • (1987) ACM , pp. 285-295
    • Kearns, M.1    Li, M.2    Pitt, L.3    Valiant, L.G.4
  • 8
    • 84948167995 scopus 로고    scopus 로고
    • Efficiency versus convergence of Boolean kernels for on-line learning algorithms
    • R. Khardon, D. Roth, and R. Servedio. Efficiency versus convergence of Boolean kernels for on-line learning algorithms. Manuscript, 2001.
    • (2001) Manuscript
    • Khardon, R.1    Roth, D.2    Servedio, R.3
  • 9
    • 0032025353 scopus 로고    scopus 로고
    • Feature transformation and subset selection
    • H. Liu and H. Motoda. Feature transformation and subset selection. IEEE Intelligent Systems, 13(2):26-28, 1998.
    • (1998) IEEE Intelligent Systems , vol.13 , Issue.2 , pp. 26-28
    • Liu, H.1    Motoda, H.2
  • 11
    • 0003120218 scopus 로고    scopus 로고
    • Fast training of support vector machines using sequential minimal optimization
    • MIT Press
    • J.C. Platt. Fast training of support vector machines using sequential minimal optimization. In Advances in Kernel Methods-Support Vector Learning, pages 185-208. MIT Press, 1998.
    • (1998) In Advances in Kernel Methods-Support Vector Learning , pp. 185-208
    • Platt, J.C.1
  • 14
    • 0021518106 scopus 로고
    • A theory of the learnable
    • L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
    • (1984) Communications of the ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1


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