메뉴 건너뛰기




Volumn 17, Issue 1, 2005, Pages 25-31

Oblique multicategory decision trees using nonlinear programming

Author keywords

Applications; Artificial intelligence; Decision trees; Machine learning; Nonlinear; Programming

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; DATA MINING; DECISION MAKING; LEARNING SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; TREES (MATHEMATICS);

EID: 14644390203     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0047     Document Type: Article
Times cited : (11)

References (28)
  • 1
    • 0009014176 scopus 로고
    • Decision tree construction via linear programming
    • M. Evans, ed. Midwest Artificial Intelligence and Cognitive Science Society, Utica, IL
    • Bennett, K. P. 1992. Decision tree construction via linear programming. M. Evans, ed. Proc. 4th Midwest Artificial Intelligence and Cognitive Sci. Soc. Conf., Midwest Artificial Intelligence and Cognitive Science Society, Utica, IL, 97-101.
    • (1992) Proc. 4th Midwest Artificial Intelligence and Cognitive Sci. Soc. Conf. , pp. 97-101
    • Bennett, K.P.1
  • 2
    • 0347122494 scopus 로고    scopus 로고
    • A parametric optimization method for machine learning
    • Bennett, K. P., E. J. Bredensteiner. 1997. A parametric optimization method for machine learning. INFORMS J. Comput. 9 311-318.
    • (1997) INFORMS J. Comput. , vol.9 , pp. 311-318
    • Bennett, K.P.1    Bredensteiner, E.J.2
  • 3
    • 0006456134 scopus 로고    scopus 로고
    • Geometry in learning
    • C. Gorini, ed., Mathematical Association of America, Washington, DC
    • Bennett, K. P., E. J. Bredensteiner. 2000. Geometry in learning. C. Gorini, ed. Geometry at Work, Mathematical Association of America, Washington, DC, 132-145.
    • (2000) Geometry at Work , pp. 132-145
    • Bennett, K.P.1    Bredensteiner, E.J.2
  • 4
    • 0026860799 scopus 로고
    • Robust linear programming discrimination of two linearly inseparable sets
    • Bennett, K. P., O. L. Mangasarian. 1992. Robust linear programming discrimination of two linearly inseparable sets. Optim. Methods Software 1 23-34.
    • (1992) Optim. Methods Software , vol.1 , pp. 23-34
    • Bennett, K.P.1    Mangasarian, O.L.2
  • 5
    • 0001859637 scopus 로고
    • Constrained minimization using recursive quadratic programming
    • L. C. W. Dixon, G. P. Szergo, eds. North-Holland, Amsterdam, The Netherlands
    • Biggs, M. C. 1975. Constrained minimization using recursive quadratic programming. L. C. W. Dixon, G. P. Szergo, eds. Toward Global Optimization. North-Holland, Amsterdam, The Netherlands, 341-349.
    • (1975) Toward Global Optimization , pp. 341-349
    • Biggs, M.C.1
  • 6
    • 0003408496 scopus 로고    scopus 로고
    • Department of Information and Computer Sciences. University of California, Irvine, CA
    • Blake, C. L., C. J. Merz. 1998. UCI repository of machine learning databases. Department of Information and Computer Sciences. University of California, Irvine, CA. http://www.ics.uci.edu/~mlearn/MLRepository.html.
    • (1998) UCI Repository of Machine Learning Databases
    • Blake, C.L.1    Merz, C.J.2
  • 7
    • 0004990788 scopus 로고    scopus 로고
    • Mathematical programming for data mining: Formulations and challenges
    • Bradley, P. S., U. M. Fayyad, O. L. Mangasarian. 1999. Mathematical programming for data mining: Formulations and challenges. INFORMS J. Comput. 11 217-238.
    • (1999) INFORMS J. Comput. , vol.11 , pp. 217-238
    • Bradley, P.S.1    Fayyad, U.M.2    Mangasarian, O.L.3
  • 10
    • 6744266523 scopus 로고
    • Automatic selection of split criterion during tree growing based on node location
    • A. Prieditis, S. Russell, eds., Morgan Kaufmann, San Francisco, CA
    • Brodley, C. E. 1995. Automatic selection of split criterion during tree growing based on node location. A. Prieditis, S. Russell, eds. Proc. 12th Internat. Conf. Machine Learning, Morgan Kaufmann, San Francisco, CA, 73-80.
    • (1995) Proc. 12th Internat. Conf. Machine Learning , pp. 73-80
    • Brodley, C.E.1
  • 11
    • 0029206129 scopus 로고
    • Smoothing methods for convex inequalities and linear complementarity problems
    • Chen, C., O. L. Mangasarian. 1995. Smoothing methods for convex inequalities and linear complementarity problems. Math. Programming 71 51-69.
    • (1995) Math. Programming , vol.71 , pp. 51-69
    • Chen, C.1    Mangasarian, O.L.2
  • 12
    • 21344452262 scopus 로고    scopus 로고
    • Hybrid misclassification minimization
    • Chen, C., O. L. Mangasarian. 1996. Hybrid misclassification minimization. Adv. Comput. Math. 5 127-136.
    • (1996) Adv. Comput. Math. , vol.5 , pp. 127-136
    • Chen, C.1    Mangasarian, O.L.2
  • 14
    • 0003586436 scopus 로고
    • Ph.D. thesis, Electrical Engineering and Computer Science Department, The University of Michigan, Ann Arbor, MI
    • Fayyad, U. M. 1991. On the induction of decision trees for multiple concept learning. Ph.D. thesis, Electrical Engineering and Computer Science Department, The University of Michigan, Ann Arbor, MI.
    • (1991) On the Induction of Decision Trees for Multiple Concept Learning
    • Fayyad, U.M.1
  • 15
    • 0027002165 scopus 로고
    • The attribute selection problem in decision tree generation
    • MIT Press, San Jose, CA
    • Fayyad, U. M., K. Irani. 1992. The attribute selection problem in decision tree generation. Proc. 11th National Conf. Artificial Intelligence, MIT Press, San Jose, CA, 322-327.
    • (1992) Proc. 11th National Conf. Artificial Intelligence , pp. 322-327
    • Fayyad, U.M.1    Irani, K.2
  • 17
    • 84985847276 scopus 로고
    • Improved linear programming models for discriminant analysis
    • Glover, F. 1990. Improved linear programming models for discriminant analysis. Decision Sci. 21 771-785.
    • (1990) Decision Sci. , vol.21 , pp. 771-785
    • Glover, F.1
  • 19
    • 0000963583 scopus 로고
    • Linear and nonlinear separation of patterns by linear programming
    • Mangasarian, O. L. 1965. Linear and nonlinear separation of patterns by linear programming. Oper. Res. 13 444-452.
    • (1965) Oper. Res. , vol.13 , pp. 444-452
    • Mangasarian, O.L.1
  • 20
    • 84914951454 scopus 로고
    • Multi-surface method of pattern separation
    • Mangasarian, O. L. 1968. Multi-surface method of pattern separation. IEEE Trans. Inform. Theory IT-14 801-807.
    • (1968) IEEE Trans. Inform. Theory , vol.IT-14 , pp. 801-807
    • Mangasarian, O.L.1
  • 21
    • 0000478184 scopus 로고
    • Mathematical programming in neural networks
    • Mangasarian, O. L. 1993. Mathematical programming in neural networks. ORSA J. Comput. 5 349-360.
    • (1993) ORSA J. Comput. , vol.5 , pp. 349-360
    • Mangasarian, O.L.1
  • 22
    • 0001509691 scopus 로고
    • Misclassification minimization
    • Mangasarian, O. L. 1994. Misclassification minimization. J. Global Optim. 5 309-323.
    • (1994) J. Global Optim. , vol.5 , pp. 309-323
    • Mangasarian, O.L.1
  • 25
    • 33744584654 scopus 로고
    • Induction of decision trees
    • Quinlan, J. R. 1986. Induction of decision trees. Machine Learning 1 81-106.
    • (1986) Machine Learning , vol.1 , pp. 81-106
    • Quinlan, J.R.1
  • 27
    • 0000629975 scopus 로고
    • Cross-validatory choice and assessment of statistical predictions
    • Stone, M. 1974. Cross-validatory choice and assessment of statistical predictions. J. Roy. Statist. Soc. Ser. B 36 111-147.
    • (1974) J. Roy. Statist. Soc. Ser. B , vol.36 , pp. 111-147
    • Stone, M.1


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