Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces
Authors:
- Benjamin PaaßenBPBenjamin Paaßen
- Christina GöpfertCGChristina Göpfert
- Barbara HammerBHBarbara Hammer
Preprint
Abstract
Graph models are relevant in many fields, such as distributed computing, intelligent tutoring systems or social network analysis. In many cases, such models need to take changes in the graph structure into account, i.e. a varying number of nodes or edges. Predicting such changes within graphs can be expected to yield important insight with respect to the underlying dynamics, e.g. with respect to user behaviour. However, predictive techniques in the past have almost exclusively focused on single edges or nodes. In this contribution, we attempt to predict the future state of a graph as a whole. We propose to phrase time series prediction as a regression problem and apply dissimilarity- or kernel-based regression techniques, such as 1-nearest neighbor, kernel regression and Gaussian process regression, which can be applied to graphs via graph kernels. The output of the regression is a point embedded in a pseudo-Euclidean space, which can be analyzed using subsequent dissimilarity- or kernel-based processing methods. We discuss strategies to speed up Gaussian Processes regression from cubic to linear time and evaluate our approach on two well-established theoretical models of graph evolution as well as two real data sets from the domain of intelligent tutoring systems. We find that simple regression methods, such as kernel regression, are sufficient to capture the dynamics in the theoretical models, but that Gaussian process regression significantly improves the prediction error for real-world data.Keywords
All Related Versions
This publication has 44 references indexed in Scilit:
- Time Series Prediction for Graphs in Kernel and Dissimilarity SpacesNeural Processing Letters, 2017
- Evaluating link prediction methodsKnowledge and Information Systems, 2014
- Kernel Robust Soft Learning Vector Quantization2012
- Time Series Analysis and Its Applications2011
- A survey of graph edit distancePattern Analysis and Applications, 2009
- Toward Automatic Hint Generation for Logic Proof Tutoring Using Historical Student Data2008
- The link‐prediction problem for social networksJournal of the American Society for Information Science and Technology, 2007
- Learning to Find Graph Pre-imagesLecture Notes in Computer Science, 2004
- On Graph Kernels: Hardness Results and Efficient Alternatives2003
- Support-vector networksMachine Learning, 1995