Learning block-preserving graph patterns and its application to data mining
From MaRDI portal
Publication:1959502
DOI10.1007/s10994-009-5115-9zbMath1470.68202OpenAlexW1987526736MaRDI QIDQ1959502
Takayoshi Shoudai, Tomoyuki Uchida, Hitoshi Yamasaki, Yusuke Suzuki, Yosuke Sasaki
Publication date: 7 October 2010
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-009-5115-9
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (1)
Uses Software
Cites Work
- Data mining. Concepts and techniques
- Ordered term tree languages which are polynomial time inductively inferable from positive data
- Finding patterns common to a set of strings
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Mining Graph Data
- Exact Learning of Finite Unions of Graph Patterns from Queries
- Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
- Inductive inference of formal languages from positive data
- Inductive Logic Programming
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
- Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning block-preserving graph patterns and its application to data mining