A discretization algorithm that keeps positive regions of all the decision classes

Authors:
Feng Honghai;Liu Baoyan;He LiYun;Yang Bingru;Li Yueli
Affiliations:
Hebei Agricultural University, Baoding, China;China Academy of Traditional Chinese Medicine, Beijing, China;China Academy of Traditional Chinese Medicine, Beijing, China;University of Science and Technology Beijing, Beijing, China;Hebei Agricultural University, Baoding, China
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Year:
2006

Citing 2
Cited 0

On the induction of decision trees for multiple concept learning

On the induction of decision trees for multiple concept learning
ChiMerge: discretization of numeric attributes

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the existing discretization methods such as k-interval discretization, equal width and equal frequency methods do not take the dependencies of decision attributes on condition attributes into account. In this paper, we propose a discretization algorithm that can keep the dependencies of the decision attribute on condition attributes, or keep the positive regions of the partition of the decision attribute. In the course of inducing classification rules from a data set, keeping these dependencies can achieve getting the set of the least condition attributes and the highest classification precision.