Scribd
Upload
16 views

Data Mining - Rule Based Classification

Uploaded by

Sajid Bhatt
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Data Mining - Rule Based Classification

Uploaded by

Sajid Bhatt
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

 Home  Coding Ground ☀

 

Data Mining - Rule Based


Classification

Advertisement

 Previous Page Next Page 

IF-THEN Rules
Rule-based classi;er makes use of a set of IF-THEN
rules for classi;cation. We can express a rule in the
following from −

IF condition THEN conclusion

Let us consider a rule R1,

R1: IF age = youth AND student = yes


THEN buy_computer = yes

Points to remember −

The IF part of the rule is called rule


antecedent or precondition
precondition.

The THEN part of the rule is called rule


consequent
consequent.

The antecedent part the condition consist of


one or more attribute tests and these tests are
logically ANDed.

The consequent part consists of class


prediction.

Note − We can also write rule R1 as follows −

R1: (age = youth) ^ (student = yes))(buys c

If the condition holds true for a given tuple, then the


antecedent is satis;ed.

Rule Extraction
Here we will learn how to build a rule-based
classi;er by extracting IF-THEN rules from a
decision tree.

Points to remember −

To extract a rule from a decision tree −

One rule is created for each path from the root


to the leaf node.

To form a rule antecedent, each splitting


criterion is logically ANDed.

The leaf node holds the class prediction,


forming the rule consequent.

Rule Induction Using Sequential


Covering Algorithm
Sequential Covering Algorithm can be used to
extract IF-THEN rules form the training data. We do
not require to generate a decision tree ;rst. In this
algorithm, each rule for a given class covers many of
the tuples of that class.

Some of the sequential Covering Algorithms are AQ,


CN2, and RIPPER. As per the general strategy the
rules are learned one at a time. For each time rules
are learned, a tuple covered by the rule is removed
and the process continues for the rest of the tuples.
This is because the path to each leaf in a decision
tree corresponds to a rule.

Note − The Decision tree induction can be


considered as learning a set of rules simultaneously.

The Following is the sequential learning Algorithm


where rules are learned for one class at a time.
When learning a rule from a class Ci, we want the
rule to cover all the tuples from class C only and no
tuple form any other class.

Algorithm: Sequential Covering

Input:
D, a data set class-labeled tuples,
Att_vals, the set of all attributes and the

Output: A Set of IF-THEN rules.


Method:
Rule_set={ }; // initial set of rules learn

for each class c do

repeat
Rule = Learn_One_Rule(D, Att_valls, c
remove tuples covered by Rule form D;
until termination condition;

Rule_set=Rule_set+Rule; // add a new rul


end for
return Rule_Set;

Rule Pruning
The rule is pruned is due to the following reason −

The Assessment of quality is made on the


original set of training data. The rule may
perform well on training data but less well on
subsequent data. That's why the rule pruning is
required.

The rule is pruned by removing conjunct. The


rule R is pruned, if pruned version of R has
greater quality than what was assessed on an
independent set of tuples.

FOIL is one of the simple and effective method for


rule pruning. For a given rule R,

FOIL_Prune = pos - neg / pos + neg

where pos and neg is the number of positive tuples


covered by R, respectively.

Note − This value will increase with the accuracy of


R on the pruning set. Hence, if the FOIL_Prune value
is higher for the pruned version of R, then we prune
R.

 Previous Page Next Page 

Advertisements

Advertisement

Annual Membership
Enjoy unlimited access on 5500+
Hand Picked Quality Video
Courses

✓ Subscribe Now

Training for a Team


Affordable solution to train a team
and make them project ready.

✓ Request a Demo

& About us ✓ Refund Policy ✓ Terms of use

 Privacy Policy  FAQ's  Contact

© Copyright 2023. All Rights Reserved.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy