Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast sequential and parallel algorithms for association rule mining: a comparison
Fast sequential and parallel algorithms for association rule mining: a comparison
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Advances in knowledge discovery and data mining
Advances in knowledge discovery and data mining
Fast discovery of association rules
Advances in knowledge discovery and data mining
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Depth first generation of long patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Computer
Scalable Parallel Data Mining for Association Rules
IEEE Transactions on Knowledge and Data Engineering
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Mining Association Rules: Anti-Skew Algorithms
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Evaluation of sampling for data mining of association rules
RIDE '97 Proceedings of the 7th International Workshop on Research Issues in Data Engineering (RIDE '97) High Performance Database Management for Large-Scale Applications
Data Organization and Access for Efficient Data Mining
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Scheduling High Performance Data Mining Tasks on a Data Grid Environment
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
BISC: A bitmap itemset support counting approach for efficient frequent itemset mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
Building associated semantic overlay for discovering associated services
ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Detection of malicious applications on Android OS
IWCF'10 Proceedings of the 4th international conference on Computational forensics
Programming relational databases for Itemset mining over large transactional tables
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
A relational query primitive for constraint-based pattern mining
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
International Journal of Distributed Systems and Technologies
pcApriori: scalable apriori for multiprocessor systems
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
| Hi-index | 0.02 |
In this paper we propose DCP, a new algorithm for solving the Frequent Set Counting problem, which enhances Apriori. Our goal was to optimize the initial iterations of Apriori, i.e. the most time consuming ones when datasets characterized by short or medium length frequent patterns are considered. The main improvements regard the use of an innovative method for storing candidate set of items and counting their support, and the exploitation of effective pruning techniques which significantly reduce the size of the dataset as execution progresses.