Graph based molecular data mining - An overview

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn 5, Issue , 2004, Pages 4578-4582

  Fischer, Ingrid ^a   Meinl, Thorsten ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Fragments; Graph mining; Molecules

Indexed keywords

ARBITRARY GRAPHS; FRAGMENTS; GRAPH MINING; INDUCTIVE LOGIC PROGRAMMING;

ALGORITHMS; COMPUTER AIDED DESIGN; DATA REDUCTION; DATABASE SYSTEMS; GRAPH THEORY; LOGIC PROGRAMMING; MOLECULES; PATTERN RECOGNITION; PROTEINS; XML;

DATA MINING;

EID: 15744402504     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2004.1401253     Document Type: Conference Paper

References (25)

1. R. Agrawal, T. Imielinski, and A. N. Swami, "Mining association rules between sets of items in large databases," in Proceedings of the 1993 ACM SIGMOD Intl. Conf. on Management of Data, P. Buneman and S. Jajodia, Eds. Washington, D.C., USA: ACM Press, 1993, pp. 207-216.
2. C. Borgelt and M. R. Berthold, "Mining molecular fragments: Finding relevant substructures of molecules," in Proceedings of the IEEE Intl. Conf. on Data Mining ICDM. Piscataway, NJ, USA: IEEE Press, 2002, pp. 51-58.
3. C. Borgelt, T. Meinl, and M. R. Berthold, "Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments," October 2004, to appear in the Proceedings of SMC 2004, Den Haag, The Netherlands.
4. D. J. Cook and L. B. Holder, "Graph-based data mining," IEEE Intelligent Systems, vol. 15, no. 2, pp. 32-41, 2000.
5. D. J. Cook, N. Manocha, and L. B. Holder, "Us-ing a graph-based data mining system to perform web search," International Journal of Pattern Recognition and Artificial Intelligence, vol. 17, no. 5, pp. 705-720, 2003.
6. M. Deshpande, M. Kuramochi, and G. Karypis, "Automated approaches for classifying structures," in Proceedings of the second Workshop on Data Mining in Bioinformatics, 200.
7. P. Finn, S. Muggleton, D. Page, and A. Srinivasan, "Pharmacophore discovery using the inductive logic programming system Progol," Machine Learning, vol. 30, pp. 241-271, 1998.
8. J. Han and X. Van, "Closegraph: Mining closed frequent graph patterns," in Proceedings of the ninth ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining. ACM Press, August 2003, pp. 286-295.
9. C. Helma, S. Kramer, and L. de Raedt, "The molecular feature miner molfea," in Proceedings of the Beilstein-Institut Workshop, M. G. Hicks and C. Kettner, Eds., May 2002.
10. H. Hofer, C. Borgelt, and M. R. Berthold, "Large scale mining of molecular fragments with wildcards," in Advances in Intelligent Data Analysis V, ser. Lecture Notes in Computer Science (LNCS). Springer Verlag, 2003, no. 2810, pp. 380-389.
11. J. Huan, W. Wang, D. Bandyopadhyay, J. Snoeyink, J. Prins, and A. Tropsha, "Mining protein family specific residue packing patterns from protein structure graphs," in Proceedings of the Intl Conf on Research in Computational Molecular Biology (RECOMB), 2004.
12. J. Huan, W. Wang, and J. Prins, "Efficient mining of frequent subgraphs in the presence of isomorphism," in Proceedings of the 3rd IEEE Intl. Conf. on Data Mining ICDM. Piscataway, NJ, USA: IEEE Press, 2003, pp. 549-552.
13. A. Inokuchi, T. Washio, T. Okada, and H. Motoda, "Applying the apriori-bascd graph mining method tp mutagenesis data analysis," Journal of Computer Aided Chemistry, vol. 2, pp. 87-92, 2001.
14. A. Inokuchi, T. Washio, and H. Motoda, "Complete mining of frequent patterns from graphs: Mining graph data," Machine Learning, vol. 50, no. 3, pp. 321-354, 2003.
15. A. Inokuchi, T. Washio, K. Nishimura, and H. Motoda, "A fast algorithm for mining frequent connected subgraphs," IBM Research, Tokyo Research Laboratory, Tech. Rep., 2002.
16. R. King, A. Srinivasan, and L. Dehaspe, "Warmr: A data mining tool for chemical data," Journal of Computer-Aided Molecular Design, vol. 15, pp. 173-181, 2001.
17. S. Kramer, L. D. Raedt, and C. Helma, "Molecular feature mining in HIV data," in Proceedings of the seventh ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining. ACM Press, 2001, pp. 136-143.
18. M. Kuramochi and G. Karypis, "Frequent subgraph discovery," in Proceedings of the IEEE Intl. Conf. on Data Mining ICDM. Piscataway, NJ, USA: IEEE Press, 2001, pp. 313-320.
19. T. Meinl, "Erweiterte Fragmentsuche in Moleküldatenbanken, " diploma thesis, Computer Science Department 2, University of Erlangen-Nuremberg, August 2004.
20. T. Meinl, C. Borgelt, and M. R. Berthold, "Discriminatice Closed Fragment Mining and Perfect Extensions in MoFa," August 2004, to appear in the Proceedings of STAIRS 2004, Valencia, Spain.
21. S. Nijssen and J. N. Kok, "A quickstart in frequent structure mining can make a difference " LIACS, Leiden University, Leiden, The Netherlands, Tech. Rep., April 2004.
22. U. Rückert and S. Kramer, "Frequent free tree discovery in graph data," in Proceedings of the 2004 ACM symposium on Applied computing. ACM Press, 2004, pp. 564-570.
23. C. Wang, W. Wang, J. Pei, and Y. Z. amd Baile Shi, "Scalable Mining of Large Disk-based Graph Databases," August 2004, to appear in the Proceedings of KDD 2004, Seattle, Washington, USA.
24. T. Washio and H. Motoda, "State of the art of graph-based data mining," SIGKDD Explor. Newsl., vol. 5, no. 1, pp. 59-68, 2003.
25. X. Yan and J. Han, "gSpan: Graph-based substructure pattern mining," in Proceedings of the IEEE Intl. Conf. on Data Mining ICDM. Piscataway, NJ, USA: IEEE Press, 2002, pp. 51-58.