Mining Frequent Closed Unordered Trees Through Natural Representations

DOI10.1007/978-3-540-73681-3_26MaRDI QIDQ3608751zbMATH OpenOpenAlexFDO

Authors José L. Balcázar, Albert Bifet, Antoni Lozano

Publication date 6 March 2009

Published in Conceptual Structures: Knowledge Architectures for Smart Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73681-3_26

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• Mining frequent closed rooted trees
• Efficiently mining frequent embedded unordered trees
• Frequent subtree mining -- an overview
• Inductive Logic Programming
• Constraint-Based Mining and Inductive Databases

Cited in

(5)

• Mining rooted ordered trees under subtree homeomorphism
• Mining frequent closed rooted trees
• Inductive Logic Programming
• Efficiently mining frequent embedded unordered trees
• scientific article; zbMATH DE number 2207723 (Why is no real title available?)

Describes a project that uses

Uses Software

• gSpan

This page was built for publication: Mining Frequent Closed Unordered Trees Through Natural Representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608751)