대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제33권2호
  • /
  • Pages.183-190
  • /
  • 2007
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

러프셋 이론과 개체 관계 비교를 통한 의사결정나무 구성

A New Decision Tree Algorithm Based on Rough Set and Entity Relationship

  • 한상욱 (한양대학교 산업공학과) ;
  • 김재련 (한양대학교 산업공학과)
  • Han, Sang-Wook (Department of Industrial Engineering, Hanyang University) ;
  • Kim, Jae-Yearn (Department of Industrial Engineering, Hanyang University)
  • 발행 : 2007.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We present a new decision tree classification algorithm using rough set theory that can induce classification rules, the construction of which is based on core attributes and relationship between objects. Although decision trees have been widely used in machine learning and artificial intelligence, little research has focused on improving classification quality. We propose a new decision tree construction algorithm that can be simplified and provides an improved classification quality. We also compare the new algorithm with the ID3 algorithm in terms of the number of rules.

키워드

참고문헌

  1. Bai, J., Fan, B., and Xue, J. (2003), Knowloedge representation and acquisition approach based on decision tree, Proc. 2003 Int. Conf on Natural Language Processing and Knowledge Engineering, 533-538
  2. Cover, T. M. (1974), The best two independent measurements are not the two best, IEEE Transactions on Systems, Man, and Cybernetics, 4, 116-117
  3. Cover, T. M. and Van Campenhout, J. M. (1977), On the possible orderings in the measurement selection problem, IEEE Trans. on Systems, Man, and Cybernetics, 7, 657-661 https://doi.org/10.1109/TSMC.1977.4309803
  4. Elashoff, J. D., Elashoff, R. M., and Goldman, G. E. (1967), On the choice of variables in classification problems with dichotomous variables, Biometrika, 54, 668-670 https://doi.org/10.1093/biomet/54.3-4.668
  5. Karno, B. (2001), Core searching on rough sets, 23rd Int. Conf. on Technology ITI, 19-22
  6. Pawlak, Z. (1982), Rough sets, International Journal of Computer and Information Science, 11(5),341-356 https://doi.org/10.1007/BF01001956
  7. Pawlak, Z. (1991), Rough sets, Kluwer academic publishers, 33-35
  8. Quinlan, J. R. (1986), Induction of decision trees, Machine Learning I, 81-106
  9. Quinlan, J. R. (1990), Decision trees and decision making, IEEE Transactions on Systems, Man and Cybernetics, 20, 339-346 https://doi.org/10.1109/21.52545
  10. Toussaint, G. T. (1971), Note on Optimal Selection of Independent Binary-Valued Features for Pattern Recognition, IEEE Transactions on Information Theory, IT-17, 618
  11. Tu, P.-L. and Chung, J.-Y. (1992), A new decision tree classification algorithm for machine learning, Proc. 4th Int. Conf. on Tools with Artificial Intelligence(TAI '92), 370-377
  12. Wei, J., Huang, D., Wang, S., and Ma, Z. (2002), Rough set Based Decision tree, Proc. 4th World Congress on Intelligent Control and Automation. 426-431
  13. Yang, J., Wang, H., and Hu, X. G. (2003), A new classification algorithm based on rough set and entropy, Int. Conf. Machine Learning and Cybernetics, 364-367
  14. Yang, Y. and Chiam, T. C. (2000), Rule discovery based on rough set theory, Proc. 3rd Int. Conf. on Information Fusion, 1, TUC4/11- TUC4/16