Title
Discernibility matrix based incremental feature selection on fused decision tables.
Abstract
In rough set philosophy, each set of data can be seen as a fuzzy decision table. Since a decision table dynamically increases with time and space, these decision tables are integrated into a new one called fused decision table. In this paper, we focus on designing an incremental feature selection method on fused decision table by optimizing the space constraint of storing discernibility matrix. Here discernibility matrix is a known way of discernibility information measure in rough set theory. This paper applies the quasi/pseudo value of discernibility matrix rather than the true value of discernibility matrix to design an incremental mechanism. Unlike those discernibility matrix based non-incremental algorithms, the improved algorithm needs not save the whole discernibility matrix in main memory, which is desirable for the large data sets. More importantly, with the increment of decision tables, the discernibility matrix-based feature selection algorithm could constrain the computational cost by applying efficient information updating techniques—quasi/pseudo approximation operators. Finally, our experiments reveal that the proposed algorithm needs less computational cost, especially less occupied space, on the condition that the accuracy is limitedly lost.
Year
DOI
Venue
2020
10.1016/j.ijar.2019.11.010
International Journal of Approximate Reasoning
Keywords
Field
DocType
Incremental learning,Feature selection,Fuzzy rough sets,Discernibility matrix,Fused decision table
Data set,Decision table,Feature selection,Matrix (mathematics),Spacetime,Algorithm,Rough set,Artificial intelligence,Information measure,Fuzzy decision,Machine learning,Mathematics
Journal
Volume
Issue
ISSN
118
1
0888-613X
Citations 
PageRank 
References 
4
0.64
0
Authors
8
Name
Order
Citations
PageRank
Ye Liu1248.32
Lidi Zheng240.64
Yeliang Xiu340.64
Hong Yin440.64
Suyun Zhao5223.17
Xizhao Wang63593166.16
Hong Chen735938.55
Cuiping Li8399.19