A MapReduce-based Approach for Finding Inexact Patterns in Large Graphs

Péter Fehér, Márk Asztalos, Tamás Mészáros, Laszlo Lengyel

2015

Abstract

Finding patterns in graphs is a fundamental problem in graph theory, and also a practical challenge during the analysis of big data sets. Inexact patterns may correspond to a set of possible exact graphs. Their use is important in many fields where pattern matching is applied (e.g. mining in social networks or criminal investigations). Based on previous work, this paper introduces a pattern specification language with special language features to express inexact patterns. We also show a MapReduce approach-based algorithm that is able to find matches. Our methods make it possible to define inexact patterns and to find the exact matches in large graphs efficiently.

References

  1. Apache Hadoop (2011). Apache Hadoop Project. http:// hadoop.apache.org/.
  2. Berry, J. W. (2010). Practical heuristics for inexact subgraph isomorphism.
  3. Coffman, T., Greenblatt, S., and Marcus, S. (2004). Graphbased technologies for intelligence analysis. Communications ACM, 47(3):45-47.
  4. Dean, J. and Ghemawat, S. (2008). Mapreduce: Simplified data processing on large clusters. Communications of the ACM, 51(1):107-113.
  5. Dörr, H. (1995). Efficient Graph Rewriting and Its Implementation. Springer-Verlag New York, Inc., Secaucus, NJ, USA.
  6. Ehrig, H., Ehrig, K., Prange, U., and Taentzer, G. (2006). Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series). Springer-Verlag New York, Inc., Secaucus, NJ, USA.
  7. Fehér, P., Vajk, T., Charaf, H., and Lengyel, L. (2013). Mapreduce algorithm for finding st-connectivity. In 4th IEEE International Conference on Cognitive Infococommunications - CogInfoCom 2013.
  8. Karloff, H., Suri, S., and Vassilvitskii, S. (2010). A model of computation for mapreduce. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 938-948. Society for Industrial and Applied Mathematics.
  9. Kim, S.-H., Lee, K.-H., Choi, H., and Lee, Y.-J. (2013). Parallel processing of multiple graph queries using mapreduce. In DBKDA 2013, The Fifth International Conference on Advances in Databases, Knowledge, and Data Applications, pages 33-38.
  10. Liu, Y., Jiang, X., Chen, H., Ma, J., and Zhang, X. (2009). Mapreduce-based pattern finding algorithm applied in motif detection for prescription compatibility network. In Advanced Parallel Processing Technologies, pages 341-355. Springer.
  11. Mezei, G., Levendovszky, T., Meszaros, T., and Madari, I. (2009). Towards truly parallel model transformations: A distributed pattern matching approach. In EUROCON 2009, EUROCON 7809. IEEE, pages 403-410.
  12. Plantenga, T. (2012). Inexact subgraph isomorphism in mapreduce. Journal of Parallel and Distributed Computing.
  13. Plump, D. (1998). Termination of graph rewriting is undecidable. Fundamenta Informaticae, 33(2):201-209.
  14. Tong, H., Faloutsos, C., Gallagher, B., and Eliassi-Rad, T. (2007). Fast best-effort pattern matching in large attributed graphs. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 737-746. ACM.
  15. Windows Azure (2013). http://www.windowsazure.com/ en-us/.
Download


Paper Citation


in Harvard Style

Fehér P., Asztalos M., Mészáros T. and Lengyel L. (2015). A MapReduce-based Approach for Finding Inexact Patterns in Large Graphs . In Proceedings of the 3rd International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD, ISBN 978-989-758-083-3, pages 205-212. DOI: 10.5220/0005231102050212


in Bibtex Style

@conference{modelsward15,
author={Péter Fehér and Márk Asztalos and Tamás Mészáros and Laszlo Lengyel},
title={A MapReduce-based Approach for Finding Inexact Patterns in Large Graphs},
booktitle={Proceedings of the 3rd International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,},
year={2015},
pages={205-212},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005231102050212},
isbn={978-989-758-083-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,
TI - A MapReduce-based Approach for Finding Inexact Patterns in Large Graphs
SN - 978-989-758-083-3
AU - Fehér P.
AU - Asztalos M.
AU - Mészáros T.
AU - Lengyel L.
PY - 2015
SP - 205
EP - 212
DO - 10.5220/0005231102050212