Mining closed patterns in relational, graph and network data
From MaRDI portal
Publication:2248524
DOI10.1007/s10472-012-9324-8zbMath1357.68169OpenAlexW2095398376MaRDI QIDQ2248524
Luc De Raedt, Gemma C. Garriga, Roni Khardon
Publication date: 26 June 2014
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-012-9324-8
Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55)
Related Items
Mining closed patterns in relational, graph and network data ⋮ Graph-FCA: an extension of formal concept analysis to knowledge graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective feature construction by maximum common subgraph sampling
- Clausal discovery
- Horn axiomatizations for sequential data
- Foundations of inductive logic programming
- On maximal frequent and minimal infrequent sets in binary matrices
- Mining closed patterns in relational, graph and network data
- Logical and Relational Learning
- Inductive Logic Programming: Theory and methods
- Inductive Logic Programming
- Inductive Logic Programming
- Discovery Science
- Inductive Logic Programming
- Concept Lattices
- Learning logic programs with structured background knowledge
This page was built for publication: Mining closed patterns in relational, graph and network data