Abstract
Novel algorithms for the analysis of graph sequences are proposed in this paper. In particular, we study the problem of recovering missing information and predicting the occurrence of nodes and edges in time series of graphs. Our work is motivated by applications in computer network analysis. However, the proposed recovery and prediction schemes are generic and can be applied in other domains as well.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
IEEE Trans. PAMI. Special Section on Graph Algorithms and Computer Vision 23 (2001)
Pattern Recognition Letters. Special Issue on Graph Based Representation 24, Elsevier Science B.V. (2003)
Int. Journal of Pattern Recognition and Artificial Intelligence. Special Issue on Advances in Graph Matching 18(3) (2004)
Hancock, E.R., Vento, M. (eds.): GbRPR 2003. LNCS, vol. 2726, pp. 13–23. Springer, Heidelberg (2003)
Bunke, H., Kraetzl, M., Shoubridge, P., Wallis, W.: Detection of abnormal change in time series of graphs. Journal of Interconnection Networks 3(1,2), 85–101 (2002)
Weiss, S.M.: Indarkhya: Predictive Data Mining: A Practical Guide. Morgan Kaufmann, San Francisco (1998)
Fung, G.P.C., Yu, J.X., Lam, W.: News sensitive stock trend prediction. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 481–493. Springer, Heidelberg (2002)
Schmidt, R., Gierl, L.: Temporal abstractions and case-based reasoning for medical course data: Two prognostic applications. In: Perner, P. (ed.) MLDM 2001. LNCS (LNAI), vol. 2123, pp. 23–34. Springer, Heidelberg (2001)
Kahveci, T., Singh, K.: Optimizing similarity search for arbitrary length time series queries. IEEE Trans. KDE 16(2), 418–433
Dickinson, P., Bunke, H., Dadej, A., Kraetzl, M.: On graphs with unique node labels. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 13–23. Springer, Heidelberg (2003)
Dickinson, P., Bunke, H., Dadej, A., Kraetzl, M.: Matching graphs with unique node labels. Pattern Analysis and Applications (accepted for publication)
Bunke, H., Dickinson, P., Kraetzl, M.: Analysis of Graph Sequences and Applications to Computer Network Monitoring, Technical Report, DSTO, Edinburgh, Australia (2003)
Makhoul, J.: Linear prediction: a tutorial review. Proc. of the IEEE 63(4), 561–580 (1975)
Quinland, R.: C4.5: Programs for Machine Learning. Morgen Kaufmann Publ., San Francisco (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bunke, H., Dickinson, P., Kraetzl, M. (2005). Recovery of Missing Information in Graph Sequences. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25270-2
Online ISBN: 978-3-540-31988-7
eBook Packages: Computer ScienceComputer Science (R0)