association rule mining - university of pittsburgh（关联规则挖掘,匹兹堡大学）.pdfVIP

Association Rule Mining • Association Rules and Frequent Patterns • Frequent Pattern Mining Algorithms – Apriori – FP-growth • Correlation Analysis • Constraint-based Mining • Using Frequent Patterns for Classification – Associative Classification (rule-based classification) – Frequent Pattern-based Classification Iyad Batal Association Rules • A Frequent pattern is a pattern (a set of items, subsequences, subgraphs, etc.) that occurs frequently in a data set. • Motivation: Finding inherent regularities (associations) in data. • Forms the foundation for many essential data mining tasks: – Association, correlation, and causality analysis – Classification: associative classification – Cluster analysis: frequent pattern-based clustering – … • First proposed by [AIS93] in the context of frequent itemsets and association rule mining for market basket analysis. • Extended to many different problems: graph mining, sequential pattern mining, times series pattern mining, text mining… Iyad Batal Association Rules • An item (I) is: – For market basket data: I is an item in the store, e.g. milk. – For relational data: I is an attribute-value pair (numeric attributes should be discretized), e.g. salary=high, gender=male. • Apattern (P) is a conjunction of items: P=I1 ∧I2 ∧… In (itemset) • A pattern defines a group (subpopulation) of instances. • Pattern P ′ is subpattern of P if P ′ ⊂P • A rule R is A ⇒B where A and B are disjoint patterns. • Support(A ⇒B)=P(A B) • Confidence(A ⇒B)=P(B|A)=posterior probability Iyad Batal Association Rules • Framework: find all the rules that satisfy both a minimum support (min_sup) and a minimum confidence (min_conf