OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Bai, Lu; Hancock, Edwin R (2016)
Languages: English
Types: Article
Subjects:
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1 School of Information, Central University of Finance and Economics, Beijing, China.
    • 2 the Department of Computer Science, University of York, York, UK. 45” 3h28” 23h39′ > 1day > 1day 7′43” > 1day 1′17”
    • [1] F. Escolano, E.R. Hancock, M.A. Lozano, Heat diffusion: Thermodynamic depth complexity of networks, Physical Review E 85 (2012) 036206.
    • [2] L. Bai, Edwin R. Hancock, Depth-based complexity traces of graphs, Pattern Recognition 47 (2013) 1772-1186.
    • [3] T. Ga¨rtner, P.A. Flach, S. Wrobel, On graph kernels: Hardness results and efficient alternatives, in: Proceedings of Conference on Learning Theory, 2003, pp. 129-143.
    • [4] L. Bai, E.R. Hancock, Graph kernels from the Jensen-Shannon divergence, Journal of Mathematical Imaging and Vision 47 (2013) 60-69.
    • [5] N. Shervashidze, P. Schweitzer, E.J. Leeuwen, K, Mehlhorn, K.M. Borgwardt, Weisfeiler-Lehman graph kernels, Journal of Machine Learning Research 1 (2010) 1-48.
    • [6] G. Li, M. Semerci, B. Yener, M.J. Zaki, Effective graph classification based on topological and label attributes, Statistical Analysis and Data Mining 5 (2012) 265-283.
    • [7] H. Kashima, K. Tsuda, A. Inokuchi, Marginalized kernels between labeled graphs, in: Proceedings of International Conference on Machine Learing, 2003, pp. 321-328.
    • [8] K.M. Borgwardt, H. Kriegel, Shortest-Path kernels on graphs, in: Proceedings of the IEEE International Conference on Data Mining, 2005, pp. 74-81.
    • [9] F. Aziz, R.C. Wilson, E.R. Hancock, Backtrackless walks on a graph, IEEE Trans. Neural Netw. Learning Syst. 24 (2013) 977-989.
    • [10] P. Ren, R.C. Wilson, E.R. Hancock, Graph Characterization via Ihara Coefficients, IEEE Transactions on Neural Networks 22 (2011) 233-245.
    • [11] F. Costa, K.D. Grave, Fast neighborhood subgraph pairwise distance kernel, in Proceedings of International Conference on Machine Learing, 2010, 255-262.
    • [12] Z. Harchaoui, F. Bach, Image classification with segmentation graph kernels, in Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2007.
    • [13] F.R. Bach, Graph kernels between point clouds, in: Proceedings of International Conference on Machine Learing, 2008, 25-32.
    • [14] N. Kriege, P. Mutzel, Subgraph matching kernels for attributed graphs, in: Proceedings of International Conference on Machine Learing, 2012.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok