Sökning: onr:"swepub:oai:DiVA.org:oru-91702" >
Graph Invariant Ker...
Graph Invariant Kernels
-
- Orsini, F (författare)
- Department of Computer Science, Katholieke Universiteit Leuven, Heverlee, Belgium; Department of Information Engineering, Università degli Studi di Firenze, Firenze, Italy
-
- Frasconi, P (författare)
- Department of Information Engineering, Università degli Studi di Firenze, Firenze, Italy
-
- De Raedt, Luc, 1964- (författare)
- Department of Computer Science, Katholieke Universiteit Leuven, Heverlee, Belgium
-
(creator_code:org_t)
- Palo Alto : AAAI Press, 2015
- 2015
- Engelska.
-
Ingår i: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. - Palo Alto : AAAI Press. - 9781577357384 ; , s. 3756-3762
- Relaterad länk:
-
https://urn.kb.se/re...
Abstract
Ämnesord
Stäng
- We introduce a novel kernel that upgrades the Weisfeiler-Lehman and other graph kernels to effectively exploit high-dimensional and continuous vertex attributes. Graphs are first decomposed into subgraphs. Vertices of the subgraphs are then compared by a kernel that combines the similarity of their labels and the similarity of their structural role, using a suitable vertex invariant. By changing this invariant we obtain a family of graph kernels which includes generalizations of Weisfeiler-Lehman, NSPDK, and propagation kernels. We demonstrate empirically that these kernels obtain state-of-the-art results on relational data sets.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas