Exact Learning of Finite Unions of Graph Patterns from Queries

DOI10.1007/978-3-540-75225-7_25zbMath1142.68402OpenAlexW1603870374MaRDI QIDQ3520068

Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida, Yusuke Suzuki, Rika Okada

Publication date: 19 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75225-7_25

Mathematics Subject Classification ID

Computational learning theory (68Q32) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On the regularity and learnability of ordered DAG languages ⋮ Learning block-preserving graph patterns and its application to data mining ⋮ Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining

Cites Work

• Topology of series-parallel networks
• Inductive Logic Programming
• A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
• Algorithmic Learning Theory
• On exact learning of unordered tree patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact Learning of Finite Unions of Graph Patterns from Queries