This paper is concerned with time series of graphs and compares two novel schemes that are able to predict the presence or absence of nodes in a graph. Our work is motivated by applications in computer network monitoring. However, the proposed prediction methods are 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.
CITATION STYLE
Bunke, H., Dickinson, P., & Kraetzl, M. (2005). Comparison of two different prediction schemes for the analysis of time series of graphs. In Lecture Notes in Computer Science (Vol. 3523, pp. 99–106). Springer Verlag. https://doi.org/10.1007/11492542_13
Mendeley helps you to discover research relevant for your work.