Adaptive parallel graph mining for CMP architectures

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 97-106

  Buehrer, Gregory ^a   Parthasarathy, Srinivasan ^a   Chen, Yen Kuang ^a  

^a Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHIP MULTIPROCESSORS (CMPS); FRAUD DETECTION; MOLECULAR SUBSTRUCTURE; SHARED MEMORY SYSTEMS (SMPS); SOCIAL NETWORK ANALYSIS; WEB LINK ANALYSIS;

ADAPTIVE ALGORITHMS; COMPUTER ARCHITECTURE; DATABASE SYSTEMS; GRAPH THEORY; MICROPROCESSOR CHIPS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCALABILITY; USER INTERFACES; WORLD WIDE WEB;

DATA MINING;

EID: 63549099398     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.15     Document Type: Conference Paper

References (21)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the International Conference on Management of Data (SIGMOD), 1993.
2. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley Longman, 1986.
3. G. Buehrer, S. Parthasarathy, A. Nguyen, D. Kim, Y. Chen, and P. Dubey. Towards data mining on emerging architectures. In Proceedings of the 2006 SIAM DM High Performance Data Mining Workshop, 2006.
4. D. J. Cook, L. B. Holder, G. Galai, and R. Maglothin. Approaches to parallel graph-based knowledge discovery, volume 61, pages 427-446, Orlando, FL, USA, 2001. Academic Press, Inc.
5. L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compounds. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, pages 30-36. AAAI Press, 1998.
6. V. Guralnik and G. Karypis. Dynamic load balancing algorithms for sequence mining. In Univeristy of Minnesota Technical Report TR 00-056, 2001.
7. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), 2000.
8. E.-Y. Kim, M. Busch, K. Abel, L. Fritts, P. Bustamante, J. Stanton, D. Lu, S. Wu, J. Glowczwskie, T. Rourke, D. Bogdan, M. Piatak, J. D. Lifson, R. Desrosiers, S. Wolinsky, and C. Miller. Retroviral recombination in vivo: Viral replication patterns and genetic structure of simian immunodeficiency virus (siv) populations in rhesus macaques after simultaneous or sequential intravaginal inoculation with sivmac239vpx/vpr and sivmac239nef. In Journal of Virology, volume 79, pages 4886 - 4895, 2005.
9. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proceedings of the Internation Conference on Data Mining (ICDM), pages 313-320, 2001.
10. E. Markatos and T. Leblanc. Using processor affinity in loop scheduling on shared-memory multiprocessors. In IEEE Transactions on Parallel and Distributed Systems, 1993.
11. T. Meinl, I. Fischer, and M. Philippsen. Parallel mining for frequent fragments on a shared-memory multiprocessor -results and java-obstacles-. In M. Bauer, A. Kroner, and B. Brandherm, editors, LWA 2005 ?Beitrage zur GI-Workshopwoche Lernen, Wissensentdeckung, Adaptivitat, pages 196-201, 2005.
12. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In Proceedings of the 10th International Conference on Knowledge Discovery and Data mining (KDD), pages 647-652, New York, NY, USA, 2004. ACM Press.
13. S. Parthasarathy. Active data mining in a distributed setting. In University of Rochester Ph.D. Thesis, 2000.
14. S. Parthasarathy and M. Coatney. Efficient discovery of common substructures in macromolecules. In Proceedings of the IEEE International Conference on Data Mining (ICDM), 2002.
15. S. Parthasarathy, M. J. Zaki, M. Ogihara, and W. Li. Parallel data mining for association rules on shared-memory systems. In Knowledge and Information Systems, volume 3, pages 1-29, 2001.
16. J. Punin, M. Krishnamoorthy, and M. J. Zaki. Logml - log markup language for web usage mining. In WEBKDD Workshop: Mining Log Data Across All Customer TouchPoints (with SIGKDD01), 2001.
17. A. Termier, M.-C. Rousset, and M. Sebag. Treefinder: a first step towards xml data mining. In International Conference on Data Mining ICDM02, 2002.
18. C. Wang and S. Parthasarathy. Parallel algorithms for mining frequent structural motifs in scientific data. In Proceedings of the ACM International Conference on Supercomputing (ICS), 2004.
19. M. Wörlein, T. Meinl, I. Fischer, and M. Philippsen. A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. In The 9th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), Porto, Portugal, 2005.
20. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proceedings of the 2002 International Conference on Data Mining (ICDM), 2002.
21. M. Zaki. Parallel sequence mining on shared-memory machines. In Journal of Parallel and Distributed Computing, volume 61, pages 401-426, 2001.