Statistically Sound Pattern Discovery
author: Wilhelmiina Hämäläinen, School of Computing, University of Eastern Finland
published: Oct. 7, 2014, recorded: August 2014, views: 4958
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Pattern discovery is a core data mining activity. Initial approaches were dominated by the frequent pattern discovery paradigm | only frequent patterns were explored. Having been thoroughly researched and its limitations now well understood, this paradigm is giving way to two emerging alternatives - the information theoretic minimum message length paradigm and the statistically sound paradigm. This tutorial covers the latter. In this paradigm, patterns are required to pass statistical tests with respect to user defined null-hypotheses, providing great flexibility about the properties that are sought, and strict control over the risk of false discoveries and overfitting. We cover the theoretical foundations, practical issues, limitations and future directions of this growing area of research, as well as explore in detail how this approach to pattern discovery resolves many of the limitations of the frequent pattern discovery paradigm and can deliver efficient and effective discovery of small sets of interesting patterns.
Download slides: kdd2014_hamalainen_webb_discovery.pdf (1.7 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !
Write your own review or comment: