Probabilistic and exact frequent subtree mining in graphs beyond forests

DOI10.1007/s10994-019-05779-1zbMath1493.68323OpenAlexW2911550981MaRDI QIDQ2425250

Stefan Wrobel, Tamás L. Horváth, Pascal Welke

Publication date: 26 June 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-019-05779-1

zbMATH Keywords

pattern miningfrequent subgraph miningfrequent subtree miningprobabilistic patterns

Mathematics Subject Classification ID

Trees (05C05) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On subtree number index of generalized book graphs, fan graphs, and wheel graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• On generating all maximal independent sets
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• Probabilistic frequent subtrees for efficient graph classification and retrieval
• Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree
• O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• An Algorithm for Subgraph Isomorphism
• Faster Subtree Isomorphism
• Frequent Hypergraph Mining
• Depth-First Search and Linear Graph Algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Probabilistic and exact frequent subtree mining in graphs beyond forests