Partial Covers, Reducts and Decision Rules in Rough Sets

Theory and Applications
Erscheinungsjahr 2009
ISBN: 978-3-540-69027-6
Verlag: Springer

Buch, Englisch, 152 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 910 g

Reihe: Studies in Computational Intelligence

PartialCovers. 8 1. 1. 1 MainNotions. 8 1. 1. 2 Known Results. 9 1. 1. 3 PolynomialApproximateAlgorithms. 10 1. 1. 4 Bounds on C (?)Based on Information about min GreedyAlgorithm Work. 13 1. 1. 5 UpperBoundon C (?). 17 greedy 1. 1. 6 Covers fortheMostPartofSetCoverProblems. 18 1. 2 PartialTests and Reducts. 22 1. 2. 1 MainNotions. 22 1. 2. 2Relationships betweenPartialCovers and Partial Tests. 23 1. 2. 3 PrecisionofGreedyAlgorithm. 24 1. 2. 4 PolynomialApproximateAlgorithms. 25 1. 2. 5 Bounds on R (?)Based on Information about min GreedyAlgorithm Work. 26 1. 2. 6 UpperBoundon R (?). 28 greedy 1. 2. 7 Tests fortheMostPartofBinaryDecisionTables. 29 1. 3 PartialDecision Rules.

Zielgruppe

Research

Autoren/Hrsg.

Moshkov, Mikhail Ju.

Piliszczuk, Marcin

Zielosko, Beata

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Fuzzy-Systeme

Inhaltsverzeichnis

Partial Covers, Reducts and Decision Rules.- Partial Covers, Reducts and Decision Rules with Weights.- Construction of All Irreducible Partial Covers, All Partial Reducts and All Irreducible Partial Decision Rules.- Experiments with Real-Life Decision Tables.- Universal Attribute Reduction Problem.