Parallel mining for frequent fragments on a shared-memory multiprocessor - Results and java-obstacles

Lernen, Wissensentdeckung und Adaptivitat, LWA 2005

Volumn , Issue , 2005, Pages

  Meinl, Thorsten ^a   Fischer, Ingrid ^a   Philippsen, Michael ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN SPACES; FREQUENT SUBGRAPHS; JAVA TECHNOLOGIES; PARALLEL MININGS; PARALLEL VERSION; PARALLELIZATIONS; SEARCH SPACES; SHARED MEMORIES; SHARED MEMORY MULTIPROCESSOR;

ALGORITHMS;

EID: 84874006791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. SciMark 2.0. http://math.nist.gov/scimark2/.
2. Rakesh Agrawal, Tomasz Imielinski, and Arun N. Swami. Mining Association Rules between Sets of Items in Large Databases. In Peter Buneman and Sushil Jajodia, editors, Proc. 1993 ACM SIGMOD Int'l Conf. on Management of Data, pages 207-216, Washington, D.C., USA, 1993. ACM Press.
3. Rakesh Agrawal and John C. Shafer. Parallel Mining of Association Rules. IEEE Trans. on Knowledge And Data Engineering, 8(6):962-969, December 1996.
4. Gene Amdahl. Validity of the single processor approach to achieving large-scale computing capabilities. In AFIPS Conference Proceedings, pages 483-485, 1967.
5. Christian Borgelt and Michael R. Berthold. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In Proc. IEEE Int'l Conf. on Data Mining ICDM, pages 51-58, Maebashi City, Japan, November 2002.
6. Christian Borgelt, Thorsten Meinl, and Michael R. Berthold. Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments. InWil Thissen, PeterWieringa, Maja Pantic, and Marcel Ludema, editors, Proc. of the 2004 IEEE Conf. on Systems, Man and Cybernetics, SMC 2004, pages 4565-4570, Den Haag, The Netherlands, October 2004.
7. Jong-Deok Choi, Manish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, and Sam Midkiff. Escape analysis for java. In OOPSLA '99: Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pages 1-19, New York, NY, USA, 1999. ACM Press.
8. D. J. Cook, L. B. Holder, G. Galal, and R. Maglothin. Approaches to parallel graph-based knowledge discovery. Journal of Parallel and Distributed Computing, 61(3):427-446, 2001.
9. Yongqiao Xiao David W. Cheung, Sau D. Lee. Effect of data skewness and workload balance in parallel data mining. IEEE Transaction on Knowledge and Data Engineering, 14(3):498-514, May/June 2002.
10. Tamar Domani, Gal Goldstein, Elliot K. Kolodner, Ethan Lewis, Erez Petrank, and Dafna Sheinwald. Thread-local heaps for Java. SIGPLAN Not., 38(2 supplement):76-87, February 2003.
11. Giuseppe Di Fatta and Michael R. Berthold. Distributed Mining of Molecular Fragments. In Stat Matwin, editor, IEEE Int'l Conf. on Data Mining, Workshop on Data Mining and the Grid, pages 1-9, Edinburgh, UK, November 2004.
12. Ingrid Fischer and Thorsten Meinl. Subgraph Mining. In J. Wang, editor, Encyclopedia of Data Warehousing and Mining, pages 1059-1063. Idea Group Reference, Hershey, PA, USA, July 2005.
13. Eui-Hong Han, George Karypis, and Vipin Kumar. Scalable Parallel Data Mining for Association Rules. In Proc. 1997 ACM SIGMOD Int'l Conf. on Management of Data, pages 277-288, Tucson, AZ, USA, May 1997.
14. Heiko Hofer, Christian Borgelt, and Michael R. Berthold. Large Scale Mining of Molecular Fragments with Wildcards. In Advances in Intelligent Data Analysis, number 2810 in Lecture Notes in Computer Science, pages 380-389. Springer, 2003.
15. Jun Huan,WeiWang, and Jan Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proc. of the 3rd IEEE Intl. Conf. on Data Mining ICDM, pages 549-552, Melbourne, FL, USA, November 2003. IEEE Press.
16. Vipin Kumar and V. Nageshwara Rao. Parallel Depth-First Search. Int'l J. of Parallel Programming, 16(6):501-519, December 1987.
17. Michihiro Kuramochi and George Karypis. An efficient algorithm for discovering frequent subgraphs. IEEE Trans. on Knowledge and Data Engineering, 16(9):1038-1051, September 2004.
18. Brendan McKay. Practical Graph Isomorphism. Congressus Numerantium, 30:45-87, 1981.
19. Thorsten Meinl, Christian Borgelt, and Michael R. Berthold. Mining Fragments with Fuzzy Chains in Molecular Databases. In Joost N. Kok and Takashi Washio, editors, Proc. of the Workshop W7 on Mining Graphs, Trees and Sequences (MGTS '04), pages 49-60, Pisa, Italy, September 2004.
20. Joseph D. Mocker. A collection of JVM options. http://blogs.sun.com/ roller/resources/watt/jvm-optionslist.html, May 2005.
21. NCI. National Cancer Institute, DTP AIDS Antiviral Screen. http://dtp.nci.nih.gov/docs/aids/aidsdata.html, March 1999.
22. Siegfried Nijssen and Joost N. Kok. A Quickstart in Frequent Structure Mining can Make a Difference:. In Ronny Kohavi, Johannes Gehrke, William DuMouchel, and Joydeep Gosh, editors, Proc. of the 10th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD2004), pages 647-652, New York, NY, USA, August 2004. ACM Press.
23. Jong Soo Park, Ming-Syan Chen, and Philip S. Yu. Efficient parallel data mining for association rules. In CIKM '95: Proc. of the fourth international conference on Information and knowledge management, pages 31-36, New York, NY, USA, 1995. ACM Press.
24. K. Kuiper R. Dimpsey, R. Arora. Java server performance: A case study of building efficient, scalable JVMs. IBM SYSTEMS JOURNAL, 39(1):151-175, 2000.
25. Silicon Graphics, Inc. SGI Altix 3000. http://www.sgi.com/products/ servers/altix/index.html, July 2005.
26. Sun Microsystems, Inc. Frequently asked questions about the Java HotSpot VM. http://java.sun.com/docs/hotspot/PerformanceFAQ.html#15, July 2005.
27. Sun Microsystems, Inc. Threading. http://java.sun.com/docs/hotspot/ threads/threads.html, July 2005.
28. Xifeng Yan and Jiawei Han. gSpan: Graph-Based Substructure Pattern Mining. In Proc. IEEE Int'l Conf. on Data Mining ICDM, pages 721-723, Maebashi City, Japan, November 2002.
29. Mohammed J. Zaki. Parallel and Distributed Association Mining: A Survey. IEEE Concurrency, 7(4):14-25, December 1999.
30. Mohammed J. Zaki, Srinivasan Parthasarathy, and Wei Li. A Localized Algorithm for Parallel Association Mining. In ACM Symp. Parallel Algorithms and Architectures, pages 321-330, Newport, RI, USA, June 1997.
31. Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li. New Algorithms for Fast Discovery of Association Rules. In David Heckerman, Heikki Mannila, Daryl Pregibon, Ramasamy Uthurusamy, and Menlo Park, editors, Proc. of 3rd Int'l Conf. on Knowledge Discovery and Data Mining, pages 283-296. AAAI Press, August 1997.