Greedy algorithm for set cover in context of knowledge discovery problems

MaRDI QIDQ2843957zbMATH OpenFDO

Authors Mikhail Moshkov

Publication date 27 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104807163

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• On Partial Covers, Reducts and Decision Rules
• On Partial Covers, Reducts and Decision Rules with Weights
• Covering analysis of the greedy algorithm for partial cover
• Improved performance of the greedy algorithm for partial cover
• Greedy algorithm for construction of partial association rules

Cited in

(4)

• Utilizing minimum set-cover structures with several constraints for knowledge discovery on large literature databases
• On Partial Covers, Reducts and Decision Rules
• A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
• Secure state estimation for cyber-physical systems under sparse data injection attacks: a switched counteraction approach

This page was built for publication: Greedy algorithm for set cover in context of knowledge discovery problems

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