Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules

DOI10.1007/11795131_42MaRDI QIDQ5758012zbMATH OpenOpenAlexFDO

Authors Marcin Piliszczuk, Beata Zielosko, Mikhail Moshkov

Publication date 7 September 2007

Published in Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11795131_42

zbMATH Keywords

greedy algorithmspartial decision rulespartial reductsweights

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On Partial Covers, Reducts and Decision Rules with Weights
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• On Partial Covers, Reducts and Decision Rules
• Greedy Algorithms withWeights for Construction of Partial Association Rules
• On construction of partial association rules with weights

Cited in

(8)

• Lower bounds for some decision problems over \(C\)
• Greedy Algorithms withWeights for Construction of Partial Association Rules
• scientific article; zbMATH DE number 5129614 (Why is no real title available?)
• On Partial Covers, Reducts and Decision Rules with Weights
• On Partial Covers, Reducts and Decision Rules
• scientific article; zbMATH DE number 7561759 (Why is no real title available?)
• On construction of partial association rules with weights
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

This page was built for publication: Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules

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