Sebastian Raubach

Software Developer

I am a software, database and website developer.
Please visit the links below or scroll down and explore this page to learn more about me.

About Me

Who I am ?

I grew up near Cologne and studied Computer Science in Aachen, Germany. After finishing my Bachelor and Master (with distinction) with a focus on software development and data mining, I moved to Scotland to join the James Hutton Institute's Information & Computational Sciences Group as a Bioinformatics Software Developer. I spend my time working with international collaborators, gathering requirements and developing new features for our software tools.

What I Do ?

I write various kinds of software. Starting with full-stack web development to desktop and Android development - I've got it covered. I mainly work on projects developed by small teams, so I'm involved in all development steps:

  • Project planning
  • Requirements analysis
  • Prototyping
  • Testing
  • Deployment
  • Maintenance

Resume

Experience

  • Dec. 2012 - Present

    Bioinformatics Software Developer

    The James Hutton Institute, Invergowrie, Scotland
    • Lead developer of Germinate
    • MySQL and Java programming
    • Development of a new web interface with GWT
    • Development of Android apps
    • Development of visualizations for the Seeds of Discovery project
    • Visualization with JavaScript and d3.js
  • Oct. 2012 - Dec. 2012

    Database/Web Developer

    The James Hutton Institute, Invergowrie, Scotland
    • MySQL programming, Perl and Java
    • Germinate Data Management System
    • Visualization with JavaScript and d3.js

Education

  • Sep. 2011 - Mar. 2012

    Master Thesis

    Topic: "Spectral Projected Clustering on Graphs with Feature Vectors"
    • Grade: 1.0
    Clustering graphs annotated with feature vectors has recently gained much attention. The goal is to detect groups of vertices that are densely connected in the graph as well as similar with respect to their feature values. While early approaches treated all dimensions of the feature space as equally important, more advanced techniques consider the varying relevance of dimensions for different groups. In this work, we propose a novel clustering method for graphs with feature vectors based on the principle of spectral clustering. Following the idea of subspace clustering, our method detects for each cluster an individual set of relevant features. Since spectral clustering is based on the eigendecomposition of the affinity matrix, which strongly depends on the choice of features, our method simultaneously learns the grouping of vertices and the affinity matrix. To tackle the fundamental challenge of comparing the clustering structures for different feature subsets, we define an objective function that is unbiased regarding the number of relevant features. We develop the algorithm SSCG and we show its application for multiple real-world datasets.
  • Apr. 2010 - Mar. 2012

    Master of Science in Computer Science

    at the RWTH Aachen University
    • Grade: 1.1
  • Dec. 2009 - Mar. 2010

    Bachelor Thesis

    Topic: "Fault-tolerant Subspace Clustering"
    • Grade: 1.3
    In today's applications, data analysis tasks are hindered by many attributes per object as well as by faulty data with missing values. Subspace clustering tackles the challenge of many attributes by cluster detection in any subspace projection of the data. However, it poses novel challenges for handling missing values of objects, which are part of multiple subspace clusters in different projections of the data. In this work, we propose a general fault tolerance definition enhancing subspace clustering models to handle missing values. We introduce a flexible notion of fault tolerance that adapts to the individual characteristics of subspace clusters and ensures a robust parameterization. Allowing missing values in our model increases the computational complexity of subspace clustering. Thus, we prove novel monotonicity properties for an efficient computation of fault tolerant subspace clusters. Experiments on real and synthetic data show that our fault tolerance model ields high quality results even in the presence of many missing values.
  • Oct. 2006 - Mar. 2010

    Bachelor of Science in Computer Science

    at the RWTH Aachen University
    • Grade: 2.3

Skills

Java

100%

JavaScript

80%

D3.js

70%

GWT

95%

MySQL / SQLite

95%

Android

95%

Data Mining

75%

LaTeX

80%

More skills

UX Design
Project Management
Communication
Problem Solving
Active Learning
Motivation

Software tools

image

Germinate

image

Germinate Daim

image

Humbug

image

Germinate Scan

image

JaRSS

image

BeerDB

image

Evaluation Framework

Years of Experience

10

Tools developed

1500000

People reached on Stackoverflow

Publications