Scribd Logo
Upload

Welcome to Scribd!

  • Ch9 Apriori

    Uploaded by

    the end
    0 views21 pages
    The document describes the Apriori algorithm for finding frequent itemsets in a transactional database. It shows an example database with four transactions over five items. The algorithm performs multiple scans of the database. The first scan finds all frequent 1-itemsets. The second scan uses these to find frequent 2-itemsets, and the third scan finds the only frequent 3-itemset.

    Original Description:

    Original Title

    Ch9-Apriori

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the Apriori algorithm for finding frequent itemsets in a transactional database. It shows an example database with four transactions over five items. The algorithm performs multiple scans of the database. The first scan finds all frequent 1-itemsets. The second scan uses these to find frequent 2-itemsets, and the third scan finds the only frequent 3-itemset.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    0 views21 pages

    Ch9 Apriori

    Uploaded by

    the end
    The document describes the Apriori algorithm for finding frequent itemsets in a transactional database. It shows an example database with four transactions over five items. The algorithm performs multiple scans of the database. The first scan finds all frequent 1-itemsets. The second scan uses these to find frequent 2-itemsets, and the third scan finds the only frequent 3-itemset.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 21

    The Apriori Algorithm—An Example

    Supmin = 2 Itemset sup


    Itemset sup
    Database TDB {A} 2
    L1 {A} 2
    Tid Items C1 {B} 3
    {B} 3
    10 A, C, D {C} 3
    1st scan {C} 3
    20 B, C, E {D} 1
    {E} 3
    30 A, B, C, E {E} 3
    40 B, E
    C2 Itemset sup C2 Itemset
    {A, B} 1
    L2 Itemset sup
    {A, C} 2 2nd scan {A, B}
    {A, C} 2 {A, C}
    {A, E} 1
    {B, C} 2 {A, E}
    {B, C} 2
    {B, E} 3
    {B, E} 3 {B, C}
    {C, E} 2
    {C, E} 2 {B, E}
    {C, E}

    C3 Itemset
    3rd scan L3 Itemset sup
    {B, C, E} {B, C, E} 2
    7
    Book: Data Mining Concepts and Techniques
    **Testing a rule

    You might also like