关联规则-智能科学与人工智能.PPT

* * * * * * * * * * * * * t is representing bought tea and c represents bought coffee * So we have a negative correlation, but is this significant? 1 negative correlation 1 positive correlation * The overbar represents that an item is not present. The subscripted r’s are representing the presence/absence of items in a rule. * i(I1,I2 - I5) = (2/9)/( (4/9) * (2/9) ) A problem is that it is symmetric. * c(I1,I2-I5)=(4/9)(7/9) / (2/9) * In your opening, establish the relevancy of the topic to the audience. Give a brief preview of the presentation and establish value for the listeners. Take into account your audience’s interest and expertise in the topic when choosing your vocabulary, examples, and illustrations. Focus on the importance of the topic to your audience, and you will have more attentive listeners. * * * * * * * * * * * 史忠植 关联规则 * MOUCLAS Assumption: MOUCLAS algorithm assumes that the initial association rules can be agglomerated into clustering regions The implication of the form of the Mouclas Pattern (so called MP) : Cluster(D)t ? y where Cluster(D)t is a cluster of D, t = 1 to m, and y is a class label. * 史忠植 关联规则 * MOUCLAS Definitions: Frequency of Mouclas Patterns Accuracy of Mouclas Patterns Reliability of Mouclas Patterns Task of Mouclas: To discover MPs that have support and confidence greater than the user-specified minimum support threshold (called minsup), and minimum confidence threshold (called minconf) and minimum reliability threshold (called minR) respectively, and to construct a classifier based upon MPs. * 史忠植 关联规则 * The MOUCLAS algorithm Two steps: Step 1. Discovery of the frequent and accurate and reliable MPs. Step 2. Construction of a classifier, called De-MP, based on MPs. * 史忠植 关联规则 * The MOUCLAS algorithm The core of the first step in the Mouclas algorithm is to find all cluster_rules that satisfy minsup and minconf and minR. Let C denote the dataset D after dimensio