SlideShare a Scribd company logo
DMBI(2170715)
Class Comparisons Association Rule
Mining
Made By:
Tarang Desai
140950107100
CSE – B
7th Semester
Association Rule Mining
• Association rules are if/then statements that help uncover
relationships between seemingly unrelated data in a relational
database or other information repository.
• Association rules are created by analysing data for frequent if/then
patterns and using the criteria support and confidence to identify the
most important relationships. Support is an indication of how
frequently the items appear in the database. Confidence indicates the
number of times the if/then statements have been found to be true.
Association Rule Mining
• In data mining, association rules are useful for analysing and
predicting customer behaviour. They play an important part in
shopping basket data analysis, product clustering, catalogue design
and store layout.
• Programmers use association rules to build programs capable of
machine learning. Machine learning is a type of artificial intelligence
(AI) that seeks to build programs with the ability to become more
efficient without being explicitly programmed.
Class Comparisons Association Rule Mining
• Several algorithms have been proposed in the literature to address
the problem of mining association rules.
• It seems to be the most common and popular problem.
• The method for generating the frequent patterns are divided in 2
categories:
• Sequential Methods
• Parallel Methods
Sequential Methods
• Sequential pattern mining is a case of structured data mining.
• It forms the foundation of most known algorithms.
• A sequence database contains some sequences. For example,
consider the following database:
• This database contains four sequences named seq1, seq2, seq3 and
seq4.
Sequential Methods
• For our example, consider that the symbols “a”, “b”, “c”, d”, “e”, “f”,
“g” and “h” respectively represents some items sold in a
supermarket. For example, “a” could represent an “apple”, “b” could
be some “bread”, etc.
• Now, a sequence is an ordered list of sets of items. For our example,
we will assume that each sequence represents what a customer has
bought in our supermarket over time. For example, consider the
second sequence “seq2”. This sequence indicates that the second
customer bought items “a” and “d” together, than bought item “c”,
then bought “b”, and then bought “a”, “b”, “e” and “f” together.
Simple Apriori
• Simple Apriori algorithm is a two step process.
• It is developed by Rakesh Agrawal and Ramakrishnan Srikant in 1994.
• The steps are as follows:
1. The join step: To find LK, a set of candidate K-item set is generated by
joining LK-1 item itself. The rules for join is that the items should be ordered
so we can compare item by item. The join of LK-1 is possible only if its 1st
(K-2) items are common.
2. The prune step: The join step will produce all K-item sets, but not all of
them are frequent. So scan database to see when join step produce an
empty set.
Hash Based Apriori
• A hash based technique can be applied so that it reduce the size of
the candidate K-item set in CK for K>1.
• Our main aim is to reduce the number of scans on the database.
• For Example: When we scan each transaction in the dataset to generate the frequent 1-item
L1 from the candidate 1-itemset C, we can generate all of 2-itemset for each transaction and hash
them into corresponding bucket counts in the hash table.
H(A,B) = ((Order of A)*10 + (Order of B))mod8
Partition Based Apriori
• A partition of the database refer to any subset of transaction
contained in the database D.
• Partition reduces the number of database scans as it divides the
database into small partitions such that each partition can be handled
in the main memory.
• Partition scan database only twice.
• Scan 1: Partition database and find local frequent pattern.
• Scan 2: Consolidate global frequent pattern, initially the database D is
logically partitioned into n partitions.
Partition Based Apriori
• Phase I: Read the entire database once, takes n iterations.
• Input: Pi where i=1…n
• Output: Local large item set of all length
• Merge Phase: The set of global candidate item sets of length J is
computed.
• Input: Local large item set of same length from all n partitions
• Output: Combine and generate global candidate item sets
• Phase II: Read the entire database again, also take n iterations.
• Input: PiB where iB=1…n
• Output: Counter for each global candidate item set and count their support.
Parallel Methods
• Parallel algorithm can be implemented over distributed memory
system.
• Parallel work can be followed.
• Each processor gathers the locally frequent item set of all size in 1
pass over their local database. Then all potentially frequent item set
are then broadcast to other processor.
• Other then each processor gathers the count of these global
candidates item sets. There are 2 major approaches for using
processor.
• Distributed memory machines
• Shared memory processor system
Class Comparisions Association Rule

