Nearly exact mining of frequent trees in large networks
From MaRDI portal
Publication:2435702
DOI10.1007/s10618-013-0321-2zbMath1281.68166OpenAlexW2004069462MaRDI QIDQ2435702
Publication date: 19 February 2014
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/404056
Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- All normalized anti-monotonic overlap graph measures are bounded
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
- Vertex Cover: Further Observations and Further Improvements
- Transforming Graph Data for Statistical Relational Learning
- Faster Algebraic Algorithms for Path and Packing Problems
- Limits and Applications of Group Algebras for Parameterized Problems
- Algorithms for maximum independent sets
- An Algorithm for Subgraph Isomorphism
- Designing programs that check their work
- Inductive Logic Programming
This page was built for publication: Nearly exact mining of frequent trees in large networks