Universal attribute reduction problem

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/978-3-540-69029-0_6

Universal attribute reduction problem

Mikhail Ju Moshkov^*, Marcin Piliszczuk, Beata Zielosko

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

The attribute reduction problem (it is required to find a reduct with minimal or close to minimal cardinality) is one of the main problems of rough set theory and related theories such as test theory and LAD. There are different variants of the notion of reduct: reducts for information systems, usual decision and local reducts for decision tables, decision and local reducts which are based on the generalized decision, etc. Interesting discussion of various kinds of reducts can be found in [38].

Original language	English (US)
Title of host publication	Partial Covers, Reducts and Decision Rules in Rough Sets
Subtitle of host publication	Theory and Applications
Editors	Mikhail Moshkov, Beata Zielosko, Marcin Piliszczuk
Pages	135-142+145-148
DOIs	https://doi.org/10.1007/978-3-540-69029-0_6
State	Published - 2008
Externally published	Yes

Publication series

Name	Studies in Computational Intelligence
Volume	145
ISSN (Print)	1860-949X

ASJC Scopus subject areas

Artificial Intelligence

Access to Document

10.1007/978-3-540-69029-0_6

Cite this

@inbook{cd162651c78c42ecbdcb7c9caeb02d14,

title = "Universal attribute reduction problem",

abstract = "The attribute reduction problem (it is required to find a reduct with minimal or close to minimal cardinality) is one of the main problems of rough set theory and related theories such as test theory and LAD. There are different variants of the notion of reduct: reducts for information systems, usual decision and local reducts for decision tables, decision and local reducts which are based on the generalized decision, etc. Interesting discussion of various kinds of reducts can be found in [38].",

author = "Moshkov, {Mikhail Ju} and Marcin Piliszczuk and Beata Zielosko",

year = "2008",

doi = "10.1007/978-3-540-69029-0_6",

language = "English (US)",

isbn = "9783540690276",

series = "Studies in Computational Intelligence",

pages = "135--142+145--148",

editor = "Mikhail Moshkov and Beata Zielosko and Marcin Piliszczuk",

booktitle = "Partial Covers, Reducts and Decision Rules in Rough Sets",

}

Universal attribute reduction problem. / Moshkov, Mikhail Ju; Piliszczuk, Marcin; Zielosko, Beata.
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. ed. / Mikhail Moshkov; Beata Zielosko; Marcin Piliszczuk. 2008. p. 135-142+145-148 (Studies in Computational Intelligence; Vol. 145).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Universal attribute reduction problem

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

PY - 2008

Y1 - 2008

N2 - The attribute reduction problem (it is required to find a reduct with minimal or close to minimal cardinality) is one of the main problems of rough set theory and related theories such as test theory and LAD. There are different variants of the notion of reduct: reducts for information systems, usual decision and local reducts for decision tables, decision and local reducts which are based on the generalized decision, etc. Interesting discussion of various kinds of reducts can be found in [38].

AB - The attribute reduction problem (it is required to find a reduct with minimal or close to minimal cardinality) is one of the main problems of rough set theory and related theories such as test theory and LAD. There are different variants of the notion of reduct: reducts for information systems, usual decision and local reducts for decision tables, decision and local reducts which are based on the generalized decision, etc. Interesting discussion of various kinds of reducts can be found in [38].

UR - http://www.scopus.com/inward/record.url?scp=51649105695&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69029-0_6

DO - 10.1007/978-3-540-69029-0_6

M3 - Chapter

AN - SCOPUS:51649105695

SN - 9783540690276

T3 - Studies in Computational Intelligence

SP - 135-142+145-148

BT - Partial Covers, Reducts and Decision Rules in Rough Sets

A2 - Moshkov, Mikhail

A2 - Zielosko, Beata

A2 - Piliszczuk, Marcin

ER -

Universal attribute reduction problem

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this