Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
staff:morris [2018-11-08 17:58]
Christopher Morris [Refereed Conference Articles]
staff:morris [2019-04-18 10:04] (current)
Christopher Morris [Sommersemester 2018]
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 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 (via Petra Mutzel → Peter Eades → Michel-Marie Deza → P. Erdős)+//Fun Fact:// My Erdős number is at most (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]]]+  * **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]]]
  
-  * **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 (NIPS2019, 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 (NeurIPS2018, 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 46: 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 =======
  
   * **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]]. \\
 +
 +  * **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. \\
 +
 +
 +===== Benchmark Data Sets =====
 +  * [[staff:​morris:​graphkerneldatasets|Benchmark Data Sets for Graph Kernels]]
  
  
Line 65: Line 74:
   * 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): //Dimensionsreduktion ​von Merkmalsvektoren//+  * 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 ​ //
-====== Sommersemester ​2018 ======+ 
 +====== Sommersemester ​2019 ====== 
 +  * [[https://​ls11-www.cs.tu-dortmund.de/​staff/​mutzel/​prosemgraphalg | Proseminar Graphenalgorithmen]] 
 + 
 + 
 +====== Sommersemester 2019 ======
   * [[:​teaching:​seminarae-ss2018 | Seminar Algorithm Engineering]]   * [[:​teaching:​seminarae-ss2018 | Seminar Algorithm Engineering]]
 +
  
  
Line 91: Line 106:
   * [[:​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]]+  * 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   * 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)
 
Last modified: 2018-11-08 17:58 by Christopher Morris
DokuWikiRSS-Feed