Efficiently Approximating Top-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> Sequential Patterns in Transactional Graphs

In real-world networks, an edge (or vertex) may be associated with a transaction database, where each transaction consists of a set of items to describe the attributes or behaviors of the edge (or vertex). This type of graph is named as a transactional graph, and the problem of mining sequential pat...

Full description

Bibliographic Details
Main Authors: Mingtao Lei, Xi Zhang, Jincui Yang, Binxing Fang
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8713866/

Similar Items