Fast neighborhood subgraph pairwise distance kernel

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 255-262

  Costa, Fabrizio ^a   De Grave, Kurt ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMOINFORMATICS; GRAM MATRICES; GRAPH INVARIANT; GRAPH KERNELS; PAIRWISE DISTANCES; SPEED-UPS; SUBGRAPHS;

MATRIX ALGEBRA;

LEARNING SYSTEMS;

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

References (17)

1. Ben-David, S., Eiron, N., and Simon, H. U. Limitartions of learning via embeddings in euclidean half spaces. J. of Mach. Learning Research, 3:441-461, 2002.
2. Borgwardt, K and Kriegel, H. Shortest-path kernels on graphs. In Proc. ICDM, Jan 2005.
3. Dobson, Paul D. and Doig, Andrew J. Distinguishing enzyme structures from non-enzymes without alignments. J. Mol. Biol., 330(4):771 - 783, 2003.
4. Gross, J L and Yellen, J. Handbook of Graph Theory (Discrete Mathematics and Its Applications). CRC, 1 edition, Dec 2003. ISBN 1584880902.
5. Haussler, D. Convolution kernels on discrete structures. Technical Report UCS-CRL-99-10, UC Santa Cruz, 1999.
6. Hert, J, Willett, P, Wilton, D, and Acklin, P. Comparison of topological descriptors for similarity-based virtual screening using multiple bioactive reference structures. Org. Biomol. Chem., Jan 2004.
7. Joachims, T. Making large-scale SVM learning practical. In Scholkopf, B., Burges, C., and Smola, A. (eds.), Advances in Kernel Methods - Support Vector Learning. MIT-Press, 1999.
8. Kazius, J., McGuire, R., and Bursi, R. Derivation and validation of toxicophores for mutagenicity prediction. J. Med. Chem., 48(1):312-320, 2005.
9. Menchetti, S., Costa, F., and Frasconi, P. Weighted decomposition kernels. In Proc. ICML, pp. 585-592, 2005.
10. Schietgat, L., Ramon, J., Bruynooghe, M., and Blockeel, H. An efficiently computable graph-based metric for the classification of small molecules. In Proc. DS, pp. 197-209, 2008.
11. Schietgat, L., Costa, F., Ramon, J., and De Raedt, L. Maximum common subgraph mining: A fast and effective approach towards feature generation. In Proc. MLG, pp. 1-3, July 2009.
12. Schneider, G, Neidhart, W, Giller, T, and Schmid, G. "scaffold- hopping" by topological pharmacophore search: A contribution to virtual screening. Angew. Chem. Int. Ed., Jan 1999.
13. Schuffenhauer, A, Floersheim, P, Acklin, P, and Jacoby, E. Similarity metrics for ligands reflecting the similarity of the target proteins. J. Chem. Inf. Comput. Sci, 43(2):391-405, 2003.
14. Shervashidze, N and Borgwardt, K. Fast subtree kernels on graphs. NIPS, 2009.
15. Swamidass, S. J., Chen, J., Bruand, J., Phung, P., Ralaivola, L., and Baldi, P. Kernels for small molecules and the prediction of mutagenicity, toxicity and anti-cancer activity. Bioinformatics, 21 (suppl 1 ) i359-368, 2005.
16. Toivonen, H., Srinivasan, A., King, R. D., Kramer, S., and Helma, C. Statistical evaluation of the predictive toxicology challenge 2000-2001. Bioinformatics, 19(10):1183-1193, 2003. (Pubitemid 36850210)
17. Wale, N., Watson, I.A., and Karypis, G. Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl. inf. syst., 14:347-375, 2008.