《数据仓库与数据挖掘》第8章.pptxVIP

第6章: 关联规则挖掘;What Is Association Mining?;关联规则挖掘的基本概念 ;Why Is Frequent Pattern or Assoiciation Mining an Essential Task in Data Mining?;关联规则 ;置信度和支持度;关联规则挖掘;关联规则挖掘;关联规则挖掘的分类—基于变量的类别;关联规则挖掘的分类—基于抽象层次 ;关联规则挖掘的分类—基于数据的维数;关联规则挖掘的过程 ;Basic Concepts: Frequent Patterns and Association Rules;Mining Association Rules—an Example;Chapter 6: Mining Association Rules in Large Databases;Apriori: A Candidate Generation-and-test Approach;The Apriori Algorithm—An Example;The Apriori Algorithm;Important Details of Apriori;How to Generate Candidates?;How to Count Supports of Candidates?;Example: Counting Supports of Candidates;由频繁项集而产生关联规则 ;由频繁项集而产生关联规则;例子;Challenges of Frequent Pattern Mining;DIC: Reduce Number of Scans;Partition: Scan Database Only Twice;Sampling for Frequent Patterns;DHP: Reduce the Number of Candidates;Eclat/MaxEclat and VIPER: Exploring Vertical Data Format;Bottleneck of Frequent-pattern Mining;Mining Frequent Patterns Without Candidate Generation;Construct FP-tree from a Transaction Database;Benefits of the FP-tree Structure;Partition Patterns and Databases;Find Patterns Having P From P-conditional Database;From Conditional Pattern-bases to Conditional FP-trees ;Recursion: Mining Each Conditional FP-tree;A Special Case: Single Prefix Path in FP-tree;Mining Frequent Patterns With FP-trees;算法中文说明;Scaling FP-growth by DB Projection;Partition-based Projection;FP-Growth vs. Apriori: Scalability With the Support Threshold;FP-Growth vs. Tree-Projection: Scalability with the Support Threshold;Why Is FP-Growth the Winner?;Implications of the Methodology ;Max-patterns;MaxMiner: Mining Max-patterns;Frequent Closed Patterns;Mining Frequent Closed Patterns: CLOSET;Mining Frequent Closed Patterns: CHARM;Visualization of Association Rules: Pane Graph;Visualization of Association Rules: Rule Graph;Chapter 6: Mining Association Rules in Large Databases;Mining Various Kinds of Rules or Regularities;Multiple-level Association Rules;ML/MD Associations with Flexible Support Constraint