Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
DOI10.1007/978-3-540-78469-2_24zbMATH Open1136.68503OpenAlexW1596214598MaRDI QIDQ5452096FDOQ5452096
Authors: Yosuke Sasaki, Hitoshi Yamasaki, Takayoshi Shoudai, Tomoyuki Uchida
Publication date: 28 March 2008
Published in: Inductive Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78469-2_24
Recommendations
- Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
- Learning block-preserving graph patterns and its application to data mining
- Graph pattern matching with expressive outerplanar graph patterns
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Complete mining of frequent patterns from graphs: Mining graph data
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
- Inductive Logic Programming
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Faster Subtree Isomorphism
- Title not available (Why is that?)
- Ordered term tree languages which are polynomial time inductively inferable from positive data
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
Cited In (3)
This page was built for publication: Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452096)