메뉴 건너뛰기




Volumn , Issue , 2000, Pages 335-339

Efficient algorithms for constructing decision trees with constraints

Author keywords

Classification; Decision tree

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; DECISION THEORY; TREES (MATHEMATICS);

EID: 0034592752     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/347090.347163     Document Type: Conference Paper
Times cited : (29)

References (11)
  • 1
    • 0030170591 scopus 로고    scopus 로고
    • An efficient algorithm for optimal pruning of decision trees
    • Hussein Almuallim. "An efficient algorithm for optimal pruning of decision trees". Artificial Intelligence, 83:346-362, 1996.
    • (1996) Artificial Intelligence , vol.83 , pp. 346-362
    • Almuallim, H.1
  • 2
    • 0028443644 scopus 로고
    • Trading accuracy for simplicity in decision trees
    • Marko Bohanec and Ivan Bratko. "Trading Accuracy for Simplicity in Decision Trees". Machine Learning, 15:223-250, 1994.
    • (1994) Machine Learning , vol.15 , pp. 223-250
    • Bohanec, M.1    Bratko, I.2
  • 7
    • 0024627518 scopus 로고
    • Inferring decision trees using minimum description length principle
    • J. R. Quinlan and R. L. Rivest. Inferring decision trees using minimum description length principle. Information and Computation, 1989.
    • (1989) Information and Computation
    • Quinlan, J.R.1    Rivest, R.L.2
  • 10
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • J. Rissanen. Modeling by shortest data description. Automatics, 14:465-471, 1978.
    • (1978) Automatics , vol.14 , pp. 465-471
    • Rissanen, J.1


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