By Topic

An m-of-n rule induction algorithm and its application to DNA domain

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)
Kai Ming Ting ; Dept. of Comput. Sci., Sydney Univ., NSW, Australia

An m-of-n concept is a restricted form of the disjunctive normal form. The purpose of this paper is firstly to introduce a learning algorithm that induces m-of-n rules, and secondly to present the performance of this algorithm when applied to the DNA domain. This paper explores a search method for m-of-n concepts that gives rise to a rule induction algorithm called MoN. A pruning strategy akin to alpha-beta pruning is employed to reduce the search space encountered in the exhaustive search. A set of rules that consists of a disjunction of m-of-n concepts is used in MoN, as opposed to the disjunction of conjunctive rules normally used in rule induction algorithms. We show the application of this algorithm in inducing rules for primate splice-junction gene sequences (DNA) and compare the results obtained from C4.5 rules and ID2-of-3 concepts.<>

Published in:

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on  (Volume:5 )

Date of Conference:

4-7 Jan. 1994