Set-oriented data mining in relational databases
From MaRDI portal
Publication:3122503
DOI10.1016/0169-023X(95)00024-MzbMATH Open0875.68335OpenAlexW2102340621WikidataQ127753775 ScholiaQ127753775MaRDI QIDQ3122503FDOQ3122503
Authors: 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
Recommendations
Cited In (19)
- Discovering gene association networks by multi-objective evolutionary quantitative association rules
- Data Mining with optimized two-dimensional association rules
- Title not available (Why is that?)
- Fuzzy association rules and the extended mining algorithms
- A fast algorithm for mining sequential patterns from large databases
- Algorithms and applications for universal quantification in relational databases.
- A heuristic for mining association rules in polynomial time.
- Title not available (Why is that?)
- Formal logics of discovery and hypothesis formation by machine
- A fast algorithm for mining association rules
- Listing closed sets of strongly accessible set systems with applications to data mining
- Title not available (Why is that?)
- Tableaux for functional dependencies and independencies
- Database Support for Data Mining Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Granular computing approach to finding association rules in relational database
- A decision making process application for the slurry production in ceramics via fuzzy cluster and data mining
This page was built for publication: Set-oriented data mining in relational databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122503)