메뉴 건너뛰기




Volumn 24, Issue 4, 2002, Pages 473-480

Set containment characterization

Author keywords

Knowledge based classifier; Linear programming; Quadratic programming; Set containment

Indexed keywords


EID: 84867927698     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/A:1021207718605     Document Type: Article
Times cited : (55)

References (16)
  • 6
    • 0022161165 scopus 로고
    • On the complexity of four polyhedral set containment problems
    • R. M. Freund J. B. Orlin 1985 On the complexity of four polyhedral set containment problems Mathematical Programming 33 139 145
    • (1985) Mathematical Programming , vol.33 , pp. 139-145
    • Freund, R.M.1    Orlin, J.B.2
  • 8
    • 84867979712 scopus 로고    scopus 로고
    • 00-08 DataMining Institute, Computer Sciences Department, University ofWisconsin Madison, WI
    • Fung, G., Mangasarian, O. L. and Smola, A. (2000), Minimal kernel classifiers. Technical Report 00-08, DataMining Institute, Computer Sciences Department, University ofWisconsin, Madison, WI. ftp://ftp.cs.wisc.edu/pub/dmi/ tech-reports/00-08.ps.
    • (2000) Minimal Kernel Classifiers Technical Report
    • Fung, G.1    Mangasarian, O.L.2    Smola, A.3
  • 9
    • 0000012770 scopus 로고
    • Inner and outer j-radii of convex bodies in finite-dimensional normed spaces
    • P. Gritzmann V. Klee 1992 Inner and outer j-radii of convex bodies in finite-dimensional normed spaces Discrete and Computational Geometry 7 255 280
    • (1992) Discrete and Computational Geometry , vol.7 , pp. 255-280
    • Gritzmann, P.1    Klee, V.2
  • 10
    • 0024665751 scopus 로고
    • A polynomial-time algorithm for a class of linear complementarity problems
    • M. Kojima S. Mizuno A. Yoshise 1989 A polynomial-time algorithm for a class of linear complementarity problems Mathematical Programming 44 1 26
    • (1989) Mathematical Programming , vol.44 , pp. 1-26
    • Kojima, M.1    Mizuno, S.2    Yoshise, A.3
  • 11
    • 0006300425 scopus 로고
    • Characterization of linear complementarity problems as linear programs
    • O. L. Mangasarian 1978 Characterization of linear complementarity problems as linear programs Mathematical Programming Study 7 74 87
    • (1978) Mathematical Programming Study , vol.7 , pp. 74-87
    • Mangasarian, O.L.1
  • 13
    • 0001777975 scopus 로고    scopus 로고
    • Generalized support vector machines
    • A. Smola P. Bartlett B. Schölkopf D. Schuurmans (eds). MIT Press Cambridge, MA
    • Mangasarian, O. L. (2000), Generalized support vector machines, in: A. Smola, P. Bartlett, B. Schölkopf, and D. Schuurmans (eds), MIT Press, Cambridge, MA. Advances in Large Margin Classifiers pp. 135-146, ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-14.ps.
    • (2000) Advances in Large Margin Classifiers , pp. 135-146
    • Mangasarian, O.L.1
  • 14
    • 0027678679 scopus 로고
    • The extraction of refined rules from knowledge-based neural networks
    • G. G. Towell J. W. Shavlik 1993 The extraction of refined rules from knowledge-based neural networks Machine Learning 13 71 101
    • (1993) Machine Learning , vol.13 , pp. 71-101
    • Towell, G.G.1    Shavlik, J.W.2
  • 15


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