Mining frequent closed rooted trees
From MaRDI portal
Recommendations
Cites work
- Algorithms on trees and graphs
- Bottom-up subtree isomorphism for unordered labeled trees
- Constant Time Generation of Rooted Trees
- Efficiently mining frequent embedded unordered trees
- Formal concept analysis. Mathematical foundations. Transl. from the German by Cornelia Franzke
- Formal methods for mining structured objects
- Frequent subtree mining -- an overview
- Graph Transformations
- 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 2176112 (Why is no real title available?)
- Inductive Logic Programming
- Mining Frequent Closed Unordered Trees Through Natural Representations
- On Horn axiomatizations for sequential data
- Optimized substructure discovery for semi-structured data
- Text mining. Predictive methods for analyzing unstructured information.
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)