Comparison of two different prediction schemes for the analysis of time series of graphs

Authors:
Horst Bunke;Peter Dickinson;Miro Kraetzl
Affiliations:
Institut für Informatik und angewandte Mathematik, Universität Bern, Bern, Switzerland;Intelligence Surveillance Reconnaissance Division, Defence Science and, Technology Organisation, Edinburgh, SA, Australia;Intelligence Surveillance Reconnaissance Division, Defence Science and, Technology Organisation, Edinburgh, SA, Australia
Venue:
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Year:
2005

Citing 9
Cited 0

C4.5: programs for machine learning

C4.5: programs for machine learning
A New Temporal Pattern Identification Method for Characterization and Prediction of Complex Time Series Events

IEEE Transactions on Knowledge and Data Engineering
News Sensitive Stock Trend Prediction

PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Temporal Abstractions and Case-Based Reasoning for Medical Course Data: Two Prognostic Applications

MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Mining Asynchronous Periodic Patterns in Time Series Data

IEEE Transactions on Knowledge and Data Engineering
Optimizing Similarity Search for Arbitrary Length Time Series Queries

IEEE Transactions on Knowledge and Data Engineering
Data Mining in Time Series Database

Data Mining in Time Series Database
Graph-based tools for data mining and machine learning

MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Discover motifs in multi-dimensional time-series using the principal component analysis and the MDL principle

MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.