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.

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