Frequent itemset discovery with SQL using universal quantification

DOI10.1007/978-3-540-44497-8_10MaRDI QIDQ5717469zbMATH OpenOpenAlexFDO

Authors Ralf Rantzau

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99016

Mathematics Subject Classification ID

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

Recommendations

• Algorithms and applications for universal quantification in relational databases.
• Knowledge Discovery in Inductive Databases
• scientific article; zbMATH DE number 1041844
• Knowledge Discovery in Inductive Databases
• An algorithm for discovering the frequent closed itemsets in a large database

Cited in

(2)

• Algorithms and applications for universal quantification in relational databases.
• Inductive databases and multiple uses of frequent itemsets: The cInQ approach

This page was built for publication: Frequent itemset discovery with SQL using universal quantification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717469)