Attributed graph kernels using the Jensen-Tsallis q-differences

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

Volumn 8724 LNAI, Issue PART 1, 2014, Pages 99-114

  Bai, Lu ^a   Rossi, Luca ^b   Bunke, Horst ^c   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c UNIVERSITY OF BERN   (Switzerland)

Author keywords

continuous time quantum walk; Graph kernels; Jensen Tsallis q differences; tree index method

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONTINUOUS TIME SYSTEMS; FORESTRY; LEARNING SYSTEMS; TREES (MATHEMATICS);

ATTRIBUTED GRAPHS; CONTINUOUS-TIME QUANTUM WALKS; EFFECTIVENESS AND EFFICIENCIES; EXPERIMENTAL EVALUATION; GRAPH KERNELS; JENSEN-TSALLIS Q-DIFFERENCES; MUTUAL INFORMATION MEASURES; TREE-INDEX METHOD;

PROBABILITY DISTRIBUTIONS;

FORESTRY; MATHEMATICS; TREES;

EID: 84907007930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44848-9_7     Document Type: Conference Paper

References (27)

1. Dahm, N., Bunke, H., Caelli, T., Gao, Y.: A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 11-20. Springer, Heidelberg (2013)
2. Bai, L., Hancock, E.R.: Graph Kernels from the Jensen-Shannon Divergence. Journal of Mathematical Imaging and Vision 47(1-2), 60-69 (2013)
3. Gärtner, T., Flach, P.A., Wrobel, S.: On Graph Kernels: Hardness Results and Efficient Alternatives. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 129-143. Springer, Heidelberg (2003) (Pubitemid 37053200)
4. Bunke, H., Riesen, K.: A Family of Novel Graph Kernels for Structural Pattern Recognition. In: Rueda, L., Mery, D., Kittler, J. (eds.) CIARP 2007. LNCS, vol. 4756, pp. 20-31. Springer, Heidelberg (2007)
5. Jebara, T., Kondor, R.I., Howard, A.: Probability Product Kernels. Journal ofMachine Learning Research 5, 819-844 (2004)
6. Haussler, D.: Convolution Kernels on Discrete Structures. Technical Report UCS-CRL-99-10 (1999)
7. Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized Kernels Between Labeled Graphs. In: Proc. ICML, pp. 321-328 (2003)
8. Borgwardt, K.M., Kriegel, H.P.: Shortest-path Kernels on Graphs. In: Proc. ICDM, pp. 74-81 (2005)
9. Shervashidze, N., Borgwardt, K.M.: Fast Subtree Kernels on Graphs. In: Proc. NIPS, pp. 1660-1668 (2009)
10. Costa, F., Grave, K.D.: Fast Neighborhood Subgraph Pairwise Distance Kernel. In: Proc. ICML, pp. 255-262 (2010)
11. Shervashidze, N., Vishwanathan, S.V.N., Petri, T., Mehlhorn, K., Borgwardt, K.M.: Efficient Graphlet Kernels for Large Graph Comparison. Journal of Machine Learning Research 5, 488-495 (2009)
12. Martins, A.F.T., Smith, N.A., Xing, E.P., Aguiar, P.M.Q., Figueiredo, M.A.T.: Nonextensive Information Theoretic Kernels on Measures. Journal of Machine Learning Research 10, 935-975 (2009)
13. Julia, K.: Quantum RandomWalks: An Introductory Overview. Contemporary Physics 44(4), 307-327 (2003)
14. Farhi, E., Gutmann, S.: Quantum Computation and Decision Trees. Physical Review A 58, 915 (1998)
15. Aubry, M., Schlickewei, U., Cremers, D.: The Wave Kernel Signature: A Quantum Mechanical Approach to Shape Analysis. In: Proc. ICCV Workshops, pp. 1626-1633 (2011)
16. Rossi, L., Tosello, A., Hancock, E.R., Wilson, R.C.: Characterizing Graph Symmetries through Quantum Jensen-Shannon Divergence. Physical Review E 88(3-1), 032806 (2013)
17. Suau, P., Hancock, E.R., Escolano, F.: Graph Characteristics from the Schrödinger Operator. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 172-181. Springer, Heidelberg (2013)
18. Cottrell, S., Hillery, M.: Finding Structural Anomalies in Star Graphs Using QuantumWalks. Physical Review Letters 112(3), 030501 (2014)
19. Aziz, F.,Wilson, R.C., Hancock, E.R.: Backtrackless Walks on A Graph. IEEE Transactions on Neural Networks and Learning System 24(6), 977-989 (2013)
20. Mahé, P., Ueda, N., Akutsu, T., Perret, J., Vert, J.: Extensions of marginalized graph kernels. In: Proc. ICML (2004)
21. Alon, N., Benjamini, I., Lubetzky, E., Sodin, S.: Non-backtracking Random Walks Mix Faster. Communications in Contemporary Mathematics 9(4), 585-603 (2007)
22. Tsallis, C.: Possible Generalization of Boltzman-Gibbs Statistacs. J. Stats. Physics 52, 479-487 (1988)
23. Furuichi, S.: Information Theoretical Properities of Tsallis Entropies. Journal of Math. Physics 47, 2 (2006)
24. Riesen, K., Bunke, H.: Graph Classification and Clustering based on Vector Space Embedding. World Scientific Publishing (2010)
25. Bai, L., Hancock, E.R., Ren, P.: Jensen-Shannon Graph Kernel using Information Functionals. In: Proc. ICPR, pp. 2877-2880 (2012)
26. Bai, L., Rossi, L., Torsello, A., Hancock, E.R.: A Quantum Jensen-Shannon Kernel for Unattributed Graphs. To appear in Pattern Recognition (2014)
27. Kriege, N., Mutzel, P.: Subgraph Matching Kernels for Attributed Graphs. In: Proc. ICML (2012)