Upload
lucinda-robinson
View
227
Download
2
Tags:
Embed Size (px)
Citation preview
Bab 5Bab 5Classification: Classification:
Alternative TechniquesAlternative Techniques
Part 1Part 1Rule-Based ClassiferRule-Based Classifer
Bab 5-1 - 2/34
Rule-Based Classifier
Classify records by using a collection of “if…then…” rules
Rule: (Condition) y– where
Condition is a conjunctions of attributes y is the class label
– LHS: rule antecedent or condition
– RHS: rule consequent
– Examples of classification rules: (Blood Type=Warm) (Lay Eggs=Yes) Birds (Taxable Income < 50K) (Refund=Yes) Evade=No
Bab 5-1 - 3/34
Rule-based Classifier (Example)
R1: (Give Birth = no) (Can Fly = yes) Birds
R2: (Give Birth = no) (Live in Water = yes) Fishes
R3: (Give Birth = yes) (Blood Type = warm) Mammals
R4: (Give Birth = no) (Can Fly = no) Reptiles
R5: (Live in Water = sometimes) Amphibians
Name Blood Type Give Birth Can Fly Live in Water Classhuman warm yes no no mammalspython cold no no no reptilessalmon cold no no yes fisheswhale warm yes no yes mammalsfrog cold no no sometimes amphibianskomodo cold no no no reptilesbat warm yes yes no mammalspigeon warm no yes no birdscat warm yes no no mammalsleopard shark cold yes no yes fishesturtle cold no no sometimes reptilespenguin warm no no sometimes birdsporcupine warm yes no no mammalseel cold no no yes fishessalamander cold no no sometimes amphibiansgila monster cold no no no reptilesplatypus warm no no no mammalsowl warm no yes no birdsdolphin warm yes no yes mammalseagle warm no yes no birds
Bab 5-1 - 4/34
Application of Rule-Based Classifier
A rule r covers an instance x if the attributes of the instance satisfy the condition of the rule
R1: (Give Birth = no) (Can Fly = yes) Birds
R2: (Give Birth = no) (Live in Water = yes) Fishes
R3: (Give Birth = yes) (Blood Type = warm) Mammals
R4: (Give Birth = no) (Can Fly = no) Reptiles
R5: (Live in Water = sometimes) Amphibians
The rule R1 covers a hawk => Bird
The rule R3 covers the grizzly bear => Mammal
Name Blood Type Give Birth Can Fly Live in Water Classhawk warm no yes no ?grizzly bear warm yes no no ?
Bab 5-1 - 5/34
Rule Coverage and Accuracy
Coverage of a rule:
– Fraction of records that satisfy the antecedent of a rule
Accuracy of a rule:
– Fraction of records that satisfy both the antecedent and consequent of a rule
Tid Refund Marital Status
Taxable Income Class
1 Yes Single 125K No
2 No Married 100K No
3 No Single 70K No
4 Yes Married 120K No
5 No Divorced 95K Yes
6 No Married 60K No
7 Yes Divorced 220K No
8 No Single 85K Yes
9 No Married 75K No
10 No Single 90K Yes 10
(Marital Status=Single) No
Coverage = 4/10 = 40% Accuracy = 2/4 = 50%
Bab 5-1 - 6/34
How does Rule-based Classifier Work?
R1: (Give Birth = no) (Can Fly = yes) Birds
R2: (Give Birth = no) (Live in Water = yes) Fishes
R3: (Give Birth = yes) (Blood Type = warm) Mammals
R4: (Give Birth = no) (Can Fly = no) Reptiles
R5: (Live in Water = sometimes) Amphibians
A lemur triggers rule R3, so it is classified as a mammal
A turtle triggers both R4 and R5
A dogfish shark triggers none of the rules
Name Blood Type Give Birth Can Fly Live in Water Classlemur warm yes no no ?turtle cold no no sometimes ?dogfish shark cold yes no yes ?
Bab 5-1 - 7/34
Characteristics of Rule-Based Classifier
Mutually exclusive rules
– Classifier contains mutually exclusive rules if the rules are independent of each other (no two rules or more are triggered by the same record)
– Every record is covered by at most one rule
Exhaustive rules
– Classifier has exhaustive coverage if there is a rule for every possible combination of attribute values
– Every record is covered by at least one rule
Bab 5-1 - 8/34
From Decision Trees To Rules
YESYESNONO
NONO
NONO
Yes No
{Married}{Single,
Divorced}
< 80K > 80K
Taxable Income
Marital Status
Refund
Classification Rules
(Refund=Yes) ==> No
(Refund=No, Marital Status={Single,Divorced},Taxable Income<80K) ==> No
(Refund=No, Marital Status={Single,Divorced},Taxable Income>80K) ==> Yes
(Refund=No, Marital Status={Married}) ==> No
Rules are mutually exclusive and exhaustive
Rule set contains as much information as the tree
Bab 5-1 - 9/34
Rules Can Be Simplified
YESYESNONO
NONO
NONO
Yes No
{Married}{Single,
Divorced}
< 80K > 80K
Taxable Income
Marital Status
Refund
Tid Refund Marital Status
Taxable Income Cheat
1 Yes Single 125K No
2 No Married 100K No
3 No Single 70K No
4 Yes Married 120K No
5 No Divorced 95K Yes
6 No Married 60K No
7 Yes Divorced 220K No
8 No Single 85K Yes
9 No Married 75K No
10 No Single 90K Yes 10
Initial Rule: (Refund=No) (Status=Married) No
Simplified Rule: (Status=Married) No
Bab 5-1 - 10/34
Effect of Rule Simplification
Rules are no longer mutually exclusive
– A record may trigger more than one rule
– Solution? Ordered rule set Unordered rule set – use voting schemes
Rules are no longer exhaustive
– A record may not trigger any rules
– Solution? Use a default class
Bab 5-1 - 11/34
Ordered Rule Set
Rules are rank ordered according to their priority– An ordered rule set is known as a decision list
When a test record is presented to the classifier – It is assigned to the class label of the highest ranked rule it has
triggered
– If none of the rules fired, it is assigned to the default class
R1: (Give Birth = no) (Can Fly = yes) Birds
R2: (Give Birth = no) (Live in Water = yes) Fishes
R3: (Give Birth = yes) (Blood Type = warm) Mammals
R4: (Give Birth = no) (Can Fly = no) Reptiles
R5: (Live in Water = sometimes) Amphibians
Name Blood Type Give Birth Can Fly Live in Water Classturtle cold no no sometimes ?
Bab 5-1 - 12/34
Rule Ordering Schemes
Rule-based ordering– Individual rules are ranked based on their quality
Class-based ordering– Rules that belong to the same class appear together
Rule-based Ordering
(Refund=Yes) ==> No
(Refund=No, Marital Status={Single,Divorced},Taxable Income<80K) ==> No
(Refund=No, Marital Status={Single,Divorced},Taxable Income>80K) ==> Yes
(Refund=No, Marital Status={Married}) ==> No
Class-based Ordering
(Refund=Yes) ==> No
(Refund=No, Marital Status={Single,Divorced},Taxable Income<80K) ==> No
(Refund=No, Marital Status={Married}) ==> No
(Refund=No, Marital Status={Single,Divorced},Taxable Income>80K) ==> Yes
Bab 5-1 - 13/34
Building Classification Rules
Direct Method: Extract rules directly from data e.g.: RIPPER, CN2, Holte’s 1R
Indirect Method: Extract rules from other classification models (e.g. decision trees, neural networks, etc). e.g: C4.5rules
Bab 5-1 - 14/34
Direct Method: Sequential Covering
Bab 5-1 - 15/34
Example of Sequential Covering / 1
(i) Original Data (ii) Step 1
Bab 5-1 - 16/34
Example of Sequential Covering / 2
(iii) Step 2
R1
(iv) Step 3
R1
R2
Bab 5-1 - 17/34
Aspects of Sequential Covering
Rule Growing
Instance Elimination
Rule Evaluation
Stopping Criterion
Rule Pruning
Bab 5-1 - 18/34
Rule Growing
Two common strategies
Status =Single
Status =Divorced
Status =Married
Income> 80K...
Yes: 3No: 4{ }
Yes: 0No: 3
Refund=No
Yes: 3No: 4
Yes: 2No: 1
Yes: 1No: 0
Yes: 3No: 1
(a) General-to-specific
Refund=No,Status=Single,Income=85K(Class=Yes)
Refund=No,Status=Single,Income=90K(Class=Yes)
Refund=No,Status = Single(Class = Yes)
(b) Specific-to-general
Bab 5-1 - 19/34
Rule Growing (Examples)
CN2 Algorithm:– Start from an empty conjunct: {}– Add conjuncts that minimizes the entropy measure: {A}, {A,B}, …– Determine the rule consequent by taking majority class of instances
covered by the rule
RIPPER Algorithm:– Start from an empty rule: {} => class– Add conjuncts that maximizes FOIL’s information gain measure:
R0: {} => class (initial rule) R1: {A} => class (rule after adding conjunct) Gain(R0, R1) = t [ log (p1/(p1+n1)) – log (p0/(p0 + n0)) ] where t: number of positive instances covered by both R0 and R1
p0: number of positive instances covered by R0
n0: number of negative instances covered by R0
p1: number of positive instances covered by R1
n1: number of negative instances covered by R1
Bab 5-1 - 20/34
Instance Elimination
Why do we need to eliminate instances?
– Otherwise, the next rule is identical to previous rule
Why do we remove positive instances?
– Ensure that the next rule is different
– Prevent overestimating accuracy of rule
Why do we remove negative instances?
– Prevent underestimating accuracy of rule
– Compare rules R2 and R3 in the diagram
class = +
class = -
+
+ +
++
++
+
++
+
+
+
+
+
+
++
+
+
-
-
--
- --
--
- -
-
-
-
-
--
-
-
-
-
+
+
++
+
+
+
R1
R3 R2
+
+
Bab 5-1 - 21/34
Rule Evaluation
Metrics:– Accuracy
– Laplace
– m-estimate
– FOIL’s information gain (as shown as part of RIPPER algorithm) takes into account the support of the rule
kn
nc
1
kn
kpnc
n : Number of instances covered by rule
nc : Number of positive instances covered by rule
k : Number of classes
p : Prior probability of positive instances
n
nc
Laplace & m-estimates take into account the rule coverage
Bab 5-1 - 22/34
Stopping Criterion and Rule Pruning
Stopping criterion– Compute the gain– If gain is not significant, discard the new rule
Rule Pruning– Similar to post-pruning of decision trees– Reduced Error Pruning:
Remove one of the conjuncts in the rule Compare error rate on validation set before and
after pruning If error improves, prune the conjunct
Bab 5-1 - 23/34
Summary of Direct Method
Initial rule set is empty
Repeat
– Grow a single rule
– Remove Instances from rule
– Prune the rule (if necessary)
– Add rule to Current Rule Set
Bab 5-1 - 24/34
Direct Method: RIPPER / 1
For 2-class problem, choose one of the classes as positive class, and the other as negative class
– Learn rules for positive class
– Negative class will be default class For multi-class problem
– Order the classes according to increasing class prevalence (fraction of instances that belong to a particular class)
– Learn the rule set for smallest class first, treat the rest as negative class
– Repeat with next smallest class as positive class
Bab 5-1 - 25/34
Direct Method: RIPPER / 2
Growing a rule:– Start from empty rule– Add conjuncts as long as they improve FOIL’s
information gain– Stop when rule no longer covers negative examples– Prune the rule immediately using incremental reduced
error pruning– Measure for pruning: v = (p-n)/(p+n)
p: number of positive examples covered by the rule in the validation set n: number of negative examples covered by the rule in the validation set
– Pruning method: delete any final sequence of conditions that maximizes v
Bab 5-1 - 26/34
Direct Method: RIPPER / 3
Building a Rule Set:
– Use sequential covering algorithm Finds the best rule that covers the current set of
positive examples Eliminate both positive and negative examples
covered by the rule
– Each time a rule is added to the rule set, compute the new description length stop adding new rules when the new description
length is d bits longer than the smallest description length obtained so far
Bab 5-1 - 27/34
Direct Method: RIPPER / 4
Optimize the rule set:
– For each rule r in the rule set R Consider 2 alternative rules:
– Replacement rule (r*): grow new rule from scratch– Revised rule(r’): add conjuncts to extend the rule r
Compare the rule set for r against the rule set for r*
and r’ Choose rule set that minimizes MDL principle
– Repeat rule generation and rule optimization for the remaining positive examples
Bab 5-1 - 28/34
Indirect Methods
Rule Set
r1: (P=No,Q=No) ==> -r2: (P=No,Q=Yes) ==> +r3: (P=Yes,R=No) ==> +r4: (P=Yes,R=Yes,Q=No) ==> -r5: (P=Yes,R=Yes,Q=Yes) ==> +
P
Q R
Q- + +
- +
No No
No
Yes Yes
Yes
No Yes
Bab 5-1 - 29/34
Indirect Method: C4.5rules / 1
Extract rules from an unpruned decision tree For each rule, r: A y,
– consider an alternative rule r’: A’ y, where A’ is obtained by removing one of the conjuncts in A
– Compare the pessimistic error rate for r against all r’s
– Prune if one of the r’s has lower pessimistic error rate
– Repeat until we can no longer improve generalization error
Bab 5-1 - 30/34
Indirect Method: C4.5rules / 2
Instead of ordering the rules, order subsets of rules (class ordering)
– Each subset is a collection of rules with the same rule consequent (class)
– Compute description length of each subset Description length = L(error) + g L(model) g is a parameter that takes into account the
presence of redundant attributes in a rule set (default value = 0.5)
Bab 5-1 - 31/34
Example
Name Give Birth Lay Eggs Can Fly Live in Water Have Legs Class
human yes no no no yes mammalspython no yes no no no reptilessalmon no yes no yes no fisheswhale yes no no yes no mammalsfrog no yes no sometimes yes amphibianskomodo no yes no no yes reptilesbat yes no yes no yes mammalspigeon no yes yes no yes birdscat yes no no no yes mammalsleopard shark yes no no yes no fishesturtle no yes no sometimes yes reptilespenguin no yes no sometimes yes birdsporcupine yes no no no yes mammalseel no yes no yes no fishessalamander no yes no sometimes yes amphibiansgila monster no yes no no yes reptilesplatypus no yes no no yes mammalsowl no yes yes no yes birdsdolphin yes no no yes no mammalseagle no yes yes no yes birds
Bab 5-1 - 32/34
C4.5 & C4.5rules vs. RIPPER / 1
C4.5rules:
(Give Birth=No, Can Fly=Yes) Birds
(Give Birth=No, Live in Water=Yes) Fishes
(Give Birth=Yes) Mammals
(Give Birth=No, Can Fly=No, Live in Water=No) Reptiles
( ) Amphibians
GiveBirth?
Live InWater?
CanFly?
Mammals
Fishes Amphibians
Birds Reptiles
Yes No
Yes
Sometimes
No
Yes No
RIPPER:
(Live in Water=Yes) Fishes
(Have Legs=No) Reptiles
(Give Birth=No, Can Fly=No, Live In Water=No)
Reptiles
(Can Fly=Yes,Give Birth=No) Birds
() Mammals
Bab 5-1 - 33/34
C4.5 & C4.5rules vs. RIPPER / 2
PREDICTED CLASS Amphibians Fishes Reptiles Birds MammalsACTUAL Amphibians 0 0 0 0 2CLASS Fishes 0 3 0 0 0
Reptiles 0 0 3 0 1Birds 0 0 1 2 1Mammals 0 2 1 0 4
PREDICTED CLASS Amphibians Fishes Reptiles Birds MammalsACTUAL Amphibians 2 0 0 0 0CLASS Fishes 0 2 0 0 1
Reptiles 1 0 3 0 0Birds 1 0 0 3 0Mammals 0 0 1 0 6
C4.5 and C4.5rules:
RIPPER:
Bab 5-1 - 34/34
Advantages of Rule-Based Classifiers
As highly expressive as decision trees Easy to interpret Easy to generate Can classify new instances rapidly Performance comparable to decision trees