Direct and incremental computing of maximal covering rules

DOI10.1007/3-540-45357-1_42MaRDI QIDQ2768589zbMATH OpenFDO

Authors Marzena Kryszkiewicz

Publication date 3 February 2002

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/2035/20350400

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• CLOSED SET BASED DISCOVERY OF MAXIMAL COVERING RULES
• scientific article; zbMATH DE number 1931911
• Logic of association rules
• scientific article; zbMATH DE number 1943768
• scientific article; zbMATH DE number 1882061

Cited in

(4)

• Data mining, reasoning and incremental information retrieval through non enlargeable rectangular relation coverage
• scientific article; zbMATH DE number 1931911 (Why is no real title available?)
• Description and mining method of maximal association rules based on logical formulas on soft sets
• CLOSED SET BASED DISCOVERY OF MAXIMAL COVERING RULES

This page was built for publication: Direct and incremental computing of maximal covering rules

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