.png){kind=icon}
Return
Dependence-space-based attribute reduction in consistent decision tables
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-010-0656-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a novel approach to attribute reduction in consistent decision tables within the framework of dependence spaces. For a consistent decision table (U,A boolean OR {D}) an equivalence relation r on the conditional attribute set A and a congruence relation R on the power set of A are constructed, respectively. Two closure operators, T-r and T-R, and two families of closed sets, C-r and C-R; are then constructed with respect to the two equivalence relations. After discussing the properties of C-r and C-R; the necessary and sufficient condition for C-r = C-R is obtained and employed to formulate an approach to attribute reduction in consistent decision tables. It is also proved, under the condition C-r = C-R; that a relative reduct is equivalent to a R-reduction defined by Novotny and Pawlak (Fundam Inform 16: 275-287, 1992).
Keywords:
Attribute reduction
Closure operator
Congruence relation
Consistent decision table
Dependence space
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more