Skip to main content

Comparison of Two Different Prediction Schemes for the Analysis of Time Series of Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3523))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Last, M., Kandel, A., Bunke, H. (eds.): Data Mining in Time Series Databases. World Scientific, Singapore (2004)

    MATH  Google Scholar 

  2. Keogh, E., et al.: Segmenting time series: A survey and novel approach. In: [1], pp. 1–21

    Google Scholar 

  3. Kahveci, T., Singh, K.: Optimizing similarity search for arbitrary length time series queries. IEEE Trans. KDE 16(2), 418–433 (2004)

    Google Scholar 

  4. Vlachos, M., et al.: Indexing time-series under conditions of noise. In: [1], pp. 67–100

    Google Scholar 

  5. Zeira, G., et al.: Change detection in classification models induced from time series data. In: [1], pp. 101–125

    Google Scholar 

  6. Tanaka, H., Uehara, K.: Discover motifs in multi-dimensionaltime-series using the principle component analysis and the MDL principle. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNCS (LNAI), vol. 2734, pp. 252–265. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Yang, J., Wang, W., Yu, P.S.: Mining asynchronous periodic patterns in time series data. IEEE Trans. KDE 15(3), 613–628 (2003)

    Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Fung, G.P.C.F., Yu, D.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)

    Chapter  Google Scholar 

  10. Povinelli, R.F., Feng, X.: A new temporal pattern identification method for characterization and prediction of complex time series events. IEEE Trans. KDE 15(2), 339–352 (2003)

    Google Scholar 

  11. Bunke, H.: Graph-based tools for data mining and machine learning. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNCS, vol. 2734, pp. 7–19. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. 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)

    Google Scholar 

  13. Dickinson, P., Bunke, H., Dadej, A., Kraetzl, M.: Matching graphs with unique node labels, accepted for publication in Pattern Analysis and Applications

    Google Scholar 

  14. Bunke, H., Dickinson, P., Kraetzl, M.: Analysis of Graph Sequences and Applications to Computer Network Monitoring, Technical Report, DSTO, Edinburgh, Australia (2003)

    Google Scholar 

  15. Quinland, R.: C4.5: Programs for Machine Learning. Morgen Kaufmann Publ., San Francisco (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bunke, H., Dickinson, P., Kraetzl, M. (2005). Comparison of Two Different Prediction Schemes for the Analysis of Time Series of Graphs. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492542_13

Download citation

  • DOI: https://doi.org/10.1007/11492542_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26154-4

  • Online ISBN: 978-3-540-32238-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics