메뉴 건너뛰기




Volumn , Issue , 2009, Pages 316-319

Online nearest point algorithm for L2-SVM

Author keywords

Nearest point algorithm; Online learning; Support vector machine

Indexed keywords

BATCH ALGORITHMS; BENCHMARK DATA; NEAREST POINT; NEAREST POINT ALGORITHM; ON-LINE ALGORITHMS; ON-LINE TRAINING ALGORITHM; ONLINE LEARNING; RANDOM SELECTION; TEST ACCURACY;

EID: 70350754232     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/JCAI.2009.186     Document Type: Conference Paper
Times cited : (11)

References (12)
  • 1
    • 0036161258 scopus 로고    scopus 로고
    • The relaxed online maximum margin algorithm
    • Y. Li and P. M. Long, "The relaxed online maximum margin algorithm, " Machine Learning, 46(1-3): 361-387, 2002.
    • (2002) Machine Learning , vol.46 , Issue.1-3 , pp. 361-387
    • Li, Y.1    Long, P.M.2
  • 3
    • 0141496132 scopus 로고    scopus 로고
    • Ultraconservative online algorithms for multiclass problems
    • K. Crammer and Y. Singer, "Ultraconservative online algorithms for multiclass problems, " Jornal of Machine Learning Research, 3:951- 991, 2003.
    • (2003) Jornal of Machine Learning Research , vol.3 , pp. 951-991
    • Crammer, K.1    Singer, Y.2
  • 12
    • 0002274728 scopus 로고
    • Minimizing the quadratic form on convex set
    • Gilbet, E.G., "Minimizing the quadratic form on convex set, " SIAM J. Control 4(1966) 61-79.
    • (1966) SIAM J. Control , vol.4 , pp. 61-79
    • Gilbet, E.G.1


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