第4章 关联规则_Apriori.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Rule Constraints in Association Mining Two kind of rule constraints: Rule form constraints: meta-rule guided mining. P(x, y) ^ Q(x, w) ? takes(x, “database systems”). Rule (content) constraint: constraint-based query optimization (Ng, et al., SIGMOD’98). sum(LHS) 100 ^ min(LHS) 20 ^ count(LHS) 3 ^ sum(RHS) 1000 1-variable vs. 2-variable constraints (Lakshmanan, et al. SIGMOD’99): 1-var: A constraint confining only one side (L/R) of the rule, e.g., as shown above. 2-var: A constraint confining both sides (L and R). sum(LHS) min(RHS) ^ max(RHS) 5* sum(LHS) Constraint-Based Association Query Database: (1) trans (TID, Itemset ), (2) itemInfo (Item, Type, Price) A constrained assoc. query (CAQ) is in the form of {(S1, S2 )|C }, where C is a set of constraints on S1, S2 including frequency constraint A classification of (single-variable) constraints: Class constraint: S ? A. e.g. S ? Item Domain constraint: S? v, ? ? { ?, ?, ?, ?, ?, ? }. e.g. S.Price 100 v? S, ? is ? or ?. e.g. snacks ? S.Type V? S, or S? V, ? ? { ?, ?, ?, ?, ? } e.g. {snacks, sodas } ? S.Type Aggregation constraint: agg(S) ? v, where agg is in {min, max, sum, count, avg}, and ? ? { ?, ?, ?, ?, ?, ? }. e.g. count(S1.Type) ? 1 , avg(S2.Price) ? 100 Constrained Association Query Optimization Problem Given a CAQ = { (S1, S2) | C }, the algorithm should be : sound: It only finds frequent sets that satisfy the given constraints C complete: All frequent sets satisfy the given constraints C are found A na?ve solution: Apply Apriori for finding all frequent sets, and then to test them for constraint satisfaction one by one. Other approach: Comprehensive analysis of the properties of constraints and try to push them as deeply as possible inside the frequent set computation. Anti-monotone and Monotone Constraints A constraint Ca is anti-monotone iff. for any patte