On Finding Frequent Patterns in Directed Acyclic Graphs

Details On Finding Frequent Patterns in Directed Acyclic Graphs On Finding Frequent Patterns in Directed Acyclic Graphs

2010-05-03

arxiv.org/abs/1005.0239v1

Computer Science

Data Structures and Algorithms

Scientific paper

Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some maximum length m). Since the number of paths can be huge, we propose novel algorithms whose time complexity depends only on the size of the graph, and on the relative frequency epsilon of the most frequent traces. In addition, we apply techniques from streaming algorithms to achieve space usage that depends only on epsilon, and not on the number of distinct traces. The abstract problem considered models a variety of tasks concerning finding frequent patterns in event sequences. Our motivation comes from working with a data set of 2 million RFID readings from baggage trolleys at Copenhagen Airport. The question of finding frequent passenger movement patterns is mapped to the above problem. We report on experimental findings for this data set.

Affiliated with

Also associated with

No associations

Rating

On Finding Frequent Patterns in Directed Acyclic Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Finding Frequent Patterns in Directed Acyclic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Finding Frequent Patterns in Directed Acyclic Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658347