메뉴 건너뛰기




Volumn 29, Issue 1, 1997, Pages 5-44

Decision Tree Induction Based on Efficient Tree Restructuring

Author keywords

Binary test; Decision tree; Direct metric; Example incorporation; Incremental induction; Installed test; Missing value; Tree transposition; Update cost; Virtual pruning

Indexed keywords

COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

EID: 0031246271     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007413323501     Document Type: Article
Times cited : (284)

References (25)
  • 5
    • 0003024008 scopus 로고
    • On the handling of continuous-valued attributes in decision tree generation
    • Fayyad, U. M., & Irani, K. B. (1992). On the handling of continuous-valued attributes in decision tree generation. Machine Learning, 8, 87-102.
    • (1992) Machine Learning , vol.8 , pp. 87-102
    • Fayyad, U.M.1    Irani, K.B.2
  • 6
    • 0029678997 scopus 로고    scopus 로고
    • Iterative optimization and simplification of hierarchical clusterings
    • Fisher, D. (1996). Iterative optimization and simplification of hierarchical clusterings. Journal of Artificial Intelligence Research, 4, 147-178.
    • (1996) Journal of Artificial Intelligence Research , vol.4 , pp. 147-178
    • Fisher, D.1
  • 7
    • 0030231557 scopus 로고    scopus 로고
    • Efficient incremental induction of decision trees
    • Kalles, D., & Morris, T. (1996). Efficient incremental induction of decision trees. Machine Learning, 24, 231-242.
    • (1996) Machine Learning , vol.24 , pp. 231-242
    • Kalles, D.1    Morris, T.2
  • 11
    • 0003408496 scopus 로고
    • Irvine, CA: University of California, Department of Information and Computer Science
    • Murphy, P. M., & Aha, D. W. (1994). UCI repository of machine learning databases, Irvine, CA: University of California, Department of Information and Computer Science.
    • (1994) UCI Repository of Machine Learning Databases
    • Murphy, P.M.1    Aha, D.W.2
  • 13
    • 0024627518 scopus 로고
    • Inferring decision trees using the minimum description length principle
    • Quinlan, J. R., & Rivest, R. L. (1989). Inferring decision trees using the minimum description length principle. Information and Computation, 80, 227-248.
    • (1989) Information and Computation , vol.80 , pp. 227-248
    • Quinlan, J.R.1    Rivest, R.L.2
  • 15
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • Rissanen, J. (1978). Modeling by shortest data description. Automatica, 14, 465-471.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 19
    • 77952642202 scopus 로고
    • Incremental induction of decision trees
    • Utgoff, P. E. (1989). Incremental induction of decision trees. Machine Learning, 4, 161-186.
    • (1989) Machine Learning , vol.4 , pp. 161-186
    • Utgoff, P.E.1
  • 20
    • 85152519885 scopus 로고
    • An improved algorithm for incremental induction of decision trees
    • New Brunswick, NJ: Morgan Kaufmann
    • Utgoff, P. E. (1994). An improved algorithm for incremental induction of decision trees. Machine Learning: Proceedings of the Eleventh International Conference (pp. 318-325). New Brunswick, NJ: Morgan Kaufmann.
    • (1994) Machine Learning: Proceedings of the Eleventh International Conference , pp. 318-325
    • Utgoff, P.E.1
  • 24
    • 0028443213 scopus 로고
    • Bias in information-based measures in decision tree induction
    • White, A. P., & Liu, W. Z. (1994). Bias in information-based measures in decision tree induction. Machine Learning, 15, 321-329.
    • (1994) Machine Learning , vol.15 , pp. 321-329
    • White, A.P.1    Liu, W.Z.2


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