메뉴 건너뛰기




Volumn 72, Issue 1-2, 2008, Pages 89-112

A theory of learning with similarity functions

Author keywords

Kernel functions; Margins; Similarity functions

Indexed keywords

ARTIFICIAL INTELLIGENCE;

EID: 70350723650     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-008-5059-5     Document Type: Article
Times cited : (127)

References (27)
  • 2
    • 0031119485 scopus 로고    scopus 로고
    • The hardness of approximate optima in lattices, codes, and systems of linear equations
    • Arora, S., Babai, L., Stern, J., & Sweedyk, Z. (1997). The hardness of approximate optima in lattices, codes, and systems of linear equations. Journal of Computer and System Sciences, 54, 317-331.
    • (1997) Journal of Computer and System Sciences , vol.54 , pp. 317-331
    • Arora, S.1    Babai, L.2    Stern, J.3    Sweedyk, Z.4
  • 4
    • 33749033927 scopus 로고    scopus 로고
    • Kernels as features: On kernels, margins, and low-dimensional mappings
    • Balcan, M.-F., Blum, A., & Vempala, S. (2006). Kernels as features: on kernels, margins, and low-dimensional mappings. Machine Learning, 65(1), 79-94.
    • (2006) Machine Learning , vol.65 , Issue.1 , pp. 79-94
    • Balcan, M.-F.1    Blum, A.2    Vempala, S.3
  • 6
    • 0038453192 scopus 로고    scopus 로고
    • Rademacher and Gaussian complexities: Risk bounds and structural results
    • Bartlett, P. L., & Mendelson, S. (2003). Rademacher and Gaussian complexities: risk bounds and structural results. Journal of Machine Learning Research, 3, 463-482.
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 463-482
    • Bartlett, P.L.1    Mendelson, S.2
  • 7
    • 0033281425 scopus 로고    scopus 로고
    • Large margin classification using the perceptron algorithm
    • Freund, Y., & Schapire, R. E. (1999). Large margin classification using the perceptron algorithm. Machine Learning, 37(3), 277-296.
    • (1999) Machine Learning , vol.37 , Issue.3 , pp. 277-296
    • Freund, Y.1    Schapire, R.E.2
  • 9
    • 0027657329 scopus 로고
    • Semi-infinite programming: Theory, methods, and applications
    • Hettich, R., & Kortanek, K. O. (1993). Semi-infinite programming: theory, methods, and applications. SIAM Review, 35(3), 380-429.
    • (1993) SIAM Review , vol.35 , Issue.3 , pp. 380-429
    • Hettich, R.1    Kortanek, K.O.2
  • 15
    • 0742287001 scopus 로고    scopus 로고
    • Combining pairwise sequence similarity and support vector machines for detecting remote protein evolutionary and structural relationships
    • Liao, L., & Noble, W. S. (2003). Combining pairwise sequence similarity and support vector machines for detecting remote protein evolutionary and structural relationships. Journal of Computational Biology, 10(6), 857-868.
    • (2003) Journal of Computational Biology , vol.10 , Issue.6 , pp. 857-868
    • Liao, L.1    Noble, W.S.2
  • 17
    • 0025448521 scopus 로고
    • The strength of weak learnability
    • Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227.
    • (1990) Machine Learning , vol.5 , Issue.2 , pp. 197-227
    • Schapire, R.E.1
  • 23
    • 84897581768 scopus 로고    scopus 로고
    • How good is a kernel as a similarity function
    • Srebro, N. (2007). How good is a kernel as a similarity function. In COLT.
    • (2007) COLT
    • Srebro, N.1
  • 24
    • 0021518106 scopus 로고
    • A theory of the learnable
    • Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134-1142.
    • (1984) Communications of the ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1


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