Ma, LinLin (2012) Taxonomy-Based Pruning in Generalized Frequent Itemsets Mining. Masters thesis, Concordia University.
Preview |
Text (application/pdf)
897kBMa_MSc_S2012.pdf - Submitted Version |
Abstract
The original purpose of data mining is for analysis of supermarket transaction data. Now with the rapid development in business, industry and science, data mining is used in lots of domains, so mining interesting information from large database becomes more important. Data mining includes two main parts: frequent itemsets mining and association rules mining. And frequent itemsets mining plays an essential role between them.
Our thesis is focused on frequent itemsets mining. Previous studies on frequent itemsets mining is at single or multiple concept level, however, mining frequent itemsets at flexible multiple concept level may help finding more specific and useful information from huge data. In this thesis, four methods are introduced for mining frequent itemsets at flexible multiple level by extension of Apriori and Eclat algorithms. We also implement two algorithms for frequent pairs mining. We draw some conclusions about which method is suitable for which distributions of data.
Divisions: | Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering |
---|---|
Item Type: | Thesis (Masters) |
Authors: | Ma, LinLin |
Institution: | Concordia University |
Degree Name: | M. Comp. Sc. |
Program: | Computer Science |
Date: | 12 April 2012 |
Thesis Supervisor(s): | Gosta, Grahne |
ID Code: | 974029 |
Deposited By: | LIN LIN MA |
Deposited On: | 20 Jun 2012 13:07 |
Last Modified: | 18 Jan 2018 17:37 |
Repository Staff Only: item control page