Two new graphs kernels in chemoinformatics

Pattern Recognition Letters

Volumn 33, Issue 15, 2012, Pages 2038-2047

  Gaüzère, Benoit ^a   Brun, Luc ^a   Villemin, Didier ^b  

^a Centre National de la Recherche Scientifique   (France)

^b 6 Bd du Maréchal Juin   (France)

Author keywords

Chemoinformatics; Graph kernel; Machine learning

Indexed keywords

CHEMOINFORMATICS; EDIT DISTANCE; GRAPH KERNELS; RESEARCH FIELDS; SUBTREES; VARIABLE SELECTION;

GRAPH THEORY; LEARNING SYSTEMS; RESEARCH;

DISCOVERY WELLS;

EID: 84866375801     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2012.03.020     Document Type: Article

References (29)

1. Y. Berchenko, and M. Teicher Graph embedding through random walk for shortest paths problems Proc. 5th Internat. Conf. on Stochastic Algorithms: Foundations and Applications. SAGA'09 2009 Springer-Verlag Berlin, Heidelberg 127 140
2. Brun, L.; Conte, D.; Foggia, P.; Vento, M.; Villemin, D.; 2010. Symbolic learning vs. graph kernels: An experimental comparison in a chemical application. In: Proceedings of the 14th Conference on Advances in Databases and Information Systems (ADBIS 2010), pp. 31-40.
3. T. Caelli, and S. Kosinov An eigenspace projection clustering method for inexact graph matching IEEE Trans. Pattern Anal. Machine Intell. 26 2004 515 519
4. A. Cayley On the analytic forms called trees, with applications to the theory of chemical combinations Rep. British Assoc. Adv. Sci. 9 1875 427 460
5. D. Cherqaoui, and D. Villemin Use of a neural network to determine the boiling point of alkanes J. Chem. Soc. Faraday Trans. 90 1994 97 102
6. D. Cherqaoui, D. Villemin, A. Mesbah, J.M. Cense, and V. Kvasnicka Use of a neural network to determine the normal boiling points of acyclic ethers, peroxides, acetals and their sulfur analogues J. Chem. Soc. Faraday Trans. 90 1994 2015 2019
7. F. Chung Spectral Graph Theory 1997 American Mathematical Society
8. H. Elghawalby, and E.R. Hancock Graph characteristic from the gauss-bonnet theorem Proc. 2008 Joint IAPR Internat. Workshop on Structural, Syntactic, and Statistical Pattern Recognition. SSPR & SPR'08 2008 Springer-Verlag Berlin, Heidelberg 207 216
9. H. Elghawalby, and E.R. Hancock Geometric characterizations of graphs using heat kernel embeddings E.R. Hancock, R.R. Martin, M.A. Sabin, IMA Conf. on the Mathematics of Surfaces Lecture Notes in Computer Science vol. 5654 2009 Springer 124 142
10. D. Emms, R.C. Wilson, and E. Hancock Graph embedding using quantum commute times F. Escolano, M. Vento, 6th IAPR-TC15 Internat. Workshop GbRPR 2007. IAPR TC15 2007 Springer-Verlag 371 382
11. S. Fankhauser, K. Riesen, and H. Bunke Speeding up graph edit distance computation through fast bipartite matching X. Jiang, M. Ferrer, A. Torsello, Graph-Based Representations in Pattern Recognition Lecture Notes in Computer Science vol. 6658 2011 Springer Berlin/ Heidelberg 102 111
12. Fouss, F.; Yen, L.; Pirotte, A.; Saerens, M.; 2006. An experimental investigation of graph kernels on a collaborative recommendation task. In: Sixth International Conference on Data Mining. pp. 863-868.
13. N. Isaacs Physical Organic Chemistry 1987 Longman Sc. Tech.
14. H. Kashima, K. Tsuda, and A. Inokuchi Kernels for graphs 2004 MIT Press (Chapter 7, pp. 155-170)
15. B. Luo, R.C. Wilson, and E.R. Hancock A spectral approach to learning structural variations in graphs Pattern Recognition 39 6 2006 1188 1198
16. P. Mahé, and J.-P. Vert Graph kernels based on tree patterns for molecules Machine Learn. 75 1 2008 3 35
17. H.L. Morgan The generation of a unique machine description for chemical structures-a technique developed at chemical abstracts service J. Chem. Doc. 5 2 1965 107 113
18. M. Neuhaus, and H. Bunke Bridging the Gap between Graph Edit Distance and Kernel Machines 2007 World Scientific Pub Co Inc.
19. C.S. Ong, X. Mary, S. Canu, and A.J. Smola Learning with non-positive kernels Proc. Twenty-first Internat. Conf. on Machine learning. ICML'04 2004 ACM New York, NY, USA 639 646 (Pubitemid 40290863)
20. R. Otter The number of trees Ann. Math. 49 3 1948 583 599
21. G. Poezevara, B. Cuissart, and B. Crémilleux Discovering emerging graph patterns from chemicals Proc. 18th Internat. Symp. on Methodologies for Intelligent Systems (ISMIS 2009) 2009 LNCS Prague 45 55
22. Ramon, J.; Gärtner, T.; 2003. Expressivity versus efficiency of graph kernels. In: 1st Internat. Workshop on Mining Graphs, Trees and Sequences, pp. 65-74.
23. K. Riesen, and H. Bunke Iam graph database repository for graph based pattern recognition and machine learning Proc. 2008 Joint IAPR Internat. Workshop on Structural, Syntactic, and Statistical Pattern Recognition. SSPR & SPR '08 2008 Springer-Verlag Berlin, Heidelberg 287 297
24. K. Riesen, M. Neuhaus, and H. Bunke Graph embedding in vector spaces by means of prototype selection F. Escolano, M. Vento, 6th IAPR-TC15 Internat. Workshop GbRPR 2007. IAPR TC15 2007 Springer-Verlag 383 393
25. Shervashidze, N.; Vishwanathan, S.V.; Petri, T.H.; Mehlhorn, K.; Borgwardt, K.M.; 2009. Efficient graphlet kernels for large graph comparison. In: 12th Internat. Conf. on Artificial Intelligence and Statistics (AISTATS), pp. 488-495.
26. A. Smola, and R. Kondor Kernels and regularization on graphs B. Schlkopf, M. Warmuth, Learning Theory and Kernel Machines Lecture Notes in Computer Science vol. 2777 2003 Springer Berlin/Heidelberg 144 158 (Pubitemid 37053201)
27. F. Steinke, and B. Schölkopf Kernels, regularization and differential equations Pattern Recognition 41 2008 3271 3286
28. Suard, F.; Rakotomamonjy, A.; Bensrhair, A.; 2002. Kernel on bag of paths for measuring similarity of shapes. In: European Symposium on Artificial Neural Networks. pp. 355-360.
29. S. Vishwanathan, K.M. Borgwardt, I.R. Kondor, and N.N. Schraudolph Graph kernels J. Machine Learn. Res. 11 2010 1201 1242