.png){kind=icon}
Return
Discernibility matrix based incremental attribute reduction for dynamic data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2017.10.033.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic data, in which the values of objects vary over time, are ubiquitous in real applications. Although researchers have developed a few incremental attribute reduction algorithms to process dynamic data, the reducts obtained by these algorithms are usually not optimal. To overcome this deficiency, in this paper, we propose a discernibility matrix based incremental attribute reduction algorithm, through which all reducts, including the optimal reduct, of dynamic data can be incrementally acquired. Moreover, to enhance the efficiency of the discernibility matrix based incremental attribute reduction algorithm, another incremental attribute reduction algorithm is developed based on the discernibility matrix of a compact decision table. Theoretical analyses and experimental results indicate that the latter algorithm requires much less time to find reducts than the former, and that the same reducts can be output by both. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Attribute reduction
Discernibility matrix
Incremental algorithm
Dynamic data
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveShareSaveShareSaveLate 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
OAAIShareSaveShareSave
View more