Differences
This shows you the differences between two versions of the page.
staff:morris [2018-07-24 22:46] |
staff:morris [2019-02-23 13:11] |
||
---|---|---|---|
Line 12: | Line 12: | ||
- | * Machine learning with graphs and relational data | + | * Machine learning with graphs, |
- | * Algorithm Engineering, | + | * Algorithm Engineering, Algorithmic Data Analysis |
* Combinatorial optimization and graph algorithms | * Combinatorial optimization and graph algorithms | ||
Line 23: | Line 23: | ||
[[http://sfb876.tu-dortmund.de/SPP/sfb876-a6.html|Resource-efficient Graph Mining]] | [[http://sfb876.tu-dortmund.de/SPP/sfb876-a6.html|Resource-efficient Graph Mining]] | ||
- | //Fun Fact:// My Erdős number is at most 4 (via Petra Mutzel → Peter Eades → Michel-Marie Deza → P. Erdős) | + | //Fun Fact:// My Erdős number is at most 3 (via Petra Mutzel → Bojan Mohar → P. Erdős) |
===== Publications ===== | ===== Publications ===== | ||
======= Refereed Conference Articles ======= | ======= Refereed Conference Articles ======= | ||
+ | |||
+ | * **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) 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 | ||
- | Expressivity of Graph Kernels]] ** \\ [[staff:kriege|Nils M. Kriege]], Christopher Morris, [[http://ls2-www.cs.tu-dortmund.de/grav/de/grav_files/people/rey|Anja Rey]], [[http://ls2-www.cs.tu-dortmund.de/grav/de/grav_files/people/sohler/|Christian Sohler]], \\ // International Joint Conference on Artificial Intelligence (IJCAI) 2018.// | + | Expressivity of Graph Kernels]] ** \\ Nils M. Kriege, Christopher Morris, Anja Rey, Christian Sohler, \\ // International Joint Conference on Artificial Intelligence (IJCAI) 2018.// |
- | * **[[http://ieeexplore.ieee.org/document/8215505/|Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs]] ** (Preprint ''[[https://arxiv.org/abs/1703.02379|arXiv:1703.02379]]'') \\ Christopher Morris, [[http://www.ml.informatik.tu-darmstadt.de/|Kristian Kersting]], [[staff:mutzel|Petra Mutzel]], \\ //IEEE International Conference on Data Mining (IEEE ICDM) 2017, Full Paper.//\\ [[https://github.com/chrsmrrs/glocalwl|[Source Code]]] [[https://de.slideshare.net/ChristopherMorris104/glocalized-weisfeilerlehman-graph-kernels-globallocal-feature-maps-of-graphs-82159453|[Slides]]] | + | * **[[http://ieeexplore.ieee.org/document/8215505/|Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs]] ** (Preprint ''[[https://arxiv.org/abs/1703.02379|arXiv:1703.02379]]'') \\ Christopher Morris, Kristian Kersting, Petra Mutzel, \\ //IEEE International Conference on Data Mining (IEEE ICDM) 2017, full paper.//\\ [[https://github.com/chrsmrrs/glocalwl|[Source Code]]] [[https://de.slideshare.net/ChristopherMorris104/glocalized-weisfeilerlehman-graph-kernels-globallocal-feature-maps-of-graphs-82159453|[Slides]]] |
- | * **[[https://link.springer.com/chapter/10.1007%2F978-3-319-71273-4_37|Recent Advances in Kernel-Based Graph Classification]]** \\ [[staff:kriege|Nils M. Kriege]], Christopher Morris\\ // European Conference on Machine Learning & Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) 2017, Nectar Track.//\\ [[https://de.slideshare.net/secret/dKvWYSuOwqSObF|[Slides]]] | + | * **[[https://link.springer.com/chapter/10.1007%2F978-3-319-71273-4_37|Recent Advances in Kernel-Based Graph Classification]]** \\ Nils M. Kriege, Christopher Morris,\\ // European Conference on Machine Learning & Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) 2017, nectar track.//\\ [[https://de.slideshare.net/secret/dKvWYSuOwqSObF|[Slides]]] |
- | * **[[http://ieeexplore.ieee.org/document/7837955/|Faster Kernels for Graphs with Continuous Attributes via Hashing]]** (Preprint ''[[https://arxiv.org/abs/1610.00064|arXiv:1610.00064]]'') \\ Christopher Morris, [[staff:kriege|Nils M. Kriege]], [[http://www-ai.cs.uni-dortmund.de/PERSONAL/kersting.html|Kristian Kersting]], [[staff:mutzel|Petra Mutzel]], \\ //IEEE International Conference on Data Mining (IEEE ICDM) 2016.//\\ [[https://github.com/chrsmrrs/hashgraphkernel|[Source Code]]] | + | * **[[http://ieeexplore.ieee.org/document/7837955/|Faster Kernels for Graphs with Continuous Attributes via Hashing]]** (Preprint ''[[https://arxiv.org/abs/1610.00064|arXiv:1610.00064]]'') \\ Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel, \\ //IEEE International Conference on Data Mining (IEEE ICDM) 2016.//\\ [[https://github.com/chrsmrrs/hashgraphkernel|[Source Code]]] |
Line 42: | Line 46: | ||
* **[[http://onlinelibrary.wiley.com/doi/10.1002/mcda.1603/abstract|Output-sensitive Complexity of Multiobjective Combinatorial Optimization]]** (Preprint ''[[https://arxiv.org/abs/1610.07204|arXiv:1610.07204]]'') \\ [[staff:boekler|Fritz Bökler]], [[http://www.lancaster.ac.uk/lums/people/matthias-ehrgott|Matthias Ehrgott]], Christopher Morris, [[staff:mutzel|Petra Mutzel]], \\ //Journal of Multicriteria Decision Analysis,// 2016. | * **[[http://onlinelibrary.wiley.com/doi/10.1002/mcda.1603/abstract|Output-sensitive Complexity of Multiobjective Combinatorial Optimization]]** (Preprint ''[[https://arxiv.org/abs/1610.07204|arXiv:1610.07204]]'') \\ [[staff:boekler|Fritz Bökler]], [[http://www.lancaster.ac.uk/lums/people/matthias-ehrgott|Matthias Ehrgott]], Christopher Morris, [[staff:mutzel|Petra Mutzel]], \\ //Journal of Multicriteria Decision Analysis,// 2016. | ||
+ | |||
======= Preprints and Working Papers ======= | ======= Preprints and Working Papers ======= | ||
Line 47: | Line 52: | ||
* **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 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]]. \\ | ||
- | * **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. \\ | + | ===== Benchmark Data Sets ===== |
+ | * [[staff:morris:graphkerneldatasets|Benchmark Data Sets for Graph Kernels]] | ||
+ | |||
Line 54: | Line 62: | ||
======= Supervised Students ======= | ======= Supervised Students ======= | ||
- | |||
* Marcel Walker (BT, 2016): //Dimensionsreduktion von Merkmalsvektoren | * Marcel Walker (BT, 2016): //Dimensionsreduktion von Merkmalsvektoren | ||
für explizite Graphkerne// | für explizite Graphkerne// | ||
Line 62: | 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): //Algorithm Engineering zur Approximation des Spektrums von Graphen in der Praxis// | ||
+ | * Marcel Walker (MT, 2018): //Systematisierung von neuronalen Netzen auf Graphen// | ||
+ | * Nina Runde (BT, 2018): //Evaluation von Varianten des $k$-dimensionalen Weisfeiler-Leman Algorithmus // | ||
====== Sommersemester 2018 ====== | ====== Sommersemester 2018 ====== | ||
* [[:teaching:seminarae-ss2018 | Seminar Algorithm Engineering]] | * [[:teaching:seminarae-ss2018 | Seminar Algorithm Engineering]] | ||
Line 86: | Line 95: | ||
* [[:teaching:seminarae-ws2015 | Seminar Algorithm Engineering]] | * [[:teaching:seminarae-ws2015 | Seminar Algorithm Engineering]] | ||
- | ===== Benchmark Data Sets ===== | + | |
- | * [[staff:morris:graphkerneldatasets|Benchmark Data Sets for Graph Kernels]] | + | |
- | ===== Bibliography of (Supervised) Graph Classification ===== | + | |
- | * [[https://github.com/chrsmrrs/graphclassificationbib/|Bibliography]] | + | |
===== Activities ===== | ===== Activities ===== | ||
+ | * 27.01.2019--01.02.2019: [[https://aaai.org/Conferences/AAAI-19/|AAAI Conference on Artificial Intelligence]] (Spotlight Talk + Poster) | ||
+ | * 02.12.2018--08.12.2018: [[https://nips.cc/|Conference on Neural Information Processing Systems 2018 | ||
+ | ]] (Spotlight Talk + Poster) | ||
* 15.01.2018--31.03.2018: Research stay at Stanford University with [[http://cs.stanford.edu/~jure/|Jure Leskovec]] | * 15.01.2018--31.03.2018: Research stay at Stanford University with [[http://cs.stanford.edu/~jure/|Jure Leskovec]] | ||
* 18.11.2017--21.11.2017: [[http://http://icdm2017.bigke.org/|IEEE International Conference on Data Mining 2017]] (Talk) | * 18.11.2017--21.11.2017: [[http://http://icdm2017.bigke.org/|IEEE International Conference on Data Mining 2017]] (Talk) | ||
Line 100: | Line 109: | ||
* 28.09.--30.09.2015: [[http://ls2-www.cs.uni-dortmund.de/acbd|ACBD 2015 -- Algorithmic Challenges of Big Data]] | * 28.09.--30.09.2015: [[http://ls2-www.cs.uni-dortmund.de/acbd|ACBD 2015 -- Algorithmic Challenges of Big Data]] | ||
| | ||
- | | + |