By Topic

Neural implementation of tree classifiers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sethi, I.K. ; Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA

Tree classifiers represent a popular non-parametric classification methodology that has been successfully used in many pattern recognition and learning tasks. However, “is feature-value⩾thrsh” type of tests used in tree classifiers are often found sensitive to noise and minor variations in the data. This has led to the use of soft thresholding in decision trees. Following the decision tree to feedforward neural network mapping of the entropy net, three neural implementation schemes for tree classifiers, that allow soft thresholding, are presented in this paper. Results of several experiments using well-known data sets are described to compare the performance of the proposed implementations with respect to decision trees with hard thresholding

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 8 )