Set-oriented data mining in relational databases
From MaRDI portal
Publication:3122503
DOI10.1016/0169-023X(95)00024-MzbMath0875.68335OpenAlexW2102340621WikidataQ127753775 ScholiaQ127753775MaRDI QIDQ3122503
Maurice A. W. Houtsma, Arun Swami
Publication date: 27 February 1997
Published in: Data & Knowledge Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0169-023x(95)00024-m
Related Items (9)
A decision making process application for the slurry production in ceramics via fuzzy cluster and data mining ⋮ Discovering gene association networks by multi-objective evolutionary quantitative association rules ⋮ A heuristic for mining association rules in polynomial time. ⋮ Tableaux for functional dependencies and independencies ⋮ A fast algorithm for mining association rules ⋮ A fast algorithm for mining sequential patterns from large databases ⋮ Granular computing approach to finding association rules in relational database ⋮ Fuzzy association rules and the extended mining algorithms ⋮ Formal logics of discovery and hypothesis formation by machine
This page was built for publication: Set-oriented data mining in relational databases
