메뉴 건너뛰기




Volumn 2, Issue , 2002, Pages 617-622

Constructing decision tree with continuous attributes for binary classification

Author keywords

Decision tree; Information gain; Machine learning; Range splitting for continuous attributes (RCAT)

Indexed keywords

ALGORITHMS; CALCULATIONS; CONSTRAINT THEORY; DATA STRUCTURES; DECISION THEORY; ESTIMATION; KNOWLEDGE REPRESENTATION; OPTIMIZATION; PROBABILITY;

EID: 0036925067     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (9)
  • 1
    • 0003500248 scopus 로고
    • C4.5: Programs for machine learning
    • Morgan Kaufmann, San Mateo, CA
    • J. R. Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann, San Mateo, CA, 1993.
    • (1993)
    • Quinlan, J.R.1
  • 4
    • 0032595775 scopus 로고    scopus 로고
    • General and efficient multisplitting of numerical attributes
    • T. Elomaa, J. Rousu. General and Efficient Multisplitting of Numerical Attributes. Machine Learning, 1-49, 1999.
    • (1999) Machine Learning , pp. 1-49
    • Elomaa, T.1    Rousu, J.2
  • 6
    • 24444444709 scopus 로고    scopus 로고
    • Development and research of neural computing
    • Technical report
    • Chen ZhaoQian, Zhou ZhiHua, Chen ShiFu. Development and research of neural computing. Technical report. 2000.
    • (2000)
    • Zhaoqian, Z.Q.1    Zhou, Z.H.2    Chen, S.F.3
  • 7
    • 0003024008 scopus 로고
    • On the handling of continuous-valued attributes in decision tree generation
    • U. M. Fayyad, K. B. Irani. On the handling of continuous-valued attributes in decision tree generation. Machine Learning, 8: 87-102, 1992.
    • (1992) Machine Learning , vol.8 , pp. 87-102
    • Fayyad, U.M.1    Irani, K.B.2
  • 9
    • 0012228021 scopus 로고    scopus 로고
    • UCI KDD Archive
    • [http://kdd.ics.uci.edu], S. D. Bay. UCI KDD Archive. 1999.
    • (1999)
    • Bay, S.D.1


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