Information Technology Reference
In-Depth Information
3. Borgelt, C., Berthold, M.R.: Mining Molecular Fragments: Finding Relevant Sub-
structures of Molecules. In: Proc. IEEE Int. Conf. on Data Mining, ICDM 2002,
Maebashi, Japan, pp. 51-58. IEEE Press, Piscataway (2002)
4. Borgelt, C., Meinl, T., Berthold, M.R.: Advanced Pruning Strategies to Speed Up
Mining Closed Molecular Fragments. In: Proc. IEEE Conf. on Systems, Man and
Cybernetics, SMC 2004, The Hague, Netherlands, IEEE Press, Piscataway (2004)
5. Cook, D.J., Holder, L.B.: Graph-Based Data Mining. IEEE Trans.on Intelligent
Systems 15(2), 32-41 (2000)
6. Di Fatta, G., Berthold, M.R.: Distributed Mining of Molecular Fragments. In:
Workshop on Data Mining and the Grid, IEEE Int. Conf. on Data Mining, pp.
1-9. IEEE Press, Piscataway (2004)
7. Finn, P.W., Muggleton, S., Page, D., Srinivasan, A.: Pharmacore Discovery Using
the Inductive Logic Programming System PROGOL. Machine Learning 30(2-3),
241-270 (1998)
8. Hofer, H., Borgelt, C., Berthold, M.R.: Large Scale Mining of Molecular Fragments
with Wildcards. Intelligent Data Analysis 8, 495-504 (2004)
9. Huan, J., Wang, W., Prins, J.: Ecient Mining of Frequent Subgraphs in the
Presence of Isomorphism. In: Proc. 3rd IEEE Int. Conf. on Data Mining, ICDM
2003, Melbourne, FL, pp. 549-552. IEEE Press, Piscataway (2003)
10. Index Chemicus — Subset from 1993. Institute of Scientific Information, Inc (ISI).
Thomson Scientific, Philadelphia, PA, USA (1993),
11. Kramer, S., de Raedt, L., Helma, C.: Molecular Feature Mining in HIV Data. In:
Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining,
KDD 2001, San Francisco, CA, pp. 136-143. ACM Press, New York (2001)
12. Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: Proc. 1st IEEE
Int. Conf. on Data Mining, ICDM 2001, San Jose, CA, pp. 313-320. IEEE Press,
Piscataway (2001)
13. DTP AIDS Antiviral Screen (HIV Data Set) — Subset from 2001. Developmental
Therapeutics Program (DTP), National Cancer Institute, USA (2001),
14. Nijssen, S., Kok, J.N.: A Quickstart in Frequent Structure Mining Can Make a
Difference. In: Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and
Data Mining, KDD 2004, Seattle, WA, pp. 647-652. ACM Press, New York (2004)
15. Washio, T., Motoda, H.: State of the Art of Graph-Based Data Mining. SIGKDD
Explorations Newsletter 5(1), 59-68 (2003)
16. Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proc. 2nd
IEEE Int. Conf. on Data Mining, ICDM 2003, Maebashi, Japan, pp. 721-724. IEEE
Press, Piscataway (2002)
17. Yan, X., Han, J.: Closegraph: Mining Closed Frequent Graph Patterns. In: Proc.
9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD
2003, Washington, DC, pp. 286-295. ACM Press, New York (2003)
