• Corpus ID: 6445710

CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure

@inproceedings{Sucahyo2004CTPROAB,
  title={CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure},
  author={Yudho Giri Sucahyo and Raj P. Gopalan},
  booktitle={Workshop on Frequent Itemset Mining Implementations},
  year={2004}
}
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active research area and a large number of algorithms have been developed. In this paper, we propose another pattern growth algorithm which uses a more compact data structure named Compressed FP-Tree (CFP-Tree). The number of nodes in a CFP-Tree can be up to half less than in the corresponding FP-Tree. We also describe the… 

Figures from this paper

Modified FP-Growth: An Efficient Frequent Pattern Mining Approach from FP-Tree

A new pattern growth algorithm called Modified FP-Growth (MFP-G growth), which uses both top-down and bottom-up approaches to efficiently generate the frequent patterns without recursively constructing the MCFP-tree.

F-Miner: A New Frequent Itemsets Mining Algorithm

In this paper, we present a novel algorithm, called F-Miner, to mine the complete set of frequent itemsets by pattern growth. The F-Miner algorithm uses two new compact data structures, ascending

NCFP-tree: A Non-Recursive Approach to CFP-tree using Single Conditional Database

The experimental results show that the proposed non-recursive algorithm NCFPGEN for creating a NCFP-tree outperforms the existing method such as CFP- tree in both memory consumption and execution time aspects.

Mining Frequent Patterns based on Compressed FP-tree without Conditional FP-tree Generation

A new algorithm Temporary Root growth based on Compressed FP- tree, i.e. TR-CFP, is proposed, which employs a temporary root constructing thought during mining on a CFP- tree without conditional FP-tree generation and which has a particular character other than Apriori and FP-growth that it can specially mine frequent patterns of the designated length dynamically and efficiently.

Efficient mining frequent itemsets algorithms

This method is developed to avoid the costly candidate-generation-and-test processing completely and to avoid expensive, and repeated database scans, and a comprehensive performance study shows that the techniques are efficient and scalable comparing with other methods.

Efficient mining frequent itemsets algorithms

This method is developed to avoid the costly candidate-generation-and-test processing completely and to avoid expensive, and repeated database scans, and a comprehensive performance study shows that the techniques are efficient and scalable comparing with other methods.

On a Parallel Spark Workflow for Frequent Itemset Mining Based on Array Prefix-Tree

An Array Prefix-Tree Growth (APT-Growth) algorithm is proposed, which explicitly obviates the need of recursively constructing conditional FP-Tree as required by FP-G growth and sheds light on its potential applications to big data mining.

Optimization of High Utility Itemset Mining from Large Transaction Databases on multi-core processor

This paper presents an algorithm that takes features of CTU-PROL with pattern growth based on a compact utility pattern tree data structure and shows a remarkable speedup for large datasets than the previous algorithms.

EFFICIENTLY MINING FREQUENT ITEMSETS IN TRANSACTIONAL DATABASES

Experimental results indicate that the new approach for mining frequent item sets from a transactional database without building the conditional FP-trees can reduce lots of running time and memory usage based on the datasets obtained from the FIMI repository website.

A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets

A new algorithm called CTU-PRO is proposed that mines high utility itemsets by bottom up traversal of a compressed utility pattern (CUP) tree and the results show that the algorithm works more efficiently.
...

References

SHOWING 1-10 OF 29 REFERENCES

CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth

The performance study shows that the new algorithm significantly reduces the processing time for mining complete sets of frequent item sets from dense data sets that contain relatively long patterns.

High Performance Frequent Patterns Extraction using Compressed FP-Tree

A new data structure named Compressed FP-Tree (CFP-Tree) and an algorithm named CTPRO that performs better than the current algorithms including FP-Growth, OpportuneProject, and Apriori that are empirically compared using datasets that reveal the effective performance range of these algorithms.

Mining frequent item sets by opportunistic projection

This paper presents a novel algorithm Opportune Project for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree, and proposes novel methods to build tree-based pseudo projections and array-based unfiltered projections for projected transaction subsets.

CHARM: An Efficient Algorithm for Closed Itemset Mining

CHARM is an efficient algorithm for mining all frequent closed itemsets that enumerates closed sets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels, and uses a technique called diffsets to reduce the memory footprint of intermediate computations.

Fast Algorithms for Mining Association Rules

Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.

Mining frequent patterns with counting inference

It is shown that the support of frequent non-key patterns can be inferred from frequent key patterns without accessing the database, and PASCAL is among the most efficient algorithms for mining frequent patterns.

LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets

Three algorithms LCMfreq, LCM, and LCMmax for mining all frequent sets, frequent closed item sets, and maximal frequent sets from transaction databases are proposed and found that they are fast on large real world datasets with natural distributions such as KDD-cup2000 datasets, and many other synthetic databases.

Mining sequential patterns

  • R. AgrawalR. Srikant
  • Computer Science
    Proceedings of the Eleventh International Conference on Data Engineering
  • 1995
Three algorithms are presented to solve the problem of mining sequential patterns over databases of customer transactions, and empirically evaluating their performance using synthetic data shows that two of them have comparable performance.

kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets

The implementation of kDCI is presented, an enhancement of DCI, a scalable algorithm for discovering frequent sets in large databases, based on a novel counting inference strategy, inspired by previously known results by Basted et al.

Adaptive and resource-aware mining of frequent sets

DCI (Direct Count & Intersect), an efficient algorithm for discovering frequent sets from large databases, is presented, which can adapt its behavior not only to the features of the specific computing platform, but also to the Features of the dataset being mined, so that it results very effective in mining both short and long patterns from sparse and dense datasets.