On covering attribute sets by reducts

Mikhail Moshkov; Andrzej Skowron; Zbigniew Suraj

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

Back

Conference proceeding

Peer reviewed

On covering attribute sets by reducts

Mikhail Moshkov, Andrzej Skowron and Zbigniew Suraj

ROUGH SETS AND INTELLIGENT SYSTEMS PARADIGMS, PROCEEDINGS, Vol.4585, pp.175-180

Lecture Notes in Artificial Intelligence

01/01/2007

DOI: https://doi.org/10.1007/978-3-540-73451-2_19

Abstract

Computer Science

Computer Science, Artificial Intelligence

Science & Technology

Technology

For any fixed natural , 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.

Metrics

1 Record Views

Details

Title: On covering attribute sets by reducts
Creators - without role: Mikhail Moshkov - University of Silesia
Andrzej Skowron - Institute of Mathematics
Zbigniew Suraj - Rzeszów University
Contributors - without role: M Kryszkiewicz
J Peters
H Rybinski
A Skowron - Institute of Mathematics
Publication Details: ROUGH SETS AND INTELLIGENT SYSTEMS PARADIGMS, PROCEEDINGS, Vol.4585, pp.175-180
Series: Lecture Notes in Artificial Intelligence
Publisher: Springer Nature
Number of pages: 2
Identifiers: 9944796508331
Academic Unit: King Abdullah University of Science & Technology
Language: English
Resource Type: Conference proceeding