Performance study of distributed Apriori-like frequent itemsets mining
- 16 April 2009
- journal article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 23 (1) , 55-72
Abstract
No abstract availableKeywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Grid-Based Approaches for Distributed Data Mining ApplicationsJournal of Algorithms & Computational Technology, 2009
- A scalable algorithm for mining maximal frequent sequences using a sampleKnowledge and Information Systems, 2007
- Tight upper bounds on the number of candidate patternsACM Transactions on Database Systems, 2005
- ASKALON: a tool set for cluster and Grid computingConcurrency and Computation: Practice and Experience, 2005
- ODAM: an optimized distributed association rule mining algorithmIEEE Distributed Systems Online, 2004
- Viewpoint: From TeraGrid to knowledge gridCommunications of the ACM, 2001
- A Java commodity grid kitConcurrency and Computation: Practice and Experience, 2001
- Parallel and distributed association mining: a surveyIEEE Concurrency, 1999
- Efficient mining of association rules in distributed databasesIEEE Transactions on Knowledge and Data Engineering, 1996
- Parallel mining of association rulesIEEE Transactions on Knowledge and Data Engineering, 1996