a hybrid approach to temporal pattern matching

• DOI: 10.48550/arxiv.2001.01661
• Publication Date: 2020-12-07
• Authors: Evaggelia Pitoura; Konstantinos Seme...
• Keywords: FOS: Computer and information sciences; Computer Vision and Pattern Recognition (cs.CV); Computer Science - Data Structures and Algorithms; Computer Science - Computer Vision and Pattern Recognition; 0202 electrical engineering, electronic engineering, information engineering; Data Structures and Algorithms (cs.DS); 02 engineering and technology

The primary objective of graph pattern matching is to find all appearances of an input graph pattern query in a large data graph. Such appearances are called matches. In this paper, we are interested in finding matches of interaction patterns in temporal graphs. To this end, we propose a hybrid approach that achieves effective filtering of potential matches based both on structure and time. Our approach exploits a graph representation where edges are ordered by time. We present experiments with real datasets that illustrate the efficiency of our approach.<br/>4 pages, 4 figures, 1 table<br/>