Skip to main content

A Sliding Window Method for Online Tracking of Spatiotemporal Event Patterns

  • Conference paper
  • First Online:
  • 1584 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9864))

Abstract

Online Tracking of Spatiotemporal Event Patterns (OTSEP) is important in the fields of smart home and Internet of Things (IoT), but difficult to be resolved due to various noises. On account of the strong learning capability in noisy environments, Learning Automaton (LA) has been adopted in the existing literature to notify users once a pattern disappears, and suppress the notification to avoid the distraction from noise if a pattern exists. However, the LA-based models require continuous and identical responses from the environment to jump to another action, which lowers their learning speed especially when the noise level is high. This paper proposes a sliding window method, with which the learning speed is stable in different environments. Experimental results show that the learning accuracy and speed are greatly improved over the existing methods in dynamic and noisy environments.

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   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

References

  1. Bellinger, C.: Simulation and pattern classification for rare and episodic events. Master’s thesis, Carleton University, Ottawa, Ontario (2010)

    Google Scholar 

  2. Bellinger, C., Oommen, B.J.: On simulating episodic events against a background of noise-like non-episodic events. In: Proceedings of the 2010 Summer Computer Simulation Conference. Society for Computer Simulation International, pp. 452–460 (2010)

    Google Scholar 

  3. Ma, S., Hellerstein, J.L.: Mining partially periodic event patterns with unknown periods. In: Proceedings of 17th International Conference on Data Engineering, 2001. IEEE, pp. 205–214 (2001)

    Google Scholar 

  4. Youngblood, G.M., Cook, D.J.: Data mining for hierarchical model creation. IEEE Trans. Syst. Man Cybern. Part C 37(4), 561–572 (2007)

    Article  Google Scholar 

  5. Lee, C.H., Chen, M.S., Lin, C.R.: Progressive partition miner: an efficient algorithm for mining general temporal association rules. IEEE Trans. Knowl. Data Eng. 15(4), 1004–1017 (2003)

    Article  Google Scholar 

  6. Rashidi, P., Cook, D.J.: Keeping the intelligent environment resident in the loop. In: 2008 IET 4th International Conference on Intelligent Environments, pp. 1–9. IET, July 2008

    Google Scholar 

  7. Rashidi, P., Cook, D.J.: Keeping the resident in the loop adapting the smart home to the user. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 39(5), 949–959 (2009)

    Article  Google Scholar 

  8. Thathachar, M.A.L., Oommen, B.J.: Automata Theory and the Modelling of Biological Systems. Academic, New York (1973)

    MATH  Google Scholar 

  9. Poznyak, A.S., Najim, K.: Learning Automata and Stochastic Optimization. Springer, Berlin (1997)

    MATH  Google Scholar 

  10. Thathachar, M.A., Sastry, P.S.: Networks of Learning Automata: Techniques for Online Stochastic Optimization. Springer Science & Business Media, New York (2011)

    Google Scholar 

  11. Oommen, B.J., Hashem, M.K.: Modeling a student-classroom interaction in a tutorial-like system using learning automata. IEEE Trans. Syst. Man Cybern. Part B Cybern. 40(1), 29–42 (2010)

    Article  MATH  Google Scholar 

  12. Huang, D.S., Jiang, W.: A general CPL-AdS methodology for fixing dynamic parameters in dual environments. IEEE Trans. Syst. Man Cybern. Part B Cybern. 42(5), 1489–1500 (2012)

    Article  Google Scholar 

  13. Yazidi, A., Granmo, O.C., Oommen, B.J.: Learning-automaton-based online discovery and tracking of spatiotemporal event patterns. IEEE Trans. Cybern. 43(3), 1118–1130 (2013)

    Article  Google Scholar 

  14. Narendra, K.S., Thathachar, M.A.: Learning Automata: An Introduction. Courier Corporation, North Chelmsford (2012)

    MATH  Google Scholar 

  15. Jiang, W., Zhao, C.L., Li, S.H., Chen, L.: A new learning automata based approach for online tracking of event patterns. Neurocomputing 137, 205–211 (2014)

    Article  Google Scholar 

  16. Jamalian, A.H., Iraji, R., Sefidpour, A.R., Manzuri-Shalmani, M.T.: Examining the \(\varepsilon \)-optimality property of a tunable FSSA. In: 6th IEEE International Conference on Cognitive Informatics, Lake Tahoo, CA, pp. 169–177 (2007)

    Google Scholar 

Download references

Acknowledgement

This work is supported by China NSF under Grants No. 61572359, 61272271 and 61332008, US NSF under Grant No. CMMI-1162482, and partly supported by the Fundamental Research Funds for the Central Universities of China (No. 0800219332, 1012015115).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to JunQi Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Zhang, J., Zhu, S., Zang, D., Zhou, M. (2016). A Sliding Window Method for Online Tracking of Spatiotemporal Event Patterns. In: Li, W., et al. Internet and Distributed Computing Systems. IDCS 2016. Lecture Notes in Computer Science(), vol 9864. Springer, Cham. https://doi.org/10.1007/978-3-319-45940-0_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45940-0_48

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45939-4

  • Online ISBN: 978-3-319-45940-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics