Mining frequent closed rooted trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2130222 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 558659 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 1934539 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- scientific article; zbMATH DE number 1820633 (Why is no real title available?)
- Bottom-up subtree isomorphism for unordered labeled trees
- Constant Time Generation of Rooted Trees
- Database Theory - ICDT 2005
- Efficiently mining frequent embedded unordered trees
- Formal methods for mining structured objects
- Frequent subtree mining -- an overview
- Graph Transformations
- Inductive Logic Programming
- Mining Frequent Closed Unordered Trees Through Natural Representations
Cited in
(5)
This page was built for publication: Mining frequent closed rooted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959538)