Multi-Interval Discretization of Continuous-Valued Attributes for Constructing Incremental Decision Tree

증분 의사결정 트리 구축을 위한 연속형 속성의 다구간 이산화

  • Baek, Jun-Geol (Research Institute for Information and Communication Technologies, Korea University) ;
  • Kim, Chang-Ouk (Department of Industrial and Systems Engineering, Myongji University) ;
  • Kim, Sung-Shick (Department of Industrial Engineering, Korea University)
  • 백준걸 (고려대학교 정보통신기술공동연구소) ;
  • 김창욱 (명지대학교 산업시스템공학부) ;
  • 김성식 (고려대학교 산업공학과)
  • Received : 20010900
  • Accepted : 20011000
  • Published : 2001.12.31

Abstract

Since most real-world application data involve continuous-valued attributes, properly addressing the discretization process for constructing a decision tree is an important problem. A continuous-valued attribute is typically discretized during decision tree generation by partitioning its range into two intervals recursively. In this paper, by removing the restriction to the binary discretization, we present a hybrid multi-interval discretization algorithm for discretizing the range of continuous-valued attribute into multiple intervals. On the basis of experiment using semiconductor etching machine, it has been verified that our discretization algorithm constructs a more efficient incremental decision tree compared to previously proposed discretization algorithms.

Keywords