An improved Apriori algorithm for mining association rules
Author:
- 1 January 2017
- conference paper
- Published by AIP Publishing in AIP Conference Proceedings
Abstract
Among mining algorithms based on association rules, Apriori technique, mining frequent itermsets and interesting associations in transaction database, is not only the first used association rule mining technique but also the most popular one. After studying, it is found out that the traditional Apriori algorithms have two major bottlenecks: scanning the database frequently; generating a large number of candidate sets. Based on the inherent defects of Apriori algorithm, some related improvements are carried out: 1) using new database mapping way to avoid scanning the database repeatedly; 2) further pruning frequent itemsets and candidate itemsets in order to improve joining efficiency; 3) using overlap strategy to count support to achieve high efficiency. Under the same conditions, the results illustrate that the proposed improved Apriori algorithm improves the operating efficiency compared with other improved algorithms.Keywords
This publication has 11 references indexed in Scilit:
- Association rules mining based analysis of consequential alarm sequences in chemical processesJournal of Loss Prevention in the Process Industries, 2016
- Improvised Apriori Algorithm Using Frequent Pattern Tree for Real Time Applications in Data MiningProcedia Computer Science, 2015
- A new data mining methodology for generating new service ideasInformation Systems and e-Business Management, 2014
- Frequent item set miningWIREs Data Mining and Knowledge Discovery, 2012
- Discovering frequent patterns in sensitive data2010
- Towards personalized recommendation by two-step modified Apriori data mining algorithmExpert Systems with Applications, 2008
- BitTableFI: An efficient mining frequent itemsets algorithmKnowledge-Based Systems, 2007
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000
- Parallel and distributed association mining: a surveyIEEE Concurrency, 1999
- Using a hash-based method with transaction trimming for mining association rulesIEEE Transactions on Knowledge and Data Engineering, 1997