Patent ID: 8683423
Filing Date: 2014-03-25
Classification: G06F

Abstract:
1. A computer-implemented method for finding sequential patterns of attributes in a directed graph, the method comprising: (a) constructing a directed graph comprising a plurality of nodes and a plurality of edges between the nodes; (b) assigning at least one attribute to each of the nodes; (c) assigning a weight value to each of the edges, wherein each weight value represents a probability that a corresponding edge will be traversed when traversing the directed graph; (d) finding a first instance of a sequence of attributes, the first instance associated with a first sequence of nodes in the directed graph; (e) finding a second instance of the sequence of attributes, the second instance associated with a second sequence of nodes in the directed graph, the second sequence of nodes comprising at least one node that is not included in the first sequence of nodes; (f) calculating a first instance frequency support value associated with the first instance, and a second instance frequency support value associated with the second instance; and (g) calculating a sequence frequency support value by summing the first and second instance frequency support values.