Mining frequent closed rooted trees
From MaRDI portal
Publication:1959538
DOI10.1007/s10994-009-5123-9zbMath1470.68079OpenAlexW2019510609MaRDI QIDQ1959538
José L. Balcázar, Antoni Lozano, Albert Bifet
Publication date: 7 October 2010
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-009-5123-9
Uses Software
Cites Work
- Formal methods for mining structured objects
- Mining Frequent Closed Unordered Trees Through Natural Representations
- Constant Time Generation of Rooted Trees
- Graph Transformations
- Database Theory - ICDT 2005
- Inductive Logic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mining frequent closed rooted trees