.png){kind=icon}
Return
Knowledge granularity reduction for decision tables
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-020-01254-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Attribute reduction is a difficult topic in rough set theory and knowledge granularity reduction is one of the important types of reduction. However, up to now, its reduction algorithm based on a discernibility matrix has not been given. In this paper, we show that knowledge granularity reduction is equivalent to both positive region reduction and X-absolute reduction, and derive its corresponding algorithm based on a discernibility matrix to fill the gap. Particularly, knowledge granularity reduction is the usual positive region reduction for consistent decision tables. Finally, we provide a simple knowledge granularity reduction algorithm for finding a reduct with the help of binary integer programming, and consider six UCI datasets to illustrate our algorithms.
Keywords:
Attribute reduction
Binary integer programming
Decision table
Discernibility matrix
Knowledge granularity
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.7
Papers:
3.2K
Citations:
5.6K
Organization
No organization information available
Cited Papers
ShareSaveLate gadolinium enhancement on cardiac magnetic resonance combined with 123I- metaiodobenzylguanidine scintigraphy strongly predicts long-term clinical outcome in patients with dilated cardiomyopathy.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more