Skip to document

Data mining ch5

Summaries of Data mining chapter 5
Course

Data Mining

91 Documents
Students shared 91 documents in this course
Academic year: 2021/2022
Uploaded by:
28Uploads
41upvotes

Comments

Please sign in or register to post comments.

Related Studylists

zelalem simon

Preview text

  1. Frequent pattern: a pattern that occurs frequently in a data set.

  2. First proposed by Agrawal, Imielinski, and Swami [AIS93] in the context of frequent itemset and association rule mining.

  3. Applications of Frequent pattern: Basket data analysis, cross-marketing, catalog design, sale campaign analysis, Web log analysis, and DNA sequence analysis.

  4. Frequent Patterns and Association Rules

  5. An itemset X is closed if X is frequent and there exists no super-pattern Y כ X, with the same support as X.

  6. An itemset X is a max-pattern if X is frequent and there exists no frequent super-pattern Y כ X.

  7. Apriori pruning principle: If there is any itemset which is infrequent, its superset should not be generated.

  8. Apriori Algorithm example

  9. Challenges of Frequent Pattern Mining:

    • Multiple scans of transaction database
    • Huge number of candidates
    • Tedious workload of support counting for candidates 10 Apriori:
    • Scan Database Only Twice.
    • Reduce the Number of Candidates.
    • Sampling for Frequent Patterns.
    • Reduce Number of Scans. 11 of Frequent-pattern Mining: candidate-generation-and-test. 12 of the FP-tree Structure:
    • Completeness
    • Compactness
Was this document helpful?

Data mining ch5

Course: Data Mining

91 Documents
Students shared 91 documents in this course

University: Assiut University

Was this document helpful?
1. Frequent pattern: a pattern that occurs frequently in a data set.
2. First proposed by Agrawal, Imielinski, and Swami [AIS93] in the context of frequent
itemset and association rule mining.
3. Applications of Frequent pattern:
Basket data analysis, cross-marketing, catalog design, sale campaign analysis, Web log
analysis, and DNA sequence analysis.
4. Frequent Patterns and Association Rules
5. An itemset X is closed if X is frequent and there exists no super-pattern Y כ X, with the
same support as X.
6. An itemset X is a max-pattern if X is frequent and there exists no frequent super-pattern
Y כ X.
7. Apriori pruning principle: If there is any itemset which is infrequent, its superset should
not be generated.
8. Apriori Algorithm example