More Related Content

Similar to Class Comparisions Association Rule

Apriori Algorithm.pptx
Apriori Algorithm.pptxApriori Algorithm.pptx
Apriori Algorithm.pptx
Rashi Agarwal
 
Data mining techniques unit III
Data mining techniques unit IIIData mining techniques unit III
Data mining techniques unit III
malathieswaran29
 
IRJET-Comparative Analysis of Apriori and Apriori with Hashing Algorithm
IRJET-Comparative Analysis of  Apriori and Apriori with Hashing AlgorithmIRJET-Comparative Analysis of  Apriori and Apriori with Hashing Algorithm
IRJET-Comparative Analysis of Apriori and Apriori with Hashing Algorithm
IRJET Journal
 
Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084Editor IJARCET
 
Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084Editor IJARCET
 
Association rules apriori algorithm
Association rules   apriori algorithmAssociation rules   apriori algorithm
Association rules apriori algorithm
Dr. Jasmine Beulah Gnanadurai
 
Discovering Frequent Patterns with New Mining Procedure
Discovering Frequent Patterns with New Mining ProcedureDiscovering Frequent Patterns with New Mining Procedure
Discovering Frequent Patterns with New Mining Procedure
IOSR Journals
 
J017114852
J017114852J017114852
J017114852
IOSR Journals
 
A classification of methods for frequent pattern mining
A classification of methods for frequent pattern miningA classification of methods for frequent pattern mining
A classification of methods for frequent pattern mining
IOSR Journals
 
Dm unit ii r16
Dm unit ii   r16Dm unit ii   r16
Dm unit ii r16
Kishore Kumar
 
Associations.ppt
Associations.pptAssociations.ppt
Associations.ppt
Quyn590023
 
B04503019030
B04503019030B04503019030
B04503019030
ijceronline
 
Mining single dimensional boolean association rules from transactional
Mining single dimensional boolean association rules from transactionalMining single dimensional boolean association rules from transactional
Mining single dimensional boolean association rules from transactional
ramya marichamy
 
Scalable frequent itemset mining using heterogeneous computing par apriori a...
Scalable frequent itemset mining using heterogeneous computing  par apriori a...Scalable frequent itemset mining using heterogeneous computing  par apriori a...
Scalable frequent itemset mining using heterogeneous computing par apriori a...
ijdpsjournal
 
Interval intersection
Interval intersectionInterval intersection
Interval intersection
Aabida Noman
 
Chapter 01 Introduction DM.pptx
Chapter 01 Introduction DM.pptxChapter 01 Introduction DM.pptx
Chapter 01 Introduction DM.pptx
ssuser957b41
 
CS 402 DATAMINING AND WAREHOUSING -MODULE 5
CS 402 DATAMINING AND WAREHOUSING -MODULE 5CS 402 DATAMINING AND WAREHOUSING -MODULE 5
CS 402 DATAMINING AND WAREHOUSING -MODULE 5
NIMMYRAJU
 
Pattern Discovery Using Apriori and Ch-Search Algorithm
 Pattern Discovery Using Apriori and Ch-Search Algorithm Pattern Discovery Using Apriori and Ch-Search Algorithm
Pattern Discovery Using Apriori and Ch-Search Algorithm
ijceronline
 

Similar to Class Comparisions Association Rule (20)

6 module 4
6 module 46 module 4
6 module 4
 
Apriori Algorithm.pptx
Apriori Algorithm.pptxApriori Algorithm.pptx
Apriori Algorithm.pptx
 
