Greedy Algorithms withWeights for Construction of Partial Association Rules

DOI10.3233/FI-2009-119zbMATH Open1191.68871OpenAlexW1597732433MaRDI QIDQ3397159FDOQ3397159

Authors: Marcin Piliszczuk, Beata Zielosko, Mikhail Moshkov 

Publication date: 22 September 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-119

Recommendations

• On construction of partial association rules with weights
• Greedy algorithm for construction of partial association rules
• On Partial Covers, Reducts and Decision Rules with Weights
• Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules
• On Partial Covers, Reducts and Decision Rules

zbMATH Keywords

weightsrough setsgreedy algorithmsinformation systemsassociation rules

Mathematics Subject Classification ID

Knowledge representation (68T30) Approximation algorithms (68W25) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cited In (4)

• On construction of partial association rules with weights
• Greedy algorithm for construction of partial association rules
• Comparison of heuristics for optimization of association rules
• Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules

This page was built for publication: Greedy Algorithms withWeights 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 Q3397159)