Cart (Loading....) | Create Account
Close category search window
 

Fast convert OR-decision table to decision tree

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

2 Author(s)
Sutheebanjard, P. ; Grad. Sch. of Inf. Technol., Siam Univ., Bangkok, Thailand ; Premchaiswadi, W.

Recently a new type of decision table has been proposed, OR-decision table. The idea of the OR-decision table is one in which any of the actions in the set may be performed in order to satisfy the corresponding condition, while the classical decision table requires the execution of all the actions in the set of actions (AND-decision table). Due to the characteristic of the OR-decision table, this paper proposes the fast OR-decision table conversion to a decision tree algorithm.

Published in:

Knowledge Engineering, 2010 8th International Conference on ICT and

Date of Conference:

24-25 Nov. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.