Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to find all the k-vertex subgraphs that appear with frequency greater than a given threshold. FSM has numerous applications ranging from biology to network science, as it provides a compact summary of the characteristics of the graph. However, the task is challenging, even more so for evolving graphs due to the streaming nature of the input and the exponential time complexity of the problem.
No takes yet. Share an insight, caveat, or question.
Aslay et al. (2018) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: