.png){kind=icon}
.png){kind=icon}
Return
Approximation reduction in inconsistent incomplete decision tables
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2010.02.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article deals with approaches to attribute reductions in inconsistent incomplete decision table. The main objective of this study is to extend a kind of attribute reductions called a lower approximation reduct and an upper approximation reduct, which preserve the lower/upper approximation distribution of a target decision. Several judgement theorems of a lower/upper approximation consistent set in inconsistent incomplete decision table are educed. Then, the discernibility matrices associated with the two approximation reductions are examined as well, from which we can obtain approaches to attribute reduction of an incomplete decision table in rough set theory. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Rough set theory
Inconsistent incomplete decision table
Maximal consistent block
Discernibility function
Approximation reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.