Data mining techniques unit III
Data mining techniques unit IIIData mining techniques unit III
Data mining techniques unit III
 
IRJET-Comparative Analysis of Apriori and Apriori with Hashing Algorithm
IRJET-Comparative Analysis of  Apriori and Apriori with Hashing AlgorithmIRJET-Comparative Analysis of  Apriori and Apriori with Hashing Algorithm
IRJET-Comparative Analysis of Apriori and Apriori with Hashing Algorithm
 
Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084
 
Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084Volume 2-issue-6-2081-2084
Volume 2-issue-6-2081-2084
 
Association rules apriori algorithm
Association rules   apriori algorithmAssociation rules   apriori algorithm
Association rules apriori algorithm
 
Discovering Frequent Patterns with New Mining Procedure
Discovering Frequent Patterns with New Mining ProcedureDiscovering Frequent Patterns with New Mining Procedure
Discovering Frequent Patterns with New Mining Procedure
 
J017114852
J017114852J017114852
J017114852
 
A classification of methods for frequent pattern mining
A classification of methods for frequent pattern miningA classification of methods for frequent pattern mining
A classification of methods for frequent pattern mining
 
Dm unit ii r16
Dm unit ii   r16Dm unit ii   r16
Dm unit ii r16
 
Associations.ppt
Associations.pptAssociations.ppt
Associations.ppt
 
B04503019030
B04503019030B04503019030
B04503019030
 
Mining single dimensional boolean association rules from transactional
Mining single dimensional boolean association rules from transactionalMining single dimensional boolean association rules from transactional
Mining single dimensional boolean association rules from transactional
 
Scalable frequent itemset mining using heterogeneous computing par apriori a...
Scalable frequent itemset mining using heterogeneous computing  par apriori a...Scalable frequent itemset mining using heterogeneous computing  par apriori a...
Scalable frequent itemset mining using heterogeneous computing par apriori a...
 
Interval intersection
Interval intersectionInterval intersection
Interval intersection
 
Chapter 01 Introduction DM.pptx
Chapter 01 Introduction DM.pptxChapter 01 Introduction DM.pptx
Chapter 01 Introduction DM.pptx
 
CS 402 DATAMINING AND WAREHOUSING -MODULE 5
CS 402 DATAMINING AND WAREHOUSING -MODULE 5CS 402 DATAMINING AND WAREHOUSING -MODULE 5
CS 402 DATAMINING AND WAREHOUSING -MODULE 5
 
A1030105
A1030105A1030105
A1030105
 
Pattern Discovery Using Apriori and Ch-Search Algorithm
 Pattern Discovery Using Apriori and Ch-Search Algorithm Pattern Discovery Using Apriori and Ch-Search Algorithm
Pattern Discovery Using Apriori and Ch-Search Algorithm
 

Recently uploaded

DESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABS
DESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABSDESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABS
DESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABS
itech2017
 
一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理
一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理
一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理
ydteq
 
Final project report on grocery store management system..pdf
Final project report on grocery store management system..pdfFinal project report on grocery store management system..pdf
Final project report on grocery store management system..pdf
Kamal Acharya
 
DfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributionsDfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributions
gestioneergodomus
 
Planning Of Procurement o different goods and services
Planning Of Procurement o different goods and servicesPlanning Of Procurement o different goods and services
Planning Of Procurement o different goods and services
JoytuBarua2
 
An Approach to Detecting Writing Styles Based on Clustering Techniques
An Approach to Detecting Writing Styles Based on Clustering TechniquesAn Approach to Detecting Writing Styles Based on Clustering Techniques
An Approach to Detecting Writing Styles Based on Clustering Techniques
ambekarshweta25
 
Recycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part IIIRecycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part III
Aditya Rajan Patra
 
Nuclear Power Economics and Structuring 2024
Nuclear Power Economics and Structuring 2024Nuclear Power Economics and Structuring 2024
Nuclear Power Economics and Structuring 2024
Massimo Talia
 
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&BDesign and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Sreedhar Chowdam
 
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
Amil Baba Dawood bangali
 
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Dr.Costas Sachpazis
 
digital fundamental by Thomas L.floydl.pdf
digital fundamental by Thomas L.floydl.pdfdigital fundamental by Thomas L.floydl.pdf
digital fundamental by Thomas L.floydl.pdf
drwaing
 
Hierarchical Digital Twin of a Naval Power System
Hierarchical Digital Twin of a Naval Power SystemHierarchical Digital Twin of a Naval Power System
Hierarchical Digital Twin of a Naval Power System
Kerry Sado
 
Fundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptxFundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptx
manasideore6
 
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
MdTanvirMahtab2
 
14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application
SyedAbiiAzazi1
 
PPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testingPPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testing
anoopmanoharan2
 
Cosmetic shop management system project report.pdf
Cosmetic shop management system project report.pdfCosmetic shop management system project report.pdf
Cosmetic shop management system project report.pdf
Kamal Acharya
 
Literature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptxLiterature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptx
Dr Ramhari Poudyal
 
一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理
一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理
一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理
zwunae
 

Recently uploaded (20)

DESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABS
DESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABSDESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABS
DESIGN AND ANALYSIS OF A CAR SHOWROOM USING E TABS
 
一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理
一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理
一比一原版(UofT毕业证)多伦多大学毕业证成绩单如何办理
 
Final project report on grocery store management system..pdf
Final project report on grocery store management system..pdfFinal project report on grocery store management system..pdf
Final project report on grocery store management system..pdf
 
DfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributionsDfMAy 2024 - key insights and contributions
DfMAy 2024 - key insights and contributions
 
Planning Of Procurement o different goods and services
Planning Of Procurement o different goods and servicesPlanning Of Procurement o different goods and services
Planning Of Procurement o different goods and services
 
An Approach to Detecting Writing Styles Based on Clustering Techniques
An Approach to Detecting Writing Styles Based on Clustering TechniquesAn Approach to Detecting Writing Styles Based on Clustering Techniques
An Approach to Detecting Writing Styles Based on Clustering Techniques
 
Recycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part IIIRecycled Concrete Aggregate in Construction Part III
Recycled Concrete Aggregate in Construction Part III
 
Nuclear Power Economics and Structuring 2024
Nuclear Power Economics and Structuring 2024Nuclear Power Economics and Structuring 2024
Nuclear Power Economics and Structuring 2024
 
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&BDesign and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
 
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
 
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
 
digital fundamental by Thomas L.floydl.pdf
digital fundamental by Thomas L.floydl.pdfdigital fundamental by Thomas L.floydl.pdf
digital fundamental by Thomas L.floydl.pdf
 
Hierarchical Digital Twin of a Naval Power System
Hierarchical Digital Twin of a Naval Power SystemHierarchical Digital Twin of a Naval Power System
Hierarchical Digital Twin of a Naval Power System
 
Fundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptxFundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptx
 
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
 
14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application14 Template Contractual Notice - EOT Application
14 Template Contractual Notice - EOT Application
 
PPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testingPPT on GRP pipes manufacturing and testing
PPT on GRP pipes manufacturing and testing
 
Cosmetic shop management system project report.pdf
Cosmetic shop management system project report.pdfCosmetic shop management system project report.pdf
Cosmetic shop management system project report.pdf
 
Literature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptxLiterature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptx
 
一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理
一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理
一比一原版(UMich毕业证)密歇根大学|安娜堡分校毕业证成绩单专业办理
 

Class Comparisions Association Rule

  • 1. DMBI(2170715) Class Comparisons Association Rule Mining Made By: Tarang Desai 140950107100 CSE – B 7th Semester
  • 2. Association Rule Mining • Association rules are if/then statements that help uncover relationships between seemingly unrelated data in a relational database or other information repository. • Association rules are created by analysing data for frequent if/then patterns and using the criteria support and confidence to identify the most important relationships. Support is an indication of how frequently the items appear in the database. Confidence indicates the number of times the if/then statements have been found to be true.
  • 3. Association Rule Mining • In data mining, association rules are useful for analysing and predicting customer behaviour. They play an important part in shopping basket data analysis, product clustering, catalogue design and store layout. • Programmers use association rules to build programs capable of machine learning. Machine learning is a type of artificial intelligence (AI) that seeks to build programs with the ability to become more efficient without being explicitly programmed.
  • 4. Class Comparisons Association Rule Mining • Several algorithms have been proposed in the literature to address the problem of mining association rules. • It seems to be the most common and popular problem. • The method for generating the frequent patterns are divided in 2 categories: • Sequential Methods • Parallel Methods
  • 5. Sequential Methods • Sequential pattern mining is a case of structured data mining. • It forms the foundation of most known algorithms. • A sequence database contains some sequences. For example, consider the following database: • This database contains four sequences named seq1, seq2, seq3 and seq4.
  • 6. Sequential Methods • For our example, consider that the symbols “a”, “b”, “c”, d”, “e”, “f”, “g” and “h” respectively represents some items sold in a supermarket. For example, “a” could represent an “apple”, “b” could be some “bread”, etc. • Now, a sequence is an ordered list of sets of items. For our example, we will assume that each sequence represents what a customer has bought in our supermarket over time. For example, consider the second sequence “seq2”. This sequence indicates that the second customer bought items “a” and “d” together, than bought item “c”, then bought “b”, and then bought “a”, “b”, “e” and “f” together.
  • 7. Simple Apriori • Simple Apriori algorithm is a two step process. • It is developed by Rakesh Agrawal and Ramakrishnan Srikant in 1994. • The steps are as follows: 1. The join step: To find LK, a set of candidate K-item set is generated by joining LK-1 item itself. The rules for join is that the items should be ordered so we can compare item by item. The join of LK-1 is possible only if its 1st (K-2) items are common. 2. The prune step: The join step will produce all K-item sets, but not all of them are frequent. So scan database to see when join step produce an empty set.
  • 8. Hash Based Apriori • A hash based technique can be applied so that it reduce the size of the candidate K-item set in CK for K>1. • Our main aim is to reduce the number of scans on the database. • For Example: When we scan each transaction in the dataset to generate the frequent 1-item L1 from the candidate 1-itemset C, we can generate all of 2-itemset for each transaction and hash them into corresponding bucket counts in the hash table. H(A,B) = ((Order of A)*10 + (Order of B))mod8
  • 9. Partition Based Apriori • A partition of the database refer to any subset of transaction contained in the database D. • Partition reduces the number of database scans as it divides the database into small partitions such that each partition can be handled in the main memory. • Partition scan database only twice. • Scan 1: Partition database and find local frequent pattern. • Scan 2: Consolidate global frequent pattern, initially the database D is logically partitioned into n partitions.
  • 10. Partition Based Apriori • Phase I: Read the entire database once, takes n iterations. • Input: Pi where i=1…n • Output: Local large item set of all length • Merge Phase: The set of global candidate item sets of length J is computed. • Input: Local large item set of same length from all n partitions • Output: Combine and generate global candidate item sets • Phase II: Read the entire database again, also take n iterations. • Input: PiB where iB=1…n • Output: Counter for each global candidate item set and count their support.
  • 11. Parallel Methods • Parallel algorithm can be implemented over distributed memory system. • Parallel work can be followed. • Each processor gathers the locally frequent item set of all size in 1 pass over their local database. Then all potentially frequent item set are then broadcast to other processor. • Other then each processor gathers the count of these global candidates item sets. There are 2 major approaches for using processor. • Distributed memory machines • Shared memory processor system