### Skapa referens, olika format (klipp och klistra)

**Harvard**

Johansson, F., Jethava, V., Dubhashi, D. och Bhattacharyya, C. (2014) *Global graph kernels using geometric embeddings*.

** BibTeX **

@conference{

Johansson2014,

author={Johansson, Fredrik and Jethava, Vinay and Dubhashi, Devdatt and Bhattacharyya, C.},

title={Global graph kernels using geometric embeddings},

booktitle={Proceedings of the 31st International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014},

isbn={978-163439397-3},

pages={694–702},

abstract={Applications of machine learning methods increasingly deal with graph structured data through kernels. Most existing graph kernels compare graphs in terms of features defined on small subgraphs such as walks, paths or graphlets, adopting an inherently local perspective. However, several interesting properties such as girth or chromatic number are global properties of the graph, and are not captured in local substructures. This paper presents two graph kernels defined on unlabeled graphs which capture global properties of graphs using the celebrated Lovasz number and its associated orthonormal representation. We make progress towards theoretical results aiding kernel choice, proving a result about the separation margin of our kernel for classes of graphs. We give empirical results on classification of synthesized graphs with important global properties as well as established benchmark graph datasets, showing that the accuracy of our kernels is better than or competitive to existing graph kernels.},

year={2014},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 210678

A1 Johansson, Fredrik

A1 Jethava, Vinay

A1 Dubhashi, Devdatt

A1 Bhattacharyya, C.

T1 Global graph kernels using geometric embeddings

YR 2014

T2 Proceedings of the 31st International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014

SN 978-163439397-3

AB Applications of machine learning methods increasingly deal with graph structured data through kernels. Most existing graph kernels compare graphs in terms of features defined on small subgraphs such as walks, paths or graphlets, adopting an inherently local perspective. However, several interesting properties such as girth or chromatic number are global properties of the graph, and are not captured in local substructures. This paper presents two graph kernels defined on unlabeled graphs which capture global properties of graphs using the celebrated Lovasz number and its associated orthonormal representation. We make progress towards theoretical results aiding kernel choice, proving a result about the separation margin of our kernel for classes of graphs. We give empirical results on classification of synthesized graphs with important global properties as well as established benchmark graph datasets, showing that the accuracy of our kernels is better than or competitive to existing graph kernels.

LA eng

LK http://publications.lib.chalmers.se/records/fulltext/210678/local_210678.pdf

OL 30