On covering attribute sets by reducts

Mikhail Moshkov; Andrzej Skowron; Zbigniew Suraj

doi:10.1007/978-3-540-73451-2_19

On covering attribute sets by reducts

Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

18 Scopus citations

Abstract

For any fixed natural k, there exists a polynomial in time algorithm which for a given decision table T and given k conditional attributes recognizes if there exist a decision reduct of T containing these k attributes. © Springer-Verlag Berlin Heidelberg 2007.

Original language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	175-180
Number of pages	6
ISBN (Print)	9783540734505
DOIs	https://doi.org/10.1007/978-3-540-73451-2_19
State	Published - Jan 1 2007
Externally published	Yes

Bibliographical note

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

Access to Document

10.1007/978-3-540-73451-2_19

Cite this

@inproceedings{06e72824925c4b66abb9f0f77047d184,

title = "On covering attribute sets by reducts",

abstract = "For any fixed natural k, there exists a polynomial in time algorithm which for a given decision table T and given k conditional attributes recognizes if there exist a decision reduct of T containing these k attributes. {\textcopyright} Springer-Verlag Berlin Heidelberg 2007.",

author = "Mikhail Moshkov and Andrzej Skowron and Zbigniew Suraj",

note = "Generated from Scopus record by KAUST IRTS on 2023-09-21",

year = "2007",

month = jan,

day = "1",

doi = "10.1007/978-3-540-73451-2_19",

language = "English (US)",

isbn = "9783540734505",

pages = "175--180",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

address = "Germany",

}

TY - GEN

T1 - On covering attribute sets by reducts

AU - Moshkov, Mikhail

AU - Skowron, Andrzej

AU - Suraj, Zbigniew

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

PY - 2007/1/1

Y1 - 2007/1/1

N2 - For any fixed natural k, there exists a polynomial in time algorithm which for a given decision table T and given k conditional attributes recognizes if there exist a decision reduct of T containing these k attributes. © Springer-Verlag Berlin Heidelberg 2007.

AB - For any fixed natural k, there exists a polynomial in time algorithm which for a given decision table T and given k conditional attributes recognizes if there exist a decision reduct of T containing these k attributes. © Springer-Verlag Berlin Heidelberg 2007.

UR - http://link.springer.com/10.1007/978-3-540-73451-2_19

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

U2 - 10.1007/978-3-540-73451-2_19

DO - 10.1007/978-3-540-73451-2_19

M3 - Conference contribution

SN - 9783540734505

SP - 175

EP - 180

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -

On covering attribute sets by reducts

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this