200 likes | 375 Views
Mining negative rules using GRD. D. R. Thiruvady and G. I. Webb PAKDD 2004. Outline. Introduction OPUS GRD Conclusion. Introduction. Association rule A ==> B (A is antecedent ,B is consequent) Negative Rules Either antecedent or consequent or both are negated.
E N D
Mining negative rules using GRD D. R. Thiruvady and G. I. Webb PAKDD 2004
Outline • Introduction • OPUS • GRD • Conclusion
Introduction • Association rule • A ==> B (A is antecedent ,B is consequent) • Negative Rules • Either antecedent or consequent or both are negated
Generate Rule Discovery (GRD) • Extends OPUS by remove the requirement that consequent be single variable • K number of rules replace minimum support
GRD • Four measures with respect to a rule XY
GRD • Symbol
GRD • Symbol • CurrentLHS:Init ψ • AvailableLHS:Init Antecedent • AvailableRHS:Init Consequent • Function • Insolution(ac):rule ac in solution • Proven(X):pruning rules provided to the algorithm prove the proposition X
GRD algorithm Prune 1 Prune 2 Prune 3,4,5
GRD algorithm2 Prune 6
Conclusion • Disadvantage • Search space too large