On partial covers, reducts and decision rules with weights

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

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. © Springer-Verlag Berlin Heidelberg 2007.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages211-246
Number of pages36
ISBN (Print)9783540711988
DOIs
StatePublished - Jan 1 2007
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21

Fingerprint

Dive into the research topics of 'On partial covers, reducts and decision rules with weights'. Together they form a unique fingerprint.

Cite this