Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

DOI10.1007/11548669MaRDI QIDQ5394476zbMATH OpenOpenAlexFDO

Authors Marcin Piliszczuk, Mikhail Moshkov

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmpartial coverpartial reductpartial test

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules
• On Partial Covers, Reducts and Decision Rules
• scientific article; zbMATH DE number 5129614
• Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions
• On Partial Covers, Reducts and Decision Rules with Weights

Cited in

(9)

• An algorithm for constructing irredundant tests for binary tables
• Irredundant test for binary tables
• scientific article; zbMATH DE number 5129614 (Why is no real title available?)
• scientific article; zbMATH DE number 3609171 (Why is no real title available?)
• Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions
• scientific article; zbMATH DE number 2222704 (Why is no real title available?)
• Partition Dependencies in Hierarchies of Probabilistic Decision Tables
• Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules
• Rudiments of rough sets

This page was built for publication: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

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