Using trees to mine multirelational databases

DOI10.1007/s10618-011-0218-xzbMath1235.68067OpenAlexW2106195708MaRDI QIDQ408677

Aída Jiménez, Juan-Carlos Cubero, Fernando Berzal

Publication date: 11 April 2012

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-011-0218-x

zbMATH Keywords

association rulesfrequent itemset miningmultirelational databasestree pattern mining

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• CrossMine
• Warmr

Cites Work

• ART: A hybrid classification model
• Top-down induction of first-order logical decision trees
• Distribution-based aggregation for relational learning with identifier attributes
• Maximal objects and the semantics of universal relation databases
• On the foundations of the universal relation model
• A simplied universal relation assumption and its properties
• Constraint-Based Mining and Inductive Databases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item