Advanced pruning strategies to speed up mining closed molecular fragments

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

Volumn 5, Issue , 2004, Pages 4565-4570

  Borgelt, Christian ^a   Meinl, Thorsten ^b   Berthold, Michael R ^c  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^c UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Closed fragment; Graph mining; Molecular fragment; Perfect extension; Pruning

Indexed keywords

CLOSED FRAGMENTS; GRAPH MINING; MOLECULAR FRAGMENTS; PERFECT EXTENSION; PRUNING;

ALGORITHMS; CELLS; DATA MINING; DATABASE SYSTEMS; GRAPH THEORY; LOGIC PROGRAMMING; MOLECULAR WEIGHT; VECTORS;

MOLECULAR STRUCTURE;

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

References (13)

1. R. Agrawal, T. Imielienski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. Proc. Conf. on Management of Data, 207-216. ACM Press, New York, NY, USA 1993
2. C. Borgelt and M.R. Berthold. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. Proc. IEEE Int. Conf. on Data Mining (ICDM 2002, Maebashi, Japan), 51-58. IEEE Press, Piscataway, NJ, USA 2002
3. P.W. Finn, S. Muggleton, D. Page, and A. Srinivasan. Pharmacore Discovery Using the Inductive Logic Programming System PROGOL. Machine Learning, 30(2-3):241-270. Kluwer, Amsterdam, Netherlands 1998
4. H. Hofer, C. Borgelt, and M.R. Berthold. Large Scale Mining of Molecular Fragments with Wildcards. Proc. 5th Int. Symposium on Intelligent Data Analysis (IDA 2003, Berlin, Germany), LNCS 2810:380-389. Springer-Verlag, Heidelberg, Germany 2003
5. J. Huan, W. Wang, and J. Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. Proc. 3rd IEEE Int. Conf. on Data Mining (ICDM 2003, Melbourne, FL), 549-552. IEEE Press, Piscataway, NJ, USA 2003
6. S. Kramer, L. de Raedt, and C. Helma. Molecular Feature Mining in HIV Data. Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2001, San Francisco, CA), 136-143. ACM Press, New York, NY, USA 2001
7. M. Kuramochi and G. Karypis. Frequent Subgraph Discovery. Proc. 1st IEEE Int. Conf. on Data Mining (ICDM 2001, San Jose, CA), 313-320. IEEE Press, Piscataway, NJ, USA 2001
8. HIV Antiviral Screen. National Cancer Institute. http://dtp.nci.nih.gov/ docs/aids/aids_data.html
9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering Frequent Closed Itemsets for Association Rules. Proc. 7th Int. Conf. on Database Theory (ICDT'99, Jerusalem, Israel), LNCS 1540:398-416. Springer-Verlag, Heidelberg, Germany 1999
10. T. Washio and H. Motoda. State of the Art of Graph-Based Data Mining. SIGKDD Explorations Newsletter 5(1):59-68. ACM Press, New York, NY, USA 2003
11. X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. Proc. 2nd IEEE Int. Conf. on Data Mining (ICDM 2003, Maebashi, Japan), 721-724. IEEE Press, Piscataway, NJ, USA 2002
12. X. Yan and J. Han. Closegraph: Mining Closed Frequent Graph Patterns. Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2003, Washington, DC), 286-295. ACM Press, New York, NY, USA 2003
13. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New Algorithms for Fast Discovery of Association Rules. Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD'97, Newport Beach, CA), 283-296. AAAI Press, Menlo Park, CA, USA 1997