Finding frequent patterns from data
published: Feb. 25, 2007, recorded: October 2005, views: 9251
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.
Discovery of frequent patterns = finding positive conjunctions that are true for a given fraction of the observations - this basic idea can be instantiated in many ways: - finding frequent sets from 0/1 data (association mining) - finding frequent episodes in sequences - finding frequent subgraphs in graphs etc. - efficient algorithms exist -- the levelwise approach - theoretical analysis of the algorithms is not trivial - leads to connections to hypergraph transversals etc. - the second part: how can the patterns be used? - sometimes interesting in themselves - can be used to approximate the joint distribution - maximum entropy approaches - combining information from several patterns - ordering patterns
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !