With the technology advance and the growth of Internet, the information that can be found in this net, as well as the number of users that access to look for specific data is big...
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Based on the planar polygon shape classification, we propose a method—Standardized Binary String Descriptor of Convex Polygon—for classification of convex polygons, making it ...
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
Javier Esparza, Martin Leucker, Maximilian Schlund
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...