Skip to main content

Advertisement

Springer Nature Link
Log in

Learning and prediction of relational time series

  • Published:
Computational and Mathematical Organization Theory Aims and scope Submit manuscript

Abstract

Learning to predict events in the near future is fundamental to human and artificial agents. Many prediction techniques are unable to learn and predict a stream of relational data online when the environments are unknown, non-stationary, and no prior training examples are available. This paper addresses the online prediction problem by introducing a low complexity learning technique called Situation Learning and several prediction techniques that use the information from Situation Learning to predict the next likely event. The prediction techniques include two variants of a Bayesian inference technique, a variable order Markov model prediction technique and situation matching techniques. We compared their prediction accuracies quantitatively for three domains: a role-playing game, computer network intrusion system alerts, and event prediction of maritime paths in a discrete-event simulator.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Ames M, Chan C, Chng K, Cole A, Johnson D, Kwai K, Koh K, Lim H, Lim T, Liu Y, Marsh A, McRoberts C, Ng C, Ng C, Ng M, Nguyen H, Okruhlik L, Oh P, Ong K, Peh L, Soh W, Tan C, Toh L, Torian J, Wong Y (2007) Port security strategy 2012. M.S. thesis, Naval Postgraduate School, Monterey, California

  • Buhlmann P, Wyner AJ (1999) Variable length Marov chains. Ann Stat 27(2):480–513

    Article  Google Scholar 

  • Buss A (2002) Component-based simulation modeling with Simkit. Proceedings of the 2002 Winter Simulation Conference. doi:10.1.1.1.5324

  • Chen SF, Goodman J (1999) An empirical study of smoothing techniques for language modeling. Comput Speech Lang 13:359–393

    Article  Google Scholar 

  • Daly R, Shen Q, Aitken S (2011) Learning Bayesian networks: approaches and issues. Knowl Eng Rev 26(2):99–157

    Article  Google Scholar 

  • Darken C (2005) Towards learned anticipation in complex stochastic environmentss. Proceedings of the Artificial Intelligence for Interactive Digital Entertainment, pp 27–32

  • Debar H (2000) An introduction to intrusion-detection systems> Proceedings of Connect. doi 10.1.1.101.7433

  • Frederick E, Rowe N, Wong A (2012) Testing deception tactics in response to cyberattacks. Proceedings of the National Symposium on Moving Target Research, Annapolis. Available at http://cps-vo.org/node/3711

  • Getoor L, Taskar B (2007) Introduction to statistical relational learning. The MIT Press, Cambridge

    Google Scholar 

  • Jungkunz P, Darken CJ (2011) A computational model for human eye-movements in military simulations. Comput Math Organ Theory 17(3):229–250

    Article  Google Scholar 

  • Khosravi H, Bina B (2010) A survey on statistical relational learning. Proceedings of the Canadian Conference on Artificial Intelligence, pp 256–268

  • Kott A, McEneaney W (2006) Adversarial reasoning: computational approaches to reading the opponent’s mind. Chapman and Hall/CRC, Boca Raton

    Book  Google Scholar 

  • Kunde D, Darken C (2006) A mental simulation-based decision-making architecture applied to ground combat. Proceedings of the behavior representation in modeling & simulation. doi:10.1.1.64.713

  • Kurby CA, Zacks JM (2007) Segmentation in the perception and memory of events. Trends Cognit Sci 12(2):72–79. doi:10.1016/j.tics.2007.11.004

    Article  Google Scholar 

  • László B, Paolo C (2008) Isomorphism of hypergraphs of low rank in moderately exponential time. FOCS ‘08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, pp 667–676, ISBN 978-0-7695-3436-7

  • Li Z, Zhang A, Lei J, Wang L (2007) Real-time correlation of network security alerts. Proceedings of IEEE International Conference on e-Business Engineering, pp 73–80

  • McGregor JJ (1982) Backtrack search algorithms and the maximal common subgraph problem. Softw Pract Exp 12:23–34

    Article  Google Scholar 

  • Qin X (2005) A probabilistic-based framework for INFOSEC alert correlation. Ph.D. dissertation, Georgia Institute of Technology, Atlanta, Georgia

  • Roesch M (1999) Snort—lightweight intrusion-detection for networks. Proceedings of LISA’99: 13th Systems Administration Conference, pp 229–238

  • Russell S, Norvig P (2010) Artificial intelligence: a modern approach. Prentice Hall, Upper Saddle River

    Google Scholar 

  • Sapankevych N, Sankar R (2009) Time-series prediction using support vector machine: a survey. Proc IEEE Comput Intell Mag 4(2):24–38

    Article  Google Scholar 

  • Sun R, Giles CL (2001) Sequence learning: from recognition and prediction to sequential decision making. IEEE Intell Syst 16(4):67–70

    Article  Google Scholar 

  • Tan T (2007) Tactical plan generation software for maritime interdiction using conceptual blending theory. M.S. thesis, Naval Postgraduate School, Monterey, California

Download references

Author information

Authors and Affiliations

  1. DSO National Laboratories, 20 Science Park Drive, Singapore, 118230, Singapore

    Terence K. Tan

  2. The MOVES Institute, Naval Postgraduate School, 700 Dyer Road, Watkins Ext. 265, Monterey, CA, 93943-5001, USA

    Christian J. Darken

Authors
  1. Terence K. Tan
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Christian J. Darken
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Terence K. Tan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tan, T.K., Darken, C.J. Learning and prediction of relational time series. Comput Math Organ Theory 21, 210–241 (2015). https://doi.org/10.1007/s10588-015-9182-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10588-015-9182-0

Keywords