Decision Trees for Multiple Abstraction Levels of Data

  • Authors:
  • Doheon Lee;Mina Jeong;Yong-Kwan Won

  • Affiliations:
  • -;-;-

  • Venue:
  • CIA '01 Proceedings of the 5th International Workshop on Cooperative Information Agents V
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since the data is collected from disparate sources in many actual data mining environments, it is common to have data values in different abstraction levels. This paper shows that such multiple abstraction levels of data can cause undesirable effects in decision tree classification. After explaining that equalizing abstraction levels by force cannot provide satisfactory solutions of this problem, it presents a method to utilize the data as it is. The proposed method accommodates the generalization/specialization relationship between data values in both of the construction and the class assignment phases of decision tree classification. The experimental results show that the proposed method reduces classification error rates significantly when multiple abstraction levels of data are involved.