Efficient mining frequent itemsets algorithms
- 26 May 2013
- journal article
- research article
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 5 (6) , 823-833
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- On knowledge acquisition in multi-scale decision systemsInternational Journal of Machine Learning and Cybernetics, 2012
- Index-BitTableFI: An improved algorithm for mining frequent itemsetsKnowledge-Based Systems, 2008
- BitTableFI: An efficient mining frequent itemsets algorithmKnowledge-Based Systems, 2007
- Association miningACM Computing Surveys, 2006
- Tree-based partitioning of date for association rule miningKnowledge and Information Systems, 2006
- GenMax: An Efficient Algorithm for Mining Maximal Frequent ItemsetsData Mining and Knowledge Discovery, 2005
- An efficient cluster and decomposition algorithm for mining association rulesInformation Sciences, 2004
- Constrained frequent pattern miningACM SIGKDD Explorations Newsletter, 2002
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000
- Efficiently mining long patterns from databasesACM SIGMOD Record, 1998