.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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).
Keyword:
Attribute reduction
Closure operator
Congruence relation
Consistent decision table
Dependence space
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容