On partial covers, reducts and decision rules with weights. (English) Zbl 1186.68467

Moshkov, Mikhail Ju.; Piliszczuk, Marcin; Zielosko, Beata

Peters, James F. (ed.) et al., Transactions on Rough Sets VI. Commemorating life and work of Zdisław Pawlak, Part I. Berlin: Springer (ISBN 978-3-540-71198-8/pbk). Lecture Notes in Computer Science 4374. Journal Subline, 211-246 (2007).

Summary: In the paper the accuracy of greedy algorithms with weights for construction of partial covers, reducts and decision rules is considered. Bounds on minimal weight of partial covers, reducts and decision rules based on an information on greedy algorithm work are studied. Results of experiments with software implementation of greedy algorithms are described.
For the entire collection see [Zbl 1115.68005].

MSC:

68T37	Reasoning under uncertainty in the context of artificial intelligence
68T30	Knowledge representation
68W40	Analysis of algorithms

Keywords:

partial cover; partial reduct; partial decision rule; weight; greedy algorithm