1 / 50

Chapter 8: Introduction to Pattern Discovery

Chapter 8: Introduction to Pattern Discovery. Chapter 8: Introduction to Pattern Discovery. Pattern Discovery. The Essence of Data Mining? “…the discovery of interesting, unexpected, or valuable structures in large data sets.” – David Hand. Pattern Discovery. The Essence of Data Mining?

nigel-horn
Télécharger la présentation

Chapter 8: Introduction to Pattern Discovery

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 8: Introduction to Pattern Discovery

  2. Chapter 8: Introduction to Pattern Discovery

  3. Pattern Discovery The Essence of Data Mining? “…the discovery of interesting, unexpected, or valuable structures in large data sets.” – David Hand ...

  4. Pattern Discovery The Essence of Data Mining? “…the discovery of interesting, unexpected, or valuable structures in large data sets.” – David Hand “If you’ve got terabytes of data, and you’re relying on data mining to find interesting things in there for you, you’ve lost before you’ve even begun.” – Herb Edelstein

  5. Pattern Discovery Caution • Poor data quality • Opportunity • Interventions • Separability • Obviousness • Non-stationarity

  6. Pattern Discovery Applications Data reduction Novelty detection Profiling Market basket analysis Sequence analysis C A B ...

  7. Pattern Discovery Tools Data reduction Novelty detection Profiling Market basket analysis Sequence analysis C A B ...

  8. Pattern Discovery Tools Data reduction Novelty detection Profiling Market basket analysis Sequence analysis C A B

  9. Chapter 8: Introduction to Pattern Discovery

  10. Unsupervised Classification cluster 1 Unsupervised classification: grouping of cases based on similarities in input values. cluster 2 cluster 3 cluster 1 cluster 2 inputs grouping ...

  11. Unsupervised Classification cluster 1 Unsupervised classification: grouping of cases based on similarities in input values. cluster 2 cluster 3 cluster 1 cluster 2 inputs grouping ...

  12. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Re-assign cases. 6. Repeat steps 4 and 5 until convergence.

  13. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Re-assign cases. 6. Repeat steps 4 and 5 until convergence.

  14. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  15. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  16. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  17. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  18. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  19. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  20. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  21. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  22. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  23. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  24. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  25. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  26. k-means Clustering Algorithm Training Data 1. Select inputs. 2. Select k cluster centers. 3. Assign cases to closest center. 4. Update cluster centers. 5. Reassign cases. 6. Repeat steps 4 and 5 until convergence. ...

  27. Segmentation Analysis Training Data When no clusters exist, use the k-means algorithm to partition cases into contiguous groups.

  28. 8.01 Multiple Choice Poll • For a k-means clustering analysis, which of the following statements is true about input variables? • Input variables should be limited in number and be relatively independent. • Input variables should be of interval measurement level. • Input variables should have distributions that are somewhat symmetric. • Input variables should be meaningful to analysis objectives. • All of the above.

  29. 8.01 Multiple Choice Poll – Correct Answer • For a k-means clustering analysis, which of the following statements is true about input variables? • Input variables should be limited in number and be relatively independent. • Input variables should be of interval measurement level. • Input variables should have distributions that are somewhat symmetric. • Input variables should be meaningful to analysis objectives. • All of the above.

  30. Demographic Segmentation Demonstration Analysis goal: Group geographic regions into segments based on: income, household size, and population density. Analysis plan: • Select and transform segmentation inputs. • Select the number of segments to create. • Create segments with the Cluster tool. • Interpret the segments.

  31. Segmenting Census Data This demonstration introduces SAS Enterprise Miner tools and techniques for cluster and segmentation analysis.

  32. Exploring and Filtering Analysis Data This demonstration introduces SAS Enterprise Miner tools and techniques that explore and filteranalysis data, particularly data source exploration and case filtering.

  33. Setting Cluster Tool Options This demonstration illustrates how to use the Cluster tool to segment the cases in the CENSUS2000 data set.

  34. Creating Clusters with the Cluster Tool This demonstration illustrates how the Cluster tool determines the number of clusters in the data.

  35. Specifying the Segment Count This demonstration illustrates how you can change the number of clusters created by the Cluster node.

  36. Exploring Segments This demonstration illustrates how to use graphical aids to explore the segments.

  37. Profiling Segments This demonstration illustrates using the Segment Profile tool to interpret the composition of clusters.

  38. Exercises This exercise reinforces the concepts discussed previously.

  39. Chapter 8: Introduction to Pattern Discovery

  40. Market Basket Analysis A A B A B B C C C D C D D E E Rule A  D C  A A  C B & C  D Support 2/5 2/5 2/5 1/5 Confidence 2/3 2/4 2/3 1/3 ...

  41. Market Basket Analysis A A B A B B C C C D C D D E E Rule A  D C  A A  C B & C  D Support 2/5 2/5 2/5 1/5 Confidence 2/3 2/4 2/3 1/3 ...

  42. Implication? Support(SVG  CK) = 50% Confidence(SVG  CK) = 83% Expected Confidence(SVG  CK) = 85% Lift(SVG  CK) = 0.83/0.85 < 1 Checking Account No Yes 3500 5000 1000 500 4,000 No Savings Account 6,000 Yes 10,000

  43. Barbie Doll  Candy Put them closer together in the store. Put them far apart in the store. Package candy bars with the dolls. Package Barbie + candy + poorly selling item. Raise the price on one, and lower it on the other. Offer Barbie accessories for proofs of purchase. Do not advertise candy and Barbie together. Offer candies in the shape of a Barbie doll.

  44. Data Capacity A A B A C D A A B A D B

  45. Association Tool Demonstration Analysis goal: Explore associations between retail banking services used by customers. Analysis plan: • Create an association data source. • Run an association analysis. • Interpret the association rules. • Run a sequence analysis. • Interpret the sequence rules.

  46. Market Basket Analysis This demonstration illustrates how to conduct market basket analysis.

  47. Sequence Analysis This demonstration illustrates how to conduct a sequence analysis.

  48. Exercise This exercise reinforces the concepts discussed previously.

  49. Pattern Discovery Tools: Review Generate cluster models using automatic settings and segmentation models with user-defined settings. Compare within-segment distributions ofselected inputs to overall distributions. Thishelps you understand segment definition. Conduct market basket and sequence analysis on transactions data. A data source must have one target, one ID, and (if desired) one sequence variable in the data source.

More Related