메뉴 건너뛰기




Volumn 46, Issue 1-3, 2002, Pages 291-314

A simple decomposition method for support vector machines

Author keywords

Classification; Decomposition methods; Support vector machines

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; PATTERN RECOGNITION; QUADRATIC PROGRAMMING; SET THEORY; VECTORS;

EID: 0036158552     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012427100071     Document Type: Article
Times cited : (277)

References (21)
  • 4
    • 0003768769 scopus 로고
    • Practical methods of optimization
    • New York: John Wiley and Sons
    • (1987)
    • Fletcher, R.1
  • 9
    • 0036158636 scopus 로고    scopus 로고
    • Feasible direction decomposition algorithms for training support vector machines
    • (2002) Machine Learning , vol.46 , pp. 315-349
    • Laskov, P.1
  • 10
    • 0003984755 scopus 로고    scopus 로고
    • On the convergence of the decomposition method for support vector machines
    • (Technical Report). Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan
    • (2000) IEEE Trans. Neural Network
    • Lin, C.-J.1
  • 18
    • 0003798627 scopus 로고    scopus 로고
    • Advances in kernel methods - Support vector learning
    • Schölkopf, B., Burges, C. J. C., & Smola, A. J. (Eds.); Cambridge, MA: MIT Press
    • (1998)
  • 19
    • 0003551703 scopus 로고
    • LOQO: An interior point code for quadratic programming
    • (Technical Report No. SOR 94-15). Statistics and Operations Research, Princeton University. (revised November, 1998)
    • (1994)
    • Vanderbei, R.1


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