메뉴 건너뛰기




Volumn , Issue , 2007, Pages 65-68

An approximate approach for training polynomial kernel SVMs in linear time

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DATA MINING; LARGE DATASET; LEARNING ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS; POLYNOMIALS;

EID: 80053414342     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (12)

References (9)
  • 4
    • 21844461582 scopus 로고    scopus 로고
    • A modified finite Newton method for fast solution of large scale linear SVMs
    • Sathiya Keerthi and Dennis DeCoste. 2005. A modified finite Newton method for fast solution of large scale linear SVMs. Journal of Machine Learning Research. 6: 341-361.
    • (2005) Journal of Machine Learning Research , vol.6 , pp. 341-361
    • Keerthi, Sathiya1    DeCoste, Dennis2
  • 7
    • 33847656180 scopus 로고    scopus 로고
    • A Robust Multilingual Portable Phrase Chunking System
    • Yue-Shi Lee and Yu-Chieh Wu. 2007. A Robust Multilingual Portable Phrase Chunking System. Expert Systems with Applications, 33(3): 1-26.
    • (2007) Expert Systems with Applications , vol.33 , Issue.3 , pp. 1-26
    • Lee, Yue-Shi1    Wu, Yu-Chieh2


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