Probabilistic and exact frequent subtree mining in graphs beyond forests
From MaRDI portal
Publication:2425250
DOI10.1007/S10994-019-05779-1zbMATH Open1493.68323OpenAlexW2911550981MaRDI QIDQ2425250FDOQ2425250
Authors: Pascal Welke, T. Horváth, Stefan Wrobel 
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
Recommendations
- Efficient frequent subtree mining beyond forests
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- Nearly exact mining of frequent trees in large networks
- Frequent subtree mining -- an overview
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
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?)
- An Algorithm for Subgraph Isomorphism
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Frequent subtree mining -- an overview
- 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
- Title not available (Why is that?)
Cited In (6)
- Efficient mining for structurally diverse subgraph patterns in large molecular databases
- 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
- Polynomial-delay enumeration of monotonic graph classes
- Full Perfect Extension Pruning for Frequent Subgraph Mining
Uses Software
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)
