TFI-Apriori: Using new encoding to optimize the apriori algorithm
Authors:
- 27 June 2018
- journal article
- research article
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 22 (4) , 807-827
Abstract
In this paper we propose a new optimization for Apriori-based association rule mining algorithms where the frequency of items can be encoded and treated in a special manner drastically increasing the efficiency of the frequent itemset mining process.Keywords
This publication has 25 references indexed in Scilit:
- Top 10 algorithms in data miningKnowledge and Information Systems, 2007
- A new approach to mine frequent patterns using item-transformation methodsInformation Systems, 2007
- BitTableFI: An efficient mining frequent itemsets algorithmKnowledge-Based Systems, 2007
- Frequent pattern mining: current status and future directionsData Mining and Knowledge Discovery, 2007
- Algorithms for association rule mining — a general survey and comparisonACM SIGKDD Explorations Newsletter, 2000
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000
- Efficiently mining long patterns from databasesACM SIGMOD Record, 1998
- Using a hash-based method with transaction trimming for mining association rulesIEEE Transactions on Knowledge and Data Engineering, 1997
- Set-oriented data mining in relational databasesData & Knowledge Engineering, 1995
- Trie memoryCommunications of the ACM, 1960