Differences
This shows you the differences between two versions of the page.
staff:morris [2019-09-21 16:58] |
staff:morris [2019-09-21 17:01] |
||
---|---|---|---|
Line 51: | Line 51: | ||
* **[[https://doi.org/10.1007/s10618-019-00652-0|A unifying view of explicit and implicit feature maps of graph kernels]]** (Preprint [[https://arxiv.org/abs/1703.00676|arXiv:1703.00676]]) \\ Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel \\ Data Mining and Knowledge Discovery, 2019, accepted for publication. | * **[[https://doi.org/10.1007/s10618-019-00652-0|A unifying view of explicit and implicit feature maps of graph kernels]]** (Preprint [[https://arxiv.org/abs/1703.00676|arXiv:1703.00676]]) \\ Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel \\ Data Mining and Knowledge Discovery, 2019, accepted for publication. | ||
======= Preprints and Working Papers ======= | ======= Preprints and Working Papers ======= | ||
- | |||
- | * **A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels** (Preprint ''[[https://arxiv.org/abs/1703.00676|arXiv:1703.00676]]'') \\ [[staff:kriege|Nils M. Kriege]], [[https://sites.wustl.edu/neumann|Marion Neumann]], Christopher Morris, [[http://www-ai.cs.uni-dortmund.de/PERSONAL/kersting.html|Kristian Kersting]], [[staff:mutzel|Petra Mutzel]]. \\ | ||
- | |||
- | * **A Survey on Graph Kernels** (Preprint ''[[https://arxiv.org/abs/1903.11835|arXiv:1903.11835]]'') \\ Nils M. Kriege, Fredrik D. Johansson, Christopher Morris. \\ | ||
* **Towards a practical $k$-dimensional Weisfeiler-Leman algorithm** (Preprint ''[[https://arxiv.org/abs/1904.01543|arXiv:1904.01543]]'') \\ Christopher Morris, Petra Mutzel. \\ | * **Towards a practical $k$-dimensional Weisfeiler-Leman algorithm** (Preprint ''[[https://arxiv.org/abs/1904.01543|arXiv:1904.01543]]'') \\ Christopher Morris, Petra Mutzel. \\ | ||
- | |||
===== Benchmark Data Sets ===== | ===== Benchmark Data Sets ===== |