Analysis of time series of graphs: Prediction of node presence by means of decision tree learning

2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is concerned with time series of graphs and proposes a novel scheme that is able to predict the presence or absence of nodes in a graph. The proposed scheme is based on decision trees that are induced from a training set of sample graphs. The work is motivated by applications in computer network monitoring. However, the proposed prediction method is generic and can be used in other applications as well. Experimental results with graphs derived from real computer networks indicate that a correct prediction rate of up to 97% can be achieved. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Bunke, H., Dickinson, P., Irniger, C., & Kraetzl, M. (2005). Analysis of time series of graphs: Prediction of node presence by means of decision tree learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3587 LNAI, pp. 366–375). Springer Verlag. https://doi.org/10.1007/11510888_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free