Greedy algorithm for construction of partial association rules

MaRDI QIDQ3638001zbMATH OpenFDO

Authors Marcin Piliszczuk, Beata Zielosko, Mikhail Moshkov

Publication date 14 July 2009

zbMATH Keywords

approximate algorithmsbinary information systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Approximation algorithms (68W25)

Recommendations

• Greedy Algorithms withWeights for Construction of Partial Association Rules
• On construction of partial association rules with weights
• On Partial Covers, Reducts and Decision Rules
• Comparison of heuristics for optimization of association rules
• On Partial Covers, Reducts and Decision Rules with Weights

Cited in

(5)

• Greedy algorithm for set cover in context of knowledge discovery problems
• Greedy Algorithms withWeights for Construction of Partial Association Rules
• Dynamic programming approach for construction of association rule systems
• On construction of partial association rules with weights
• Comparison of heuristics for optimization of association rules

This page was built for publication: Greedy algorithm for construction of partial association rules

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