Inductive Logic Programming

DOI10.1007/11536314zbMath1134.68464OpenAlexW2770134670MaRDI QIDQ5394634

Takeaki Uno, Hiroki Arimura

Publication date: 1 November 2006

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

Full work available at URL: https://doi.org/10.1007/11536314

zbMATH Keywords

closure operationdescription logicsemi-structured datatree miningoutput-sensitive algorithmattribute treefrequent closed pattern miningthe least general generalization

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Mining frequent closed rooted trees ⋮ Mining closed patterns in relational, graph and network data ⋮ Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

Uses Software

• gSpan

This page was built for publication: Inductive Logic Programming