数据挖掘双语教学课件6asso幻灯片.ppt

* Data Mining: Concepts and Techniques * Constrain-Based Association Query Database: (1) trans (TID, Itemset ), (2) itemInfo (Item, Type, Price) A constrained asso. 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 * Data Mining: Concepts and Techniques * 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. Our approach: Comprehensive analysis of the properties of constraints and try to push them as deeply as possible inside the frequent set computation. * Data Mining: Concepts and Techniques * Anti-monotone and Monotone Constraints A constraint Ca is anti-monotone iff. for any pattern S not satisfying Ca, none of the super-patterns of S can satisfy Ca A constraint Cm is monotone iff. for any pattern S satisfying Cm, every super-pattern of S also satisfies it * Data Mining: Concepts and Techniques * Succinct Constraint A subset of item Is is a succinct set, if it can be expressed as ?p(I) for some selection predicate p, where ? is a selection operator SP?2I is a succinct power set, if there is a fixed number of succinct set I1, …, Ik ?I, s.t. SP can be expressed in terms of the strict power sets of I1, …, Ik using union and minus A constraint Cs is succ