single-jc.php

JACIII Vol.8 No.3 pp. 332-335
doi: 10.20965/jaciii.2004.p0332
(2004)

Paper:

Novel Approach to Decision-Tree Construction

Wei Jin-Mao, Wang Shu-Qin, and Wang Ming-Yang

Research Institute of Computational Intelligence, School of Physics, Northeast Normal University, Changchun, Jilin, P. R. China, 130024

Received:
February 14, 2003
Accepted:
March 2, 2004
Published:
May 20, 2004
Keywords:
machine learning, rough set, decision tree, information retrieval
Abstract

A new approach is presented, in which rough set theory is applied to select attributes as nodes of a decision tree. Initially, dataset is partitioned into subsets based on different condition attributes, then an attribute is chosen as a node for branching when the size of its corresponding implicit region is smaller than that of all other attributes. This approach is compared to the entropy-based method on some datasets from the UCI Machine Learning Database Repository, which instantiates the performance of the rough set approach. Statistical experiments showed that the proposed approach is feasible for decision-tree construction.

Cite this article as:
Wei Jin-Mao, Wang Shu-Qin, and Wang Ming-Yang, “Novel Approach to Decision-Tree Construction,” J. Adv. Comput. Intell. Intell. Inform., Vol.8, No.3, pp. 332-335, 2004.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Mar. 05, 2021