메뉴 건너뛰기




Volumn 6, Issue , 2005, Pages

Large margin methods for structured and interdependent output variables

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); INFORMATION RETRIEVAL; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTICAL CHARACTER RECOGNITION; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

EID: 24944537843     PISSN: 15337928     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (1755)

References (34)
  • 8
    • 0010442827 scopus 로고    scopus 로고
    • On the algorithmic implementation of multi-class kernel-based vector machines
    • K. Crammer and Y. Singer. On the algorithmic implementation of multi-class kernel-based vector machines. Machine Learning Research, 2:265-292, 2001.
    • (2001) Machine Learning Research , vol.2 , pp. 265-292
    • Crammer, K.1    Singer, Y.2
  • 12
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • M. Grötschel, L. Lovàtz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2): 169-197, 1981.
    • (1981) Combinatorica , vol.1 , Issue.2 , pp. 169-197
    • Grötschel, M.1    Lovàtz, L.2    Schrijver, A.3
  • 17
    • 14344265542 scopus 로고    scopus 로고
    • Learning to align sequences: A maximum-margin approach
    • Cornell University
    • T. Joachims. Learning to align sequences: A maximum-margin approach. Technical report, Cornell University, 2003.
    • (2003) Technical Report
    • Joachims, T.1
  • 19
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • M. Johnson. PCFG models of linguistic tree representations. Computational Linguistics, 24(4):613-632, 1998.
    • (1998) Computational Linguistics , vol.24 , Issue.4 , pp. 613-632
    • Johnson, M.1
  • 20
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-396, 1984.
    • (1984) Combinatorica , vol.4 , Issue.4 , pp. 373-396
    • Karmarkar, N.1
  • 25
    • 0033905095 scopus 로고    scopus 로고
    • Boostexter: A boosting-based system for text categorization
    • R. E. Schapire and Y. Singer. Boostexter: A boosting-based system for text categorization. Machine Learning, 39(2-3): 135-168, 2000.
    • (2000) Machine Learning , vol.39 , Issue.2-3 , pp. 135-168
    • Schapire, R.E.1    Singer, Y.2
  • 27
    • 24944502929 scopus 로고    scopus 로고
    • Exponential families for generative and discriminative estimation
    • A. Smola and T. Hofmann. Exponential families for generative and discriminative estimation. Technical report, 2003.
    • (2003) Technical Report
    • Smola, A.1    Hofmann, T.2
  • 33
    • 0003425673 scopus 로고    scopus 로고
    • Multi-class support vector machines
    • Department of Computer Science, Royal Holloway, University of London
    • J. Weston and C. Watkins. Multi-class support vector machines. Technical Report CSD-TR-98-04, Department of Computer Science, Royal Holloway, University of London, 1998.
    • (1998) Technical Report , vol.CSD-TR-98-04
    • Weston, J.1    Watkins, C.2


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