Skip to main content

Mining Frequent Movement Patterns in Large Networks: A Parallel Approach Using Shapes

  • Conference paper
  • First Online:
Research and Development in Intelligent Systems XXXIII (SGAI 2016)


This paper presents the Shape based Movement Pattern (ShaMP) algorithm, an algorithm for extracting Movement Patterns (MPs) from network data that can later be used (say) for prediction purposes. The principal advantage offered by the ShaMP algorithm is that it lends itself to parallelisation so that very large networks can be processed. The concept of MPs is fully defined together with the realisation of the ShaMP algorithm. The algorithm is evaluated by comparing its operation with a benchmark Apriori based approach, the Apriori based Movement Pattern (AMP) algorithm, using large social networks generated from the Cattle tracking Systems (CTS) in operation in Great Britain (GB) and artificial networks.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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

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

Institutional subscriptions

Similar content being viewed by others


  1. Matsumura, N., Goldberg, D.E., Llorà, X.: Mining directed social network from message board. In: Special Interest Tracks and Posters of the 14th International Conference on World Wide Web, pp. 1092–1093. ACM (2005)

    Google Scholar 

  2. Chandrasekaran, B.: Survey of Network Traffic Models, vol. 567. Washington University, St. Louis CSE (2009)

    Google Scholar 

  3. Datta, S., Bhaduri, K., Giannella, C., Wolff, R., Kargupta, H.: Distributed data mining in peer-to-peer networks. IEEE Internet Comput. 10(4), 18–26 (2006)

    Article  Google Scholar 

  4. Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, J.P.: Adaptive fastest path computation on a road network: a traffic mining approach. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB Endowment, pp. 794–805 (2007)

    Google Scholar 

  5. Galloway, J., Simoff, S.J.: Network data mining: methods and techniques for discovering deep linkage between attributes. In: Proceedings of the 3rd Asia-Pacific Conference on Conceptual Modelling, vol. 53, pp. 21–32. Australian Computer Society, Inc. (2006)

    Google Scholar 

  6. Grama, A.: Introduction to Parallel Computing. Pearson Education (2003)

    Google Scholar 

  7. Raorane, A., Kulkarni, R.: Data mining techniques: a source for consumer behavior analysis (2011). arXiv:1109.1202

    Google Scholar 

  8. Gudmundsson, J., Laube, P., Wolle, T.: Movement patterns in spatio-temporal data. In: Encyclopedia of GIS, pp. 726–732. Springer (2008)

    Google Scholar 

  9. Campbell, W.M., Dagli, C.K., Weinstein, C.J.: Social network analysis with content and graphs. Lincoln Lab. J. 20(1) (2013)

    Google Scholar 

  10. Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques. Elsevier (2011)

    Google Scholar 

  11. Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487–499 (1994)

    Google Scholar 

  12. Bliss, C.A., Frank, M.R., Danforth, C.M., Dodds, P.S.: An evolutionary algorithm approach to link prediction in dynamic social networks. J. Comput. Sci. 5(5), 750–764 (2014)

    Article  MathSciNet  Google Scholar 

  13. Kim, M., Leskovec, J.: The network completion problem: Inferring missing nodes and edges in networks. In: SDM, vol. 11, pp. 47–58. SIAM (2011)

    Google Scholar 

  14. Forum, M.P.I.: Mpi: a message passing interface standard: version 2.2; message passing interface forum, September 4, 2009

    Google Scholar 

  15. Brawer, S.: Introduction to Parallel Programming. Academic Press (2014)

    Google Scholar 

  16. Gropp, W., Lusk, E., Doss, N., Skjellum, A.: A high-performance, portable implementation of the mpi message passing interface standard. Parallel Comput. 22(6), 789–828 (1996)

    Article  MATH  Google Scholar 

  17. Karonis, N.T., Toonen, B., Foster, I.: Mpich-g2: a grid-enabled implementation of the message passing interface. J. Parallel Distrib. Comput. 63(5), 551–563 (2003)

    Article  MATH  Google Scholar 

  18. Chen, L., Wang, C., Lau, F.C.: A grid middleware for distributed java computing with mpi binding and process migration supports. J. Comput. Sci. Technol. 18(4), 505–514 (2003)

    Article  Google Scholar 

  19. Baker, M., Carpenter, B., Shaft, A.: Mpj express: towards thread safe java hpc. In: 2006 IEEE International Conference on Cluster Computing, pp. 1–10. IEEE (2006)

    Google Scholar 

  20. Aggarwal, C.C.: Applications of frequent pattern mining. In: Frequent Pattern Mining, pp. 443–467. Springer (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Mohammed Al-Zeyadi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Al-Zeyadi, M., Coenen, F., Lisitsa, A. (2016). Mining Frequent Movement Patterns in Large Networks: A Parallel Approach Using Shapes. In: Bramer, M., Petridis, M. (eds) Research and Development in Intelligent Systems XXXIII. SGAI 2016. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47174-7

  • Online ISBN: 978-3-319-47175-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics