Paradualminer: An efficient parallel implementation of the Dualminer algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3056, Issue , 2004, Pages 96-105

  Ting, Roger M H ^a   Bailey, James ^a   Ramamohanarao, Kotagiri ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; CONSTRAINT THEORY; DATABASE SYSTEMS;

COMMUNICATION MECHANISMS; COMMUNICATION OVERHEADS; CONSTRAINT-BASED MINING; ITEM SETS; PARALLEL IMPLEMENTATIONS; PARALLEL VERSION; SEARCH SPACES; SUBALGEBRAS;

DATA MINING;

ANTIMONOTONE; MONOTONES; PARADUALMINER; PARALLEL IMPLEMENTATION;

EID: 7444255648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24775-3_12     Document Type: Conference Paper

References (15)

1. R. Agrawal and J. C. Shafer. Parallel mining of association rules. IEEE Trans. On Knowledge And Data Engineering, 8:962-969, 1996.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of VLDB’94, pages 487-499, 1994.
3. R. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Proceedings of ICDE’99, pages 188-197, 1999.
4. C. Bucila, J. Gehrke, D. Kifer, and W. White. Dualminer: a dual-pruning algorithm for itemsets with constraints. In Proceedings of ACM SIGKDD’02, pages 42-51, 2002.
5. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of ICDE’01, pages 443-452, 2001.
6. D. L. Eager, E. D. Lazowska, and J. Zahorjan. A comparison of receiver-initiated and sender-initiated adaptive load sharing. In Proceedings of ACM SIGMETRICS’ 85, pages 1-3, 1985.
7. E. H. Han, G. Karypis, and V. Kumar. Scalable parallel data mining for association rules. In Proceedings of SIGMOD’97, pages 277-288, 1997.
8. R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rules. In Proceedings of SIGMOD’98, pages 13-24, 1998.
9. S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. Adaptive and resource-aware mining of frequent sets. In Proceedings of ICDM’02, page 338, 2002.
10. J. Pei, J. Han, and L. Lakshmanan. Mining frequent item sets with convertible constraints. In Proceedings of ICDE’01, pages 433-442, 2001.
11. P. Sanders. A detailed analysis of random polling dynamic load balancing. In Proceedings of ISPAN’94, pages 382-389, 1994.
12. P. Sanders. Asynchronous random polling dynamic load balancing. In Proceedings of ISAAC’99,, page 39, 1999.
13. L. D. Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragment finding. In Proceedings of IJCAI’01, pages 853-8622, 2001.
14. O. Zaiane, M. El-Hajj, and P. Lu. Fast parallel association rule mining without candidacy generation. In Proceedings of ICDM’01, pages 665-668, 2001.
15. M. Zaki, W. Li, and S. Parthasarathy. Customized dynamic load balancing for a network of workstations. Journal of Parallel and Distributed Computing, 43(2):156-162, 1997