Journal
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
Volume 8, Issue 4, Pages 1131-1144Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s13042-015-0484-9
Keywords
Boolean matrix; Characteristic matrix; Dynamic covering approximation space; Dynamic Covering decision information system; Rough set
Categories
Funding
- National Natural Science Foundation of China [11201490, 11371130, 11401052, 11401195, 11201137, 11526039]
- Postdoctoral Science Foundation of China [2015M580353]
- Scientific Research Fund of Hunan Provincial Education Department [14C0049]
- Planned Science and Technology Project of Hunan Province [2015JC3055]
- China Scholarship Council (CSC)
Ask authors/readers for more resources
In practical situations, it is time-consuming to conduct knowledge reduction of dynamic covering decision information systems caused by variations of attribute values with the non-incremental approaches. In this paper, motivated by the need for knowledge reduction of dynamic covering decision information systems, we introduce incremental approaches to computing the type-1 and type-2 characteristic matrices for constructing the second and sixth lower and upper approximations of sets in dynamic covering approximation spaces caused by revising attribute attributes. We also employ several examples to explain how to compute the second and sixth lower and upper approximations of sets in dynamic covering approximation spaces. Then we propose the incremental algorithms for computing the second and sixth lower and upper approximations of sets and employ experimental results to illustrate the incremental algorithms are effective to calculate the second and sixth lower and upper approximations of sets in dynamic covering approximation spaces. Finally, we give two examples to show how to conduct knowledge reduction of dynamic covering decision information systems caused by altering attribute values.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available