Differences
This shows you the differences between two versions of the page.
|
staff:morris [2019-02-08 07:16] |
staff:morris [2019-03-06 22:21] |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| * Machine learning with graphs, | * Machine learning with graphs, | ||
| - | * Algorithm Engineering, Algorithmic Data Analysis | + | * Combinatorial optimization and graph algorithms, |
| - | * Combinatorial optimization and graph algorithms | + | * Machine Learning for combinatorial optimization |
| Line 30: | Line 30: | ||
| * **Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks** (Preprint ''[[https://arxiv.org/abs/1810.02244|arXiv:1810.02244]]'') \\ Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe,\\ // AAAI Conference on Artificial Intelligence (AAAI) 2019.//\\ [[https://github.com/chrsmrrs/k-gnn|[Source Code]]][[https://de.slideshare.net/ChristopherMorris104/weisfeiler-and-leman-go-neural-higherorder-graph-neural-networks|[Slides]]] | * **Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks** (Preprint ''[[https://arxiv.org/abs/1810.02244|arXiv:1810.02244]]'') \\ Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe,\\ // AAAI Conference on Artificial Intelligence (AAAI) 2019.//\\ [[https://github.com/chrsmrrs/k-gnn|[Source Code]]][[https://de.slideshare.net/ChristopherMorris104/weisfeiler-and-leman-go-neural-higherorder-graph-neural-networks|[Slides]]] | ||
| - | * **[[http://papers.nips.cc/paper/7729-hierarchical-graph-representation-learning-with-differentiable-pooling|Hierarchical Graph Representation Learning with Differentiable Pooling]]** (Preprint ''[[https://arxiv.org/abs/1806.08804|arXiv:1806.08804]]'') \\ Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, Jure Leskovec, \\ // Neural Information Processing Systems (NeurIPS) 2019, spotlight presentation, and KDD Deep Learning Day 2018.//\\ [[https://github.com/RexYing/graph-pooling|[Source Code]]] | + | * **[[http://papers.nips.cc/paper/7729-hierarchical-graph-representation-learning-with-differentiable-pooling|Hierarchical Graph Representation Learning with Differentiable Pooling]]** (Preprint ''[[https://arxiv.org/abs/1806.08804|arXiv:1806.08804]]'') \\ Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, Jure Leskovec, \\ // Neural Information Processing Systems (NeurIPS) 2018, spotlight presentation, and KDD Deep Learning Day 2018.//\\ [[https://github.com/RexYing/graph-pooling|[Source Code]]] |
| * ** [[https://www.ijcai.org/proceedings/2018/325|A Property Testing Framework for the Theoretical | * ** [[https://www.ijcai.org/proceedings/2018/325|A Property Testing Framework for the Theoretical | ||
| Line 69: | Line 69: | ||
| * Franka Bause (BT, 2017): //Approximation der Editierdistanz für Graphen in linearer Zeit// | * Franka Bause (BT, 2017): //Approximation der Editierdistanz für Graphen in linearer Zeit// | ||
| * Ryan Ladwig (Student intern from [[http://www.nau.edu|NAU]], 2017): //Design and Implementation of k-disk Graph Kernels// | * Ryan Ladwig (Student intern from [[http://www.nau.edu|NAU]], 2017): //Design and Implementation of k-disk Graph Kernels// | ||
| - | * Jannis Junge (MT, 2018): //Approximation des Graphenspektrums// | + | * Jannis Junge (MT, 2018): //Algorithm Engineering zur Approximation des Spektrums von Graphen in der Praxis// |
| * Marcel Walker (MT, 2018): //Systematisierung von neuronalen Netzen auf Graphen// | * Marcel Walker (MT, 2018): //Systematisierung von neuronalen Netzen auf Graphen// | ||
| * Nina Runde (BT, 2018): //Evaluation von Varianten des $k$-dimensionalen Weisfeiler-Leman Algorithmus // | * Nina Runde (BT, 2018): //Evaluation von Varianten des $k$-dimensionalen Weisfeiler-Leman Algorithmus // | ||