SearchSkip to Search Results
This thesis introduces FlowGSP, a general-purpose sequence mining algorithm for flow graphs. FlowGSP ranks sequences according to the frequency with which they occur and according to their relative cost. This thesis also presents two parallel implementations of FlowGSP. The first implementation...
Flow graphs are an abstraction used to represent elements travelling through a network of nodes. The paths between nodes are directed edges in the graph, and the amount or transmission frequency of elements that go through the paths are edge weights. If additional data is associated with the...