Several Remarks on Mining Frequent Trajectories in Graphs

Abstract

We apply techniques that originate in the analysis of market basket data sets to the study of frequent trajectories in graphs. Trajectories are defined as simple paths through a directed graph, and we put forth some definitions and observations about the calculation of supports of paths in this context. A simple algorithm for calculating path supports is introduced and analyzed, but we explore an algorithm which takes advantage of traditional frequent item set mining techniques, as well as constraints placed on supports by the graph structure, for optimizing the calculation of relevant supports. To this end, the notion of the path tree is introduced, as well as an algorithm for producing such path trees.

DOI: 10.1007/978-3-642-31087-4_9

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Lo2012SeveralRO, title={Several Remarks on Mining Frequent Trajectories in Graphs}, author={Henry Z. Lo and Dan A. Simovici and Wei Ding}, booktitle={IEA/AIE}, year={2012} }