Differences
This shows you the differences between two versions of the page.
staff:morris [2019-08-15 21:46] |
staff:morris [2019-12-04 16:41] |
||
---|---|---|---|
Line 9: | Line 9: | ||
| GitHub: | https://github.com/chrsmrrs | | | GitHub: | https://github.com/chrsmrrs | | ||
- | ===== Research Interests ===== | + | **My homepage moved [[http://www.christophermorris.info|here]].** |
- | + | ||
- | + | ||
- | * Machine learning with graphs, | + | |
- | * Combinatorial optimization and graph algorithms, | + | |
- | * Machine Learning for combinatorial optimization | + | |
- | + | ||
- | + | ||
- | + | ||
- | [[http://sfb876.tu-dortmund.de/index.html?p-selected=%27news%27|Collaborative Research Center | + | |
- | SFB 876 - Providing Information by Resource-Constrained Data Analysis]] | + | |
- | + | ||
- | [[http://sfb876.tu-dortmund.de/SPP/sfb876-a6.html|Resource-efficient Graph Mining]] | + | |
- | + | ||
- | //Fun Fact:// My Erdős number is at most 3 (via Petra Mutzel → Bojan Mohar → P. Erdős) | + | |
- | ===== Publications ===== | + | |
- | + | ||
- | ======= 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 | + | |
- | 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, 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]]** \\ 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, Nils M. Kriege, Kristian Kersting, Petra Mutzel, \\ //IEEE International Conference on Data Mining (IEEE ICDM) 2016.//\\ [[https://github.com/chrsmrrs/hashgraphkernel|[Source Code]]] | + | |
- | + | ||
- | + | ||
- | + | ||
- | ======= Refereed Journal Articles ======= | + | |
- | + | ||
- | * **[[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 ======= | + | |
- | + | ||
- | * **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]] | + | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | ===== Teaching ===== | + | |
- | + | ||
- | ======= Supervised Students ======= | + | |
- | * Marcel Walker (BT, 2016): //Dimensionsreduktion von Merkmalsvektoren | + | |
- | für explizite Graphkerne// | + | |
- | * Christopher Osthues (BT, 2016): //Experimenteller Vergleich von | + | |
- | Labeling-Verfahren für Graphkerne// | + | |
- | * Serdar Ayaz (BT, 2016): //Approximation des Weisfeiler-Lehman-Isomorphie-Tests durch Sampling// | + | |
- | * 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// | + | |
- | * 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 2019 ====== | + | |
- | * [[https://ls11-www.cs.tu-dortmund.de/staff/mutzel/prosemgraphalg | Proseminar Graphenalgorithmen]] | + | |
- | + | ||
- | + | ||
- | ====== Sommersemester 2019 ====== | + | |
- | * [[:teaching:seminarae-ss2018 | Seminar Algorithm Engineering]] | + | |
- | + | ||
- | + | ||
- | + | ||
- | ====== Wintersemester 2017/18 ====== | + | |
- | * [[:teaching:seminarae-ws2017 | Seminar Algorithm Engineering]] | + | |
- | + | ||
- | + | ||
- | ====== Sommersemester 2017 ====== | + | |
- | * [[:teaching:seminarae-ss2017 | Seminar Algorithm Engineering]] | + | |
- | + | ||
- | ====== Wintersemester 2016/17 ====== | + | |
- | * [[https://www.lsf.tu-dortmund.de/qisserver/rds?state=verpublish&status=init&vmfile=no&publishid=175538&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung|PG 600: DeepNewsDive – Maschinen lesen Zeitung]] | + | |
- | * [[teaching:fp_ae-ws2016|Fachprojekt Algorithm Engineering for Graph Data Mining]] | + | |
- | * [[/staff/mutzel/prosemunplugged|Proseminar Algorithms Unplugged]] | + | |
- | ======= Sommersemester 2016 ======= | + | |
- | * [[https://www.lsf.tu-dortmund.de/qisserver/rds?state=verpublish&status=init&vmfile=no&publishid=175538&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung|PG 600: DeepNewsDive – Maschinen lesen Zeitung]] | + | |
- | * [[:teaching:seminarae-ss2016 | Seminar Algorithm Engineering]] | + | |
- | * [[:teaching:seminar-gdm-ss2016 | Seminar Graph Mining]] | + | |
- | + | ||
- | ====== Wintersemester 2015/16 ====== | + | |
- | * [[:teaching:seminarae-ws2015 | Seminar Algorithm Engineering]] | + | |
- | + | ||
- | + | ||
- | ===== 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]] | + | |
- | * 18.11.2017--21.11.2017: [[http://http://icdm2017.bigke.org/|IEEE International Conference on Data Mining 2017]] (Talk) | + | |
- | * 18.09.2017--22.09.2017: [[http://ecmlpkdd2017.ijs.si/|ECML PKKD 2017]] (Talk) | + | |
- | * 19.06.2017--30.06.2017: [[http://mlss.tuebingen.mpg.de/2017/|The Machine Learning Summer School]] (Poster) | + | |
- | * 09.06.2017--11.06.2017: [[http://highlightsofalgorithms.org/|Highlights of Algorithms 2017]] | + | |
- | * 12.12.2016--15.12.2016: [[http://icdm2016.eurecat.org/|IEEE International Conference on Data Mining 2016 ]] (Talk) | + | |
- | * 22.02.--26.02.2016: [[http://www.cse.iitm.ac.in/abd/?mode=Home|Indo-German Spring School on Algorithms for Big Data]] | + | |
- | * 28.09.--30.09.2015: [[http://ls2-www.cs.uni-dortmund.de/acbd|ACBD 2015 -- Algorithmic Challenges of Big Data]] | + | |
- | + |