Probabilistic and exact frequent subtree mining in graphs beyond forests

DOI10.1007/S10994-019-05779-1zbMATH Open1493.68323OpenAlexW2911550981MaRDI QIDQ2425250FDOQ2425250

Stefan Wrobel, T. 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

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

Cites Work

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

Cited In (4)

• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• Title not available (Why is that?)
• On subtree number index of generalized book graphs, fan graphs, and wheel graphs
• Full Perfect Extension Pruning for Frequent Subgraph Mining

Uses Software

• OEIS

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Probabilistic frequent subtrees for efficient graph classification and retrieval 👍 👎
• Efficient frequent connected subgraph mining in graphs of bounded tree-width 👍 👎
• Nearly exact mining of frequent trees in large networks 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425250)