Partial covers, reducts and decision rules with weights

Mikhail Ju Moshkov*, Marcin Piliszczuk, Beata Zielosko

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

26 Scopus citations

Abstract

In this chapter, we study the case, where each subset, used for covering, has its own weight, and we should minimize the total weight of subsets in partial cover. The same situation is with partial reducts and decision rules: each conditional attribute has its own weight, and we should minimize the total weight of attributes in partial reduct or decision rule. If weight of each attribute characterizes time complexity of attribute value computation, then we try to minimize total time complexity of computation of attributes from partial reduct or partial decision rule. If weight characterizes a risk of attribute value computation (as in medical or technical diagnosis), then we try to minimize total risk, etc.

Original languageEnglish (US)
Title of host publicationPartial Covers, Reducts and Decision Rules in Rough Sets
Subtitle of host publicationTheory and Applications
Pages51-96
Number of pages46
Volume145
DOIs
StatePublished - 2008
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume145
ISSN (Print)1860-949X

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this