Christopher Morris

Room: 238
Phone: +49 231 755-7707
Fax: +49 231 755-7740
E-Mail: christopher.morristu-dortmund.de
GitHub: https://github.com/chrsmrrs

Research Interests

  • Algorithm Engineering,
  • Combinatorial optimization and graph algorithms,
  • Machine learning with graphs, in particular scalable graph kernels and feature learning,
  • Approximate graph algorithms through sampling

Collaborative Research Center SFB 876 - Providing Information by Resource-Constrained Data Analysis

Resource-efficient Graph Mining

Publications

Refereed Conference Articles

  • Recent Advances in Kernel-Based Graph Classification
    Christopher Morris, Nils M. Kriege,
    European Conference on Machine Learning (ECML) 2017 (Nectar Track).

Refereed Journal Articles

Preprints

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 NAU, 2017): Design and Implementation of k-disk Graph Kernels

Sommersemester 2017

Wintersemester 2016/17

Sommersemester 2016

Wintersemester 2015/16

Benchmark Data Sets

Activities

 
Last modified: 2017-06-23 23:29 by Christopher Morris
DokuWikiRSS-Feed