Using trees to mine multirelational databases
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 42986 (Why is no real title available?)
- scientific article; zbMATH DE number 1934539 (Why is no real title available?)
- scientific article; zbMATH DE number 2101374 (Why is no real title available?)
- A simplied universal relation assumption and its properties
- ART: A hybrid classification model
- Constraint-Based Mining and Inductive Databases
- Distribution-based aggregation for relational learning with identifier attributes
- Efficiently mining frequent embedded unordered trees
- Frequent subtree mining -- an overview
- Maximal objects and the semantics of universal relation databases
- On the foundations of the universal relation model
- Top-down induction of first-order logical decision trees
Cited in
(5)- scientific article; zbMATH DE number 2019599 (Why is no real title available?)
- scientific article; zbMATH DE number 2089467 (Why is no real title available?)
- Multi-relational model tree induction tightly-coupled with a relational database
- Learning from skewed class multi-relational databases
- Top-Down Induction of Relational Model Trees in Multi-instance Learning
This page was built for publication: Using trees to mine multirelational databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408677)