Predicting protein function and protein-ligand interaction with the 3D neighborhood kernel

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9356, Issue , 2015, Pages 221-235

  Schietgat, Leander ^a   Fannes, Thomas ^a   Ramon, Jan ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; LIGANDS;

BENCHMARK DATASETS; COMPETITIVE PERFORMANCE; EUCLIDEAN DISTANCE; PROTEIN FUNCTIONS; PROTEIN-LIGAND INTERACTIONS; SPATIAL FEATURES; STATE-OF-THE-ART METHODS; STRUCTURED DATA;

PROTEINS;

EID: 84945968229     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-24282-8_19     Document Type: Conference Paper

References (29)

1. Ballester, P.J., Mitchell, J.B.O.: A machine learning approach to predicting protein-ligand binding affinity with applications to molecular docking. Bioinformatics 26(9), 1169–1175 (2010)
2. Borgwardt, K.: Graph Kernels. Ph.D. thesis, Computer Science, Ludwig-Maximilians-University Munich (2007)
3. Borgwardt, K., Ong, C., Schonauer, S., Vishwanathan, S., Smola, A., Kriegel, H.: Protein function prediction via graph kernels. Bioinformatics 21(S1), i47–i56 (2005)
4. de Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)
5. Ceroni, A., Costa, F., Frasconi, P.: Classification of small molecules by two-and three-dimensional decomposition kernels. Bioinformatics 23(16), 2038–2045 (2007)
6. Costa, F., De Grave, K.: Fast neighborhood subgraph pairwise distance kernel. In: Proceedings of the 27th International Conference on Machine Learning, pp. 255-262 (2010)
7. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel Based Methods. Cambridge University Press, UK (2000)
8. Deforche, K.: Modeling HIV resistance evolution under drug selective pressure. Ph.D. thesis, Katholieke Universiteit Leuven (2008)
9. Demsar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1–30 (2006)
10. Dobson, P.D., Doig, A.J.: Predicting enzyme class from protein structure without alignments. J. Mol. Biol. 345, 187–199 (2005)
11. Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 98, 209–226 (1977)
12. Hinselmann, G., Fechner, N., Jahn, A., Eckert, M., Zell, A.: Graph kernels for chemical compounds using topological and three-dimensional local atom pair environments. Neurocomputing 74, 219–229 (2010)
13. Hue, M., Riffle, M., Vert, J.-P., Stafford Noble, W.: Large-scale prediction of protein-protein interactions from structures. BMC Bioinform. 11(144), 1–9 (2010)
14. Joachims, T.: Learning to Classify Text using Support Vector Machines: Methods, Theory, and Algorithms. Springer, US (2002)
15. King, R.D., Muggleton, S., Srinivasan, A., Sternberg, M.J.E.: Structure-activity relationships derived by machine learning: the use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. Proc. Natl. Acad. Sci. 93, 438–442 (1996)
16. Kuramochi, M., Karypis, G.: Discovering frequent geometric subgraphs. In: Proceedings of the 2004 IEEE International Conference on Data Mining, pp. 258–265 (2004)
17. Lee, D.T., Wong, C.K.: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Informatica 9, 23–29 (1977)
18. Nowozin, S., Tsuda, K.: Frequent subgraph retrieval in geometric graph databases. In: Proceedings of the 2008 IEEE International Conference on Data Mining, pp. 953–958 (2008)
19. Provost, F., Fawcett, T.: Analysis and visualization of classifier performance: comparison under imprecise class and cost distributions. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp. 43–48. AAAI Press (1998)
20. Qiu, J., Hue, M., Ben-Hur, A., Vert, J.-P., Stafford Noble, W.: A structural alignment kernel for protein structures. Bioinformatics 23(9), 1090–1098 (2007)
21. Ramon, J., Gartner, T.: Expressivity versus efficiency of graph kernels. In: Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS2003), pp. 65–74 (2003)
22. Saidi, R., Maddouri, M., Nguifo, E.M.: Comparing graph-based representations of protein for mining purposes. In: Proceedings of the KDD-09 Workshop on Statistical and Relational Learning in Bioinformatics, pp. 35–38 (2009)
23. Sali, A., Blundell, T.L.: Comparative protein modelling by satisfaction of spatial restraints. J. Mol. Biol. 234, 779–815 (1993)
24. Schietgat, L., Vens, C., Struyf, J., Blockeel, H., Kocev, D., Dˇzeroski, S.: Predicting gene function using hierarchical multi-label decision tree ensembles. BMC Bioinform. 11(2), 1–14 (2010)
25. Schietgat, L., Ramon, J., Bruynooghe, M.: A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics. Ann. Math. Artif. Intell. 69, 343–376 (2013)
26. Shervashidze, N., Borgwardt, K.: Fast subtree kernels on graphs. In: Bengio, Y., Schuurmans, D., Lafferty, J., Williams, C.K.I., Culotta, A. (eds.) Advances in Neural Information Processing Systems, vol. 22, pp. 1660–1668. Curran, USA (2009)
27. Srinivasan, A., Page, D., Camacho, R., King, R.D.: Quantitative pharmacophore models with inductive logic programming. Mach. Learn. 64, 65–90 (2006)
28. Suykens, J., Van Gestel, T., De Brabanter, J., De Moor, B., Vandewalle, J.: Least Squares Support Vector Machines. World Scientific, Singapore (2005)
29. Wang, R., et al.: The PDBbind database: methodologies and updates. J. Med. Chem. 48, 4111–4119 (2005)