Probabilistic and exact frequent subtree mining in graphs beyond forests

Motivated by the impressive predictive power of simple patterns, we consider the problem of mining frequent subtrees in arbitrary graphs. Although the restriction of the pattern language to trees does not resolve the computational complexity of frequent subgraph mining, in a recent work we have show...

Full description

Saved in:

Bibliographic Details
Published in:	Machine learning Vol. 108; no. 7; pp. 1137 - 1164
Main Authors:	Welke, Pascal, Horváth, Tamás, Wrobel, Stefan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2019 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Clustering Complexity Computer Science Control Delay Graph theory Graphs Mechatronics Natural Language Processing (NLP) Polynomials Robotics Set theory Simulation and Modeling Special Issue of the Inductive Logic Programming (ILP) 2017-2018 Trees (mathematics) Probabilistic patterns Pattern mining Frequent subtree mining Frequent subgraph mining
ISSN:	0885-6125, 1573-0565
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!