Machine Learning: Pattern Mining
|
|
- Barnaby Dale Owen
- 6 years ago
- Views:
Transcription
1 Machine Learning: Pattern Mining Information Systems and Machine Learning Lab (ISMLL) University of Hildesheim Wintersemester 2007 / 2008
2 Pattern Mining Overview Itemsets Task Naive Algorithm Apriori Algorithm Data Structure Eclat Algorithm Association Rules Task Algorithm Summary
3 Overview Pattern Mining discovers regularities in data. Example: a transaction database of a supermarket: someone who buys chips also buys beer. Frequent patterns are found by counting the occurences in the data base. Types of patterns: itemsets, association rules, sequences,...
4 Example Shopping Carts Beer, Chips, Chocolate, Cookies Coke, Beer, Pizza, Chips Salad, Noodles, Tomatoes, Water Lasagne, Coke, Beer, Chips Oranges, Apple Juice, Rice, Cabbage, Sausage Diapers, Beer, Charcoal, Sausage Beer, Cabbage, Sausage, Chips...
5 Example Shopping Carts Beer, Chips, Chocolate, Cookies Coke, Beer, Pizza, Chips Salad, Noodles, Tomatoes, Water Lasagne, Coke, Beer, Chips Oranges, Apple Juice, Rice, Cabbage, Sausage Diapers, Beer, Charcoal, Sausage Beer, Cabbage, Sausage, Chips... Observations: Many customers buy beer. Beer and chips are often bought together. Customers who buy cabbage also buy sausage. Customers who buy something to eat also buy something to drink.
6 Outline Classification predicts class labels based on training data Clustering groups data based on similarity Pattern Mining discovers regularities in data
7 Itemsets Which itemsets frequently occur in the same transaction? Example: chips and beer are frequently bought together given Items I = {ii,..., i m } Data D P(I ) multiset Frequency threshold θ s to find Frequent sets L = {X P(I ) supportd (X ) θ s }
8 Definitions and Terms support D (X ) = {d D X d} D X is frequent / large iff support D (X ) θ s
9 Naive Algorithm function Naive(D, θ s ) L for all X P(I ) do if support D (X ) θ s then L L {X } end if end for return L end function
10 Example Data D,e a,,e a,b,d,e,d a, find itemsets with θ s 0.3 X frequent # D (X ) > 2
11 Example Data D,e a,,e a,b,d,e,d a, P(I ) # a? b? c? d? e? a,b?? a,d? a,e?? b,d? b,e? c,d? c,e? P(I ) # d,e? a,? a,b,d??,d?,e? c,d,e? a,,d? a,,e? a,b,d,e?,d,e?,d,e? a,,d,e?
12 Example Data D,e a,,e a,b,d,e,d a, P(I ) # a 7 b 7 c 6 d 2 e 5 a,b 5 4 a,d 1 a,e 5 4 b,d 2 b,e 4 c,d 1 c,e 2 P(I ) # d,e 1 a, 2 a,b,d 1 4,d 1,e 1 c,d,e 0 a,,d 0 a,,e 1 a,b,d,e 1,d,e 0,d,e 0 a,,d,e 0
13 Example Data D,e a,,e a,b,d,e,d a, P(I ) # a 7 b 7 c 6 d 2 e 5 a,b 5 4 a,d 1 a,e 5 4 b,d 2 b,e 4 c,d 1 c,e 2 P(I ) # d,e 1 a, 2 a,b,d 1 4,d 1,e 1 c,d,e 0 a,,d 0 a,,e 1 a,b,d,e 1,d,e 0,d,e 0 a,,d,e 0 L = {{a}, {b}, {c}, {e}, {a, b}, {a, c}, {a, e}, {b, c}, {b, e}, {a, b, e}}
14 Properties of Naive Algorithm returns correct result always terminates But: counting support for each itemset X P(I ) is not applicable as P(I ) is exponential in I
15 Observations support D (X ) support D (X Y ) support D (X ) θ s Y : Y X : support D (Y ) θ s all subsets of a frequent set are frequent support D (X ) < θ s Y : Y X : support D (Y ) < θ s all supersets of an infrequent set X are not frequent example: support D ({a, b}) support D ({a, b, c, d})
16 Apriori Algorithm Breadth-first/ levelwise search 1. find frequent itemsets of length 1 2. find frequent itemsets of length only explores itemsets where all subsets are known to be frequent
17 Apriori Algorithm function Apriori(D, θ s ) k 1 L k {{i} i I, support D ({i}) θ s } while L k do C k+1 generatecandidates(l k, k + 1) L k+1 {X C k+1 support D (X ) θ s } k k + 1 end while return k=1 end function L k
18 Candidate Generation generates candidates of length k from frequent itemsets L of length k 1 function generatecandidates(l, k) C {X Y X, Y L X Y = k} C {X C Y X : Y = k 1 Y L} return C end function
19 Example Data D,e a,,e a,b,d,e,d a, find itemsets with θ s 0.3 X frequent # D (X ) > 2
20 Example Data D,e a,,e a,b,d,e,d a, C 1 # a? b? c? d? e?
21 Example Data D,e a,,e a,b,d,e,d a, C 1 # a 7 b 7 c 6 d 2 e 5
22 Example Data D,e a,,e a,b,d,e,d a, C 1 # a 7 b 7 c 6 d 2 e 5
23 Example Data D,e a,,e a,b,d,e,d a, C 1 # a 7 b 7 c 6 d 2 e 5 L 1 a b c e
24 Example Data D,e a,,e a,b,d,e,d a, C 2 # a,b?? a,e?? b,e? c,e? L 1 a b c e
25 Example Data D,e a,,e a,b,d,e,d a, C 2 # a,b 5 4 a,e 5 4 b,e 4 c,e 2
26 Example Data D,e a,,e a,b,d,e,d a, C 2 # a,b 5 4 a,e 5 4 b,e 4 c,e 2
27 Example Data D,e a,,e a,b,d,e,d a, C 2 # a,b 5 4 a,e 5 4 b,e 4 c,e 2 L 2 a,b a,e b,e
28 Example Data D,e a,,e a,b,d,e,d a, C 3 # a,??,e?,e? L 2 a,b a,e b,e
29 Example Data D,e a,,e a,b,d,e,d a, C 3 # a,?? Pruning: {c, e} L 2
30 Example Data D,e a,,e a,b,d,e,d a, C 3 # a, 2 4
31 Example Data D,e a,,e a,b,d,e,d a, C 3 # a, 2 4
32 Example Data D,e a,,e a,b,d,e,d a, C 3 # a, 2 4 L 3
33 Example Data D,e a,,e a,b,d,e,d a, C 4 # - - L 3
34 Example Data D,e a,,e a,b,d,e,d a, L 1 a b c e L 2 a,b a,e b,e L 3 L = {{a}, {b}, {c}, {e}, {a, b}, {a, c}, {a, e}, {b, c}, {b, e}, {a, b, e}}
35 Trie / Prefix Tree For candidate generation and frequency counting, a trie can be used: a trie is a tree each node contains an item and a frequency counter each path from the root to a node corresponses to an itemset the k-th level represents itemsets of length k the items in a trie are ordered
36 Example Prefix Tree Data D,e a,,e a,b,d,e,d a, Ø _ a 7 b 7 c 6 e 5 b 5 c 4 e 5 c 4 e 4 e 4
37 Example #{} = 4 Data D,e a,,e a,b,d,e,d a, Ø _ a 7 b 7 c 6 e 5 b 5 c 4 e 5 c 4 e 4 e 4
38 Example Data D,e a,,e a,b,d,e,d a, #{b} = 7 Ø _ a 7 b 7 c 6 e 5 b 5 c 4 e 5 c 4 e 4 e 4
39 Example Data D,e a,,e a,b,d,e,d a, #{b,e} = 4 Ø _ a 7 b 7 c 6 e 5 b 5 c 4 e 5 c 4 e 4 e 4
40 Trie: Frequency Counting To count frequencies with a trie, each transaction d D is handled the following way: 1. sort d 2. start at the root 3. for each item i d follow the node i, increase it by one and recursively repeat this for d \ {i}
41 Trie: Candidate Generation Candidates of length k can be generated from a trie of depth k 1: 1. for each node at level k 1 append its siblings 2. prune infrequent childs
42 Trie: Example Data D,e a,,e a,b,d,e,d a, find itemsets with θ s 0.3 X frequent # D (X ) > 2... see blackboard...
43 Eclat Algorithm Algorithm for itemset mining Depth-first algorithm Vertical data base layout For each pattern: store the cover, i.e. all transactions that include this pattern. e.g. (a, {d 1, d 3, d 4, d 5, d 7, d 8, d 9 }) Count frequency by intersection
44 Eclat Algorithm function Eclat(D, θ s ) C = {{(i, {d D i d}) i I L = (i, D i ) C D } i D θ s return EclatRecursion(L,, θ s ) end function
45 Eclat Algorithm function EclatRecursion(L, p, θ s ) F for all (i, D i ) L do q p {i} F F {p} C q { {(j, D i D j ) (j, D j ) L, j > i} L q (k, D k ) C q D } k θ s D if L q then F F EclatRecursion(L q, q, θ s } end if end for return F end function
46 Example Data D,e a,,e a,b,d,e,d a, find itemsets with θ s 0.3 X frequent # D (X ) > 2... see blackboard...
47 Association Rules Which itemssets Y occur often if another itemset X appears? X Y Example: a customer buying diapers also buys beer {diapers} {beer} given Items I = {ii,..., i m } Data D P(I ) multiset Frequency thresholds θs Confidence threshold θ c to find Rules R = {X Y supportd (X Y ) θ s confidence D (X Y ) θ c }
48 Definitions and Terms support measures how often the rule X Y appears support D (X Y ) = support D (X Y ) X Y is frequent / large iff support D (X Y ) θ s confidence measures how likely it is that Y appears if X is present. confidenced (X Y ) = support D(X Y ) support D (X ) for a rule X Y, Y is called head and X is called body
49 Example Data D,e a,,e a,b,d,e,d a, find rules with θ s 0.3 X frequent # D (X ) > 2 find rules with θ c 0.8
50 Example Data D,e a,,e a,b,d,e,d a, confidence D (X Y ) = support D(X Y ) support D (X ) support D (X Y ) = support D (X Y ) L = {{a}, {b}, {c}, {e}, {a, b}, {a, c}, {a, e}, {b, c}, {b, e}, {a, b, e}}... see blackboard...
51 Example Data D,e a,,e a,b,d,e,d a, R = {e a, e b, e ab, ab e, ae b, be a} {X X L}
52 Observations expanding the head of a rule by an item of the body, results in a rule with less or equal confidence. proof: confidence D (X \ Z Y Z) confidence D (X Y ) confidence D (X \ Z Y Z) = support D((X \ Z) (Y Z)) support D (X \ Z) support D(X Y ) support D (X ) = confidence D (X Y ) = support D(X Y Z) support D (X \ Z) example: confidence D ({a, b} {c, d}) confidence D ({a, b, c} {d})
53 Algorithm Association rule mining is done in two steps: 1. find frequent itemsets (see itemset mining) 2. extract rules from the frequent itemsets
54 AssociationRules Algorithm function AssociationRules(D, θ s, θ c ) L Apriori(D, θ s ) R for all I L do k 1 C k {{i} i I } while C k do H k {X C k confidence D (I \ X X ) θ c } C k+1 generatecandidateheads(h k, k + 1) k k + 1 end while R R {I \ X X X H k } {I } end for return R end function k=1
55 Candidate Generation for Heads of Rules generates candidate heads of length k from heads H of length k 1 function generatecandidateheads(h, k) C {X Y X, Y H X Y = k} C {X C Y X : Y = k 1 Y H} return C end function
56 Remarks Calculating the confidence can be reduced to calculating the support: confidence D (I \ X X ) = support D((I \ X ) X ) support D (I \ X ) support D(I ) support D (I \ X ) θ c θ c support D (I \ X ) 1 θ c support D (I ) If θ c θ s, the values for support D can be looked up in the trie and no database pass is necessary.
57 Example Trace of inner loop of the algorithm AssociationRules for I = {a, b, e}.... see blackboard...
58 Outlook Extensions to Apriori and Eclat Further pattern: sequences, trees,... Background knowledge: e.g. taxonomies
59 Sequence mining Takes the time into account, when an action is performed. E.g. A database of courses attended by a student in one term, i.e. sequences of sets: Student1: ({linear algebra, c++, algorithm theory}, {machine learning, numerics, economics}, {bayessian networks}) Student2: ({linear algebra, java}, {software engineering}, {numerics}) Student3: ({linear algebra, java, algorithm theory}, {economics}, {machine learning, numerics}, {bayessian networks})... A frequent sequence might be ({linear algebra, algorithm theory}, {machine learning, numerics}, {bayessian networks})
60 Use taxonomies Background knowledge in terms of taxonomies might be used for mining patterns. E.g. The following taxonomy is given over subjects linear algebra isa mathematics mathematics isa science computer science isa science In the student database one could mine the association rule using the taxonomy: if someone has attended machine learning then (s)he also has attended some mathematic lecture {machine learning} {mathematics}
61 Conclusion Task: Finding frequent patterns in database. Efficient algorithms explore only promising candidates by pruning. Mining association rules can be reduced to mining itemsets with an additional post processing step.
62 Literature R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages Morgan Kaufmann, R. Agrawal and R. Srikant. Mining sequential patterns. In P. S. Yu and A. S. P. Chen, editors, Eleventh International Conference on Data Engineering, pages 3 14, Taipei, Taiwan, IEEE Computer Society Press. L. Schmidt-Thieme. Algorithmic features of eclat
Lars Schmidt-Thieme, Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany
Syllabus Fri. 21.10. (1) 0. Introduction A. Supervised Learning: Linear Models & Fundamentals Fri. 27.10. (2) A.1 Linear Regression Fri. 3.11. (3) A.2 Linear Classification Fri. 10.11. (4) A.3 Regularization
More informationAssociation Rule. Lecturer: Dr. Bo Yuan. LOGO
Association Rule Lecturer: Dr. Bo Yuan LOGO E-mail: yuanb@sz.tsinghua.edu.cn Overview Frequent Itemsets Association Rules Sequential Patterns 2 A Real Example 3 Market-Based Problems Finding associations
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA
More informationData Mining: Concepts and Techniques. (3 rd ed.) Chapter 6
Data Mining: Concepts and Techniques (3 rd ed.) Chapter 6 Jiawei Han, Micheline Kamber, and Jian Pei University of Illinois at Urbana-Champaign & Simon Fraser University 2013 Han, Kamber & Pei. All rights
More informationAssociation Rules. Fundamentals
Politecnico di Torino Politecnico di Torino 1 Association rules Objective extraction of frequent correlations or pattern from a transactional database Tickets at a supermarket counter Association rule
More informationDATA MINING LECTURE 3. Frequent Itemsets Association Rules
DATA MINING LECTURE 3 Frequent Itemsets Association Rules This is how it all started Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases.
More informationD B M G Data Base and Data Mining Group of Politecnico di Torino
Data Base and Data Mining Group of Politecnico di Torino Politecnico di Torino Association rules Objective extraction of frequent correlations or pattern from a transactional database Tickets at a supermarket
More informationCS 484 Data Mining. Association Rule Mining 2
CS 484 Data Mining Association Rule Mining 2 Review: Reducing Number of Candidates Apriori principle: If an itemset is frequent, then all of its subsets must also be frequent Apriori principle holds due
More informationD B M G. Association Rules. Fundamentals. Fundamentals. Elena Baralis, Silvia Chiusano. Politecnico di Torino 1. Definitions.
Definitions Data Base and Data Mining Group of Politecnico di Torino Politecnico di Torino Itemset is a set including one or more items Example: {Beer, Diapers} k-itemset is an itemset that contains k
More informationD B M G. Association Rules. Fundamentals. Fundamentals. Association rules. Association rule mining. Definitions. Rule quality metrics: example
Association rules Data Base and Data Mining Group of Politecnico di Torino Politecnico di Torino Objective extraction of frequent correlations or pattern from a transactional database Tickets at a supermarket
More information732A61/TDDD41 Data Mining - Clustering and Association Analysis
732A61/TDDD41 Data Mining - Clustering and Association Analysis Lecture 6: Association Analysis I Jose M. Peña IDA, Linköping University, Sweden 1/14 Outline Content Association Rules Frequent Itemsets
More informationCS5112: Algorithms and Data Structures for Applications
CS5112: Algorithms and Data Structures for Applications Lecture 19: Association rules Ramin Zabih Some content from: Wikipedia/Google image search; Harrington; J. Leskovec, A. Rajaraman, J. Ullman: Mining
More informationASSOCIATION ANALYSIS FREQUENT ITEMSETS MINING. Alexandre Termier, LIG
ASSOCIATION ANALYSIS FREQUENT ITEMSETS MINING, LIG M2 SIF DMV course 207/208 Market basket analysis Analyse supermarket s transaction data Transaction = «market basket» of a customer Find which items are
More informationOutline. Fast Algorithms for Mining Association Rules. Applications of Data Mining. Data Mining. Association Rule. Discussion
Outline Fast Algorithms for Mining Association Rules Rakesh Agrawal Ramakrishnan Srikant Introduction Algorithm Apriori Algorithm AprioriTid Comparison of Algorithms Conclusion Presenter: Dan Li Discussion:
More informationFrequent Itemset Mining
ì 1 Frequent Itemset Mining Nadjib LAZAAR LIRMM- UM COCONUT Team (PART I) IMAGINA 17/18 Webpage: http://www.lirmm.fr/~lazaar/teaching.html Email: lazaar@lirmm.fr 2 Data Mining ì Data Mining (DM) or Knowledge
More informationData Mining Concepts & Techniques
Data Mining Concepts & Techniques Lecture No. 04 Association Analysis Naeem Ahmed Email: naeemmahoto@gmail.com Department of Software Engineering Mehran Univeristy of Engineering and Technology Jamshoro
More informationIntroduction to Data Mining
Introduction to Data Mining Lecture #12: Frequent Itemsets Seoul National University 1 In This Lecture Motivation of association rule mining Important concepts of association rules Naïve approaches for
More informationChapter 6. Frequent Pattern Mining: Concepts and Apriori. Meng Jiang CSE 40647/60647 Data Science Fall 2017 Introduction to Data Mining
Chapter 6. Frequent Pattern Mining: Concepts and Apriori Meng Jiang CSE 40647/60647 Data Science Fall 2017 Introduction to Data Mining Pattern Discovery: Definition What are patterns? Patterns: A set of
More informationLecture Notes for Chapter 6. Introduction to Data Mining
Data Mining Association Analysis: Basic Concepts and Algorithms Lecture Notes for Chapter 6 Introduction to Data Mining by Tan, Steinbach, Kumar Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004
More informationCS 584 Data Mining. Association Rule Mining 2
CS 584 Data Mining Association Rule Mining 2 Recall from last time: Frequent Itemset Generation Strategies Reduce the number of candidates (M) Complete search: M=2 d Use pruning techniques to reduce M
More informationDATA MINING LECTURE 4. Frequent Itemsets, Association Rules Evaluation Alternative Algorithms
DATA MINING LECTURE 4 Frequent Itemsets, Association Rules Evaluation Alternative Algorithms RECAP Mining Frequent Itemsets Itemset A collection of one or more items Example: {Milk, Bread, Diaper} k-itemset
More informationAssociation Rules. Acknowledgements. Some parts of these slides are modified from. n C. Clifton & W. Aref, Purdue University
Association Rules CS 5331 by Rattikorn Hewett Texas Tech University 1 Acknowledgements Some parts of these slides are modified from n C. Clifton & W. Aref, Purdue University 2 1 Outline n Association Rule
More informationCOMP 5331: Knowledge Discovery and Data Mining
COMP 5331: Knowledge Discovery and Data Mining Acknowledgement: Slides modified by Dr. Lei Chen based on the slides provided by Jiawei Han, Micheline Kamber, and Jian Pei And slides provide by Raymond
More informationData Analytics Beyond OLAP. Prof. Yanlei Diao
Data Analytics Beyond OLAP Prof. Yanlei Diao OPERATIONAL DBs DB 1 DB 2 DB 3 EXTRACT TRANSFORM LOAD (ETL) METADATA STORE DATA WAREHOUSE SUPPORTS OLAP DATA MINING INTERACTIVE DATA EXPLORATION Overview of
More informationFrequent Itemsets and Association Rule Mining. Vinay Setty Slides credit:
Frequent Itemsets and Association Rule Mining Vinay Setty vinay.j.setty@uis.no Slides credit: http://www.mmds.org/ Association Rule Discovery Supermarket shelf management Market-basket model: Goal: Identify
More informationMining Molecular Fragments: Finding Relevant Substructures of Molecules
Mining Molecular Fragments: Finding Relevant Substructures of Molecules Christian Borgelt, Michael R. Berthold Proc. IEEE International Conference on Data Mining, 2002. ICDM 2002. Lecturers: Carlo Cagli
More informationCSE 5243 INTRO. TO DATA MINING
CSE 5243 INTRO. TO DATA MINING Mining Frequent Patterns and Associations: Basic Concepts (Chapter 6) Huan Sun, CSE@The Ohio State University 10/17/2017 Slides adapted from Prof. Jiawei Han @UIUC, Prof.
More informationCSE 5243 INTRO. TO DATA MINING
CSE 5243 INTRO. TO DATA MINING Mining Frequent Patterns and Associations: Basic Concepts (Chapter 6) Huan Sun, CSE@The Ohio State University Slides adapted from Prof. Jiawei Han @UIUC, Prof. Srinivasan
More informationHandling a Concept Hierarchy
Food Electronics Handling a Concept Hierarchy Bread Milk Computers Home Wheat White Skim 2% Desktop Laptop Accessory TV DVD Foremost Kemps Printer Scanner Data Mining: Association Rules 5 Why should we
More informationEncyclopedia of Machine Learning Chapter Number Book CopyRight - Year 2010 Frequent Pattern. Given Name Hannu Family Name Toivonen
Book Title Encyclopedia of Machine Learning Chapter Number 00403 Book CopyRight - Year 2010 Title Frequent Pattern Author Particle Given Name Hannu Family Name Toivonen Suffix Email hannu.toivonen@cs.helsinki.fi
More informationDATA MINING LECTURE 4. Frequent Itemsets and Association Rules
DATA MINING LECTURE 4 Frequent Itemsets and Association Rules This is how it all started Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases.
More informationTemporal Data Mining
Temporal Data Mining Christian Moewes cmoewes@ovgu.de Otto-von-Guericke University of Magdeburg Faculty of Computer Science Department of Knowledge Processing and Language Engineering Zittau Fuzzy Colloquium
More informationAssociation Analysis Part 2. FP Growth (Pei et al 2000)
Association Analysis art 2 Sanjay Ranka rofessor Computer and Information Science and Engineering University of Florida F Growth ei et al 2 Use a compressed representation of the database using an F-tree
More informationAssocia'on Rule Mining
Associa'on Rule Mining Debapriyo Majumdar Data Mining Fall 2014 Indian Statistical Institute Kolkata August 4 and 7, 2014 1 Market Basket Analysis Scenario: customers shopping at a supermarket Transaction
More informationDATA MINING - 1DL360
DATA MINING - 1DL36 Fall 212" An introductory class in data mining http://www.it.uu.se/edu/course/homepage/infoutv/ht12 Kjell Orsborn Uppsala Database Laboratory Department of Information Technology, Uppsala
More informationAssociation Rules Information Retrieval and Data Mining. Prof. Matteo Matteucci
Association Rules Information Retrieval and Data Mining Prof. Matteo Matteucci Learning Unsupervised Rules!?! 2 Market-Basket Transactions 3 Bread Peanuts Milk Fruit Jam Bread Jam Soda Chips Milk Fruit
More informationAssociation Rule Mining on Web
Association Rule Mining on Web What Is Association Rule Mining? Association rule mining: Finding interesting relationships among items (or objects, events) in a given data set. Example: Basket data analysis
More informationData Mining. Dr. Raed Ibraheem Hamed. University of Human Development, College of Science and Technology Department of Computer Science
Data Mining Dr. Raed Ibraheem Hamed University of Human Development, College of Science and Technology Department of Computer Science 2016 2017 Road map The Apriori algorithm Step 1: Mining all frequent
More informationReductionist View: A Priori Algorithm and Vector-Space Text Retrieval. Sargur Srihari University at Buffalo The State University of New York
Reductionist View: A Priori Algorithm and Vector-Space Text Retrieval Sargur Srihari University at Buffalo The State University of New York 1 A Priori Algorithm for Association Rule Learning Association
More informationSequential Pattern Mining
Sequential Pattern Mining Lecture Notes for Chapter 7 Introduction to Data Mining Tan, Steinbach, Kumar From itemsets to sequences Frequent itemsets and association rules focus on transactions and the
More informationFrequent Itemset Mining
ì 1 Frequent Itemset Mining Nadjib LAZAAR LIRMM- UM COCONUT Team IMAGINA 16/17 Webpage: h;p://www.lirmm.fr/~lazaar/teaching.html Email: lazaar@lirmm.fr 2 Data Mining ì Data Mining (DM) or Knowledge Discovery
More informationFrequent Itemset Mining
1 Frequent Itemset Mining Nadjib LAZAAR LIRMM- UM IMAGINA 15/16 2 Frequent Itemset Mining: Motivations Frequent Itemset Mining is a method for market basket analysis. It aims at finding regulariges in
More informationLecture Notes for Chapter 6. Introduction to Data Mining. (modified by Predrag Radivojac, 2017)
Lecture Notes for Chapter 6 Introduction to Data Mining by Tan, Steinbach, Kumar (modified by Predrag Radivojac, 27) Association Rule Mining Given a set of transactions, find rules that will predict the
More informationIntroduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar
Data Mining Chapter 5 Association Analysis: Basic Concepts Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar 2/3/28 Introduction to Data Mining Association Rule Mining Given
More informationChapters 6 & 7, Frequent Pattern Mining
CSI 4352, Introduction to Data Mining Chapters 6 & 7, Frequent Pattern Mining Young-Rae Cho Associate Professor Department of Computer Science Baylor University CSI 4352, Introduction to Data Mining Chapters
More informationThe Market-Basket Model. Association Rules. Example. Support. Applications --- (1) Applications --- (2)
The Market-Basket Model Association Rules Market Baskets Frequent sets A-priori Algorithm A large set of items, e.g., things sold in a supermarket. A large set of baskets, each of which is a small set
More informationAssociation Analysis: Basic Concepts. and Algorithms. Lecture Notes for Chapter 6. Introduction to Data Mining
Association Analysis: Basic Concepts and Algorithms Lecture Notes for Chapter 6 Introduction to Data Mining by Tan, Steinbach, Kumar Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 1 Association
More informationBasic Data Structures and Algorithms for Data Profiling Felix Naumann
Basic Data Structures and Algorithms for 8.5.2017 Overview 1. The lattice 2. Apriori lattice traversal 3. Position List Indices 4. Bloom filters Slides with Thorsten Papenbrock 2 Definitions Lattice Partially
More informationFrequent Pattern Mining: Exercises
Frequent Pattern Mining: Exercises Christian Borgelt School of Computer Science tto-von-guericke-university of Magdeburg Universitätsplatz 2, 39106 Magdeburg, Germany christian@borgelt.net http://www.borgelt.net/
More informationDATA MINING - 1DL360
DATA MINING - DL360 Fall 200 An introductory class in data mining http://www.it.uu.se/edu/course/homepage/infoutv/ht0 Kjell Orsborn Uppsala Database Laboratory Department of Information Technology, Uppsala
More informationApriori algorithm. Seminar of Popular Algorithms in Data Mining and Machine Learning, TKK. Presentation Lauri Lahti
Apriori algorithm Seminar of Popular Algorithms in Data Mining and Machine Learning, TKK Presentation 12.3.2008 Lauri Lahti Association rules Techniques for data mining and knowledge discovery in databases
More informationFrequent Itemset Mining
Frequent Itemset Mining prof. dr Arno Siebes Algorithmic Data Analysis Group Department of Information and Computing Sciences Universiteit Utrecht Battling Size The previous time we saw that Big Data has
More informationAlgorithmic Methods of Data Mining, Fall 2005, Course overview 1. Course overview
Algorithmic Methods of Data Mining, Fall 2005, Course overview 1 Course overview lgorithmic Methods of Data Mining, Fall 2005, Course overview 1 T-61.5060 Algorithmic methods of data mining (3 cp) P T-61.5060
More informationCOMP 5331: Knowledge Discovery and Data Mining
COMP 5331: Knowledge Discovery and Data Mining Acknowledgement: Slides modified by Dr. Lei Chen based on the slides provided by Tan, Steinbach, Kumar And Jiawei Han, Micheline Kamber, and Jian Pei 1 10
More informationDensity-Based Clustering
Density-Based Clustering idea: Clusters are dense regions in feature space F. density: objects volume ε here: volume: ε-neighborhood for object o w.r.t. distance measure dist(x,y) dense region: ε-neighborhood
More informationAssociation Analysis. Part 1
Association Analysis Part 1 1 Market-basket analysis DATA: A large set of items: e.g., products sold in a supermarket A large set of baskets: e.g., each basket represents what a customer bought in one
More informationDistributed Mining of Frequent Closed Itemsets: Some Preliminary Results
Distributed Mining of Frequent Closed Itemsets: Some Preliminary Results Claudio Lucchese Ca Foscari University of Venice clucches@dsi.unive.it Raffaele Perego ISTI-CNR of Pisa perego@isti.cnr.it Salvatore
More informationA New Concise and Lossless Representation of Frequent Itemsets Using Generators and A Positive Border
A New Concise and Lossless Representation of Frequent Itemsets Using Generators and A Positive Border Guimei Liu a,b Jinyan Li a Limsoon Wong b a Institute for Infocomm Research, Singapore b School of
More informationApproximate counting: count-min data structure. Problem definition
Approximate counting: count-min data structure G. Cormode and S. Muthukrishhan: An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms 55 (2005) 58-75. Problem
More informationUnit II Association Rules
Unit II Association Rules Basic Concepts Frequent Pattern Analysis Frequent pattern: a pattern (a set of items, subsequences, substructures, etc.) that occurs frequently in a data set Frequent Itemset
More informationAssociation Analysis 1
Association Analysis 1 Association Rules 1 3 Learning Outcomes Motivation Association Rule Mining Definition Terminology Apriori Algorithm Reducing Output: Closed and Maximal Itemsets 4 Overview One of
More informationAssignment 7 (Sol.) Introduction to Data Analytics Prof. Nandan Sudarsanam & Prof. B. Ravindran
Assignment 7 (Sol.) Introduction to Data Analytics Prof. Nandan Sudarsanam & Prof. B. Ravindran 1. Let X, Y be two itemsets, and let denote the support of itemset X. Then the confidence of the rule X Y,
More informationKnowledge Discovery and Data Mining I
Ludwig-Maximilians-Universität München Lehrstuhl für Datenbanksysteme und Data Mining Prof. Dr. Thomas Seidl Knowledge Discovery and Data Mining I Winter Semester 2018/19 Agenda 1. Introduction 2. Basics
More informationMining Positive and Negative Fuzzy Association Rules
Mining Positive and Negative Fuzzy Association Rules Peng Yan 1, Guoqing Chen 1, Chris Cornelis 2, Martine De Cock 2, and Etienne Kerre 2 1 School of Economics and Management, Tsinghua University, Beijing
More informationAssociation)Rule Mining. Pekka Malo, Assist. Prof. (statistics) Aalto BIZ / Department of Information and Service Management
Association)Rule Mining Pekka Malo, Assist. Prof. (statistics) Aalto BIZ / Department of Information and Service Management What)is)Association)Rule)Mining? Finding frequent patterns,1associations,1correlations,1or
More informationCSE-4412(M) Midterm. There are five major questions, each worth 10 points, for a total of 50 points. Points for each sub-question are as indicated.
22 February 2007 CSE-4412(M) Midterm p. 1 of 12 CSE-4412(M) Midterm Sur / Last Name: Given / First Name: Student ID: Instructor: Parke Godfrey Exam Duration: 75 minutes Term: Winter 2007 Answer the following
More informationCourse Content. Association Rules Outline. Chapter 6 Objectives. Chapter 6: Mining Association Rules. Dr. Osmar R. Zaïane. University of Alberta 4
Principles of Knowledge Discovery in Data Fall 2004 Chapter 6: Mining Association Rules Dr. Osmar R. Zaïane University of Alberta Course Content Introduction to Data Mining Data warehousing and OLAP Data
More informationOn the Complexity of Mining Itemsets from the Crowd Using Taxonomies
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies Antoine Amarilli 1,2 Yael Amsterdamer 1 Tova Milo 1 1 Tel Aviv University, Tel Aviv, Israel 2 École normale supérieure, Paris, France
More informationMining Infrequent Patter ns
Mining Infrequent Patter ns JOHAN BJARNLE (JOHBJ551) PETER ZHU (PETZH912) LINKÖPING UNIVERSITY, 2009 TNM033 DATA MINING Contents 1 Introduction... 2 2 Techniques... 3 2.1 Negative Patterns... 3 2.2 Negative
More informationDescrip9ve data analysis. Example. Example. Example. Example. Data Mining MTAT (6EAP)
3.9.2 Descrip9ve data analysis Data Mining MTAT.3.83 (6EAP) hp://courses.cs.ut.ee/2/dm/ Frequent itemsets and associa@on rules Jaak Vilo 2 Fall Aims to summarise the main qualita9ve traits of data. Used
More informationFour Paradigms in Data Mining
Four Paradigms in Data Mining dataminingbook.info Wagner Meira Jr. 1 1 Department of Computer Science Universidade Federal de Minas Gerais, Belo Horizonte, Brazil October 13, 2015 Meira Jr. (UFMG) Four
More informationCS 5614: (Big) Data Management Systems. B. Aditya Prakash Lecture #11: Frequent Itemsets
CS 5614: (Big) Data Management Systems B. Aditya Prakash Lecture #11: Frequent Itemsets Refer Chapter 6. MMDS book. VT CS 5614 2 Associa=on Rule Discovery Supermarket shelf management Market-basket model:
More informationFP-growth and PrefixSpan
FP-growth and PrefixSpan n Challenges of Frequent Pattern Mining n Improving Apriori n Fp-growth n Fp-tree n Mining frequent patterns with FP-tree n PrefixSpan Challenges of Frequent Pattern Mining n Challenges
More informationData Mining and Knowledge Discovery. Petra Kralj Novak. 2011/11/29
Data Mining and Knowledge Discovery Petra Kralj Novak Petra.Kralj.Novak@ijs.si 2011/11/29 1 Practice plan 2011/11/08: Predictive data mining 1 Decision trees Evaluating classifiers 1: separate test set,
More informationDATA MINING - 1DL105, 1DL111
1 DATA MINING - 1DL105, 1DL111 Fall 2007 An introductory class in data mining http://user.it.uu.se/~udbl/dut-ht2007/ alt. http://www.it.uu.se/edu/course/homepage/infoutv/ht07 Kjell Orsborn Uppsala Database
More informationMining Strong Positive and Negative Sequential Patterns
Mining Strong Positive and Negative Sequential Patter NANCY P. LIN, HUNG-JEN CHEN, WEI-HUA HAO, HAO-EN CHUEH, CHUNG-I CHANG Department of Computer Science and Information Engineering Tamang University,
More information10/19/2017 MIST.6060 Business Intelligence and Data Mining 1. Association Rules
10/19/2017 MIST6060 Business Intelligence and Data Mining 1 Examples of Association Rules Association Rules Sixty percent of customers who buy sheets and pillowcases order a comforter next, followed by
More informationPositive Borders or Negative Borders: How to Make Lossless Generator Based Representations Concise
Positive Borders or Negative Borders: How to Make Lossless Generator Based Representations Concise Guimei Liu 1,2 Jinyan Li 1 Limsoon Wong 2 Wynne Hsu 2 1 Institute for Infocomm Research, Singapore 2 School
More informationIntroduction Association Rule Mining Decision Trees Summary. SMLO12: Data Mining. Statistical Machine Learning Overview.
SMLO12: Data Mining Statistical Machine Learning Overview Douglas Aberdeen Canberra Node, RSISE Building Australian National University 4th November 2004 Outline 1 Introduction 2 Association Rule Mining
More informationCS738 Class Notes. Steve Revilak
CS738 Class Notes Steve Revilak January 2008 May 2008 Copyright c 2008 Steve Revilak. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation
More informationEFFICIENT MINING OF WEIGHTED QUANTITATIVE ASSOCIATION RULES AND CHARACTERIZATION OF FREQUENT ITEMSETS
EFFICIENT MINING OF WEIGHTED QUANTITATIVE ASSOCIATION RULES AND CHARACTERIZATION OF FREQUENT ITEMSETS Arumugam G Senior Professor and Head, Department of Computer Science Madurai Kamaraj University Madurai,
More information.. Cal Poly CSC 466: Knowledge Discovery from Data Alexander Dekhtyar..
.. Cal Poly CSC 4: Knowledge Discovery from Data Alexander Dekhtyar.. Data Mining: Mining Association Rules Examples Course Enrollments Itemset. I = { CSC3, CSC3, CSC40, CSC40, CSC4, CSC44, CSC4, CSC44,
More informationDescrip<ve data analysis. Example. E.g. set of items. Example. Example. Data Mining MTAT (6EAP)
25.2.5 Descrip
More informationCS 412 Intro. to Data Mining
CS 412 Intro. to Data Mining Chapter 6. Mining Frequent Patterns, Association and Correlations: Basic Concepts and Methods Jiawei Han, Computer Science, Univ. Illinois at Urbana -Champaign, 2017 1 2 3
More informationMining Temporal Patterns for Interval-Based and Point-Based Events
International Journal of Computational Engineering Research Vol, 03 Issue, 4 Mining Temporal Patterns for Interval-Based and Point-Based Events 1, S.Kalaivani, 2, M.Gomathi, 3, R.Sethukkarasi 1,2,3, Department
More information1 Frequent Pattern Mining
Decision Support Systems MEIC - Alameda 2010/2011 Homework #5 Due date: 31.Oct.2011 1 Frequent Pattern Mining 1. The Apriori algorithm uses prior knowledge about subset support properties. In particular,
More informationClassification Using Decision Trees
Classification Using Decision Trees 1. Introduction Data mining term is mainly used for the specific set of six activities namely Classification, Estimation, Prediction, Affinity grouping or Association
More informationDescriptive data analysis. E.g. set of items. Example: Items in baskets. Sort or renumber in any way. Example
.3.6 Descriptive data analysis Data Mining MTAT.3.83 (6EAP) Frequent itemsets and association rules Jaak Vilo 26 Spring Aims to summarise the main qualitative traits of data. Used mainly for discovering
More informationData mining, 4 cu Lecture 5:
582364 Data mining, 4 cu Lecture 5: Evaluation of Association Patterns Spring 2010 Lecturer: Juho Rousu Teaching assistant: Taru Itäpelto Evaluation of Association Patterns Association rule algorithms
More informationRemoving trivial associations in association rule discovery
Removing trivial associations in association rule discovery Geoffrey I. Webb and Songmao Zhang School of Computing and Mathematics, Deakin University Geelong, Victoria 3217, Australia Abstract Association
More informationData Mining Concepts & Techniques
Data Mining Concepts & Techniques Lecture No. 05 Sequential Pattern Mining Naeem Ahmed Email: naeemmahoto@gmail.com Department of Software Engineering Mehran Univeristy of Engineering and Technology Jamshoro
More information15 Introduction to Data Mining
15 Introduction to Data Mining 15.1 Introduction to principle methods 15.2 Mining association rule see also: A. Kemper, Chap. 17.4, Kifer et al.: chap 17.7 ff 15.1 Introduction "Discovery of useful, possibly
More informationMeelis Kull Autumn Meelis Kull - Autumn MTAT Data Mining - Lecture 05
Meelis Kull meelis.kull@ut.ee Autumn 2017 1 Sample vs population Example task with red and black cards Statistical terminology Permutation test and hypergeometric test Histogram on a sample vs population
More informationMining Emerging Substrings
Mining Emerging Substrings Sarah Chan Ben Kao C.L. Yip Michael Tang Department of Computer Science and Information Systems The University of Hong Kong {wyschan, kao, clyip, fmtang}@csis.hku.hk Abstract.
More informationUn nouvel algorithme de génération des itemsets fermés fréquents
Un nouvel algorithme de génération des itemsets fermés fréquents Huaiguo Fu CRIL-CNRS FRE2499, Université d Artois - IUT de Lens Rue de l université SP 16, 62307 Lens cedex. France. E-mail: fu@cril.univ-artois.fr
More informationDetecting Anomalous and Exceptional Behaviour on Credit Data by means of Association Rules. M. Delgado, M.D. Ruiz, M.J. Martin-Bautista, D.
Detecting Anomalous and Exceptional Behaviour on Credit Data by means of Association Rules M. Delgado, M.D. Ruiz, M.J. Martin-Bautista, D. Sánchez 18th September 2013 Detecting Anom and Exc Behaviour on
More informationExercise 1. min_sup = 0.3. Items support Type a 0.5 C b 0.7 C c 0.5 C d 0.9 C e 0.6 F
Exercise 1 min_sup = 0.3 Items support Type a 0.5 C b 0.7 C c 0.5 C d 0.9 C e 0.6 F Items support Type ab 0.3 M ac 0.2 I ad 0.4 F ae 0.4 F bc 0.3 M bd 0.6 C be 0.4 F cd 0.4 C ce 0.2 I de 0.6 C Items support
More informationPattern-Based Decision Tree Construction
Pattern-Based Decision Tree Construction Dominique Gay, Nazha Selmaoui ERIM - University of New Caledonia BP R4 F-98851 Nouméa cedex, France {dominique.gay, nazha.selmaoui}@univ-nc.nc Jean-François Boulicaut
More informationDescriptive data analysis. E.g. set of items. Example: Items in baskets. Sort or renumber in any way. Example item id s
7.3.7 Descriptive data analysis Data Mining MTAT.3.83 (6EAP) Frequent itemsets and association rules Jaak Vilo 27 Spring Aims to summarise the main qualitative traits of data. Used mainly for discovering
More informationRule Generation using Decision Trees
Rule Generation using Decision Trees Dr. Rajni Jain 1. Introduction A DT is a classification scheme which generates a tree and a set of rules, representing the model of different classes, from a given
More information