MaxDomino: Efficiently mining maximal sets

DOI10.1007/3-540-45073-4_11MaRDI QIDQ4444385zbMATH OpenFDO

Authors Krishnamoorthy Srikumar, Bharat Bhasker, Satish K. Tripathi

Publication date 27 January 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2712/27120131.htm

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• A maximal frequent itemset algorithm
• MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree
• scientific article; zbMATH DE number 2202222
• scientific article; zbMATH DE number 2219521
• scientific article; zbMATH DE number 6672129

Cited in

(3)

• MaxDomino
• MædMax: a maximal ordered completion tool
• scientific article; zbMATH DE number 5347083 (Why is no real title available?)

This page was built for publication: MaxDomino: Efficiently mining maximal sets

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