MoSS: A program for molecular substructure mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 6-15

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

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^c UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

IMPLEMENTATION OF AN ALGORITHM; MOLECULAR DATA; PRUNING TECHNIQUES; RESEARCH AREAS;

DATA MINING;

EID: 77953587430     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133905.1133908     Document Type: Conference Paper

References (21)

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. C. Borgelt. Efficient Implementations of Apriori and Eclat. Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL). CEUR Workshop Proceedings 90, Aachen, Germany 2003. http://www.ceur-ws.org/Vol-90/
4. C. Borgelt, T. Meinl, and M.R. Berthold. Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments. Proc. IEEE Conf. on Systems, Man and Cybernetics (SMC 2004, The Hague, Netherlands), CD-ROM. IEEE Press, Piscataway, NJ, USA 2004
5. D.J. Cook and L.B. Holder. Graph-Based Data Mining. IEEE Trans. on Intelligent Systems 15(2):32-41. IEEE Press, Piscataway, NJ, USA 2000
6. 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
7. 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
8. H. Hofer, C. Borgelt, and M.R. Berthold. Large Scale Mining of Molecular Fragments with Wildcards. Intelligent Data Analysis 8:495-504. IOS Press, Amsterdam, Netherlands 2004
9. 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
10. HIV Antiviral Screen. National Cancer Institute. http://dtp.nci.nih.gov/ docs/aids/aids data.html
11. Index Chemicus - Subset from 1993. Institute of Scientific Information, Inc. (ISI). Thomson Scientific, Philadelphia, PA, USA 1993
12. 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
13. 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
14. T. Meinl, C. Borgelt, and M.R. Berthold. Discriminative Closed Fragment Mining and Perfect Extensions in MoFa. Proc. 2nd Starting AI Researchers' Symposium (STAIRS 2004, Valencia, Spain), 3-14. IOS Press, Amsterdam, Netherlands 2004
15. T. Meinl, C. Borgelt, and M.R. Berthold. Mining Fragments with Fuzzy Chains in Molecular Databases. Proc. 2nd Int. Workshop on Mining Graphs, Trees and Sequences (MGTS 2004, Pisa, Italy), 49-60. University of Pisa, Pisa, Italy 2004
16. S. Nijssen and J.N. Kok. A Quickstart in Frequent Structure Mining can Make a Difference. Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD2004, Seattle, WA), 647-652. ACM Press, New York, NY, USA 2004
17. 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
18. 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
19. 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
20. 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
21. 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