Journal
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
Volume 5, Issue 5, Pages 775-788Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s13042-013-0225-x
Keywords
Rough sets; Attribute reduction; Homomorphism; Set-valued information system; Dynamic set-valued information system
Categories
Funding
- National Natural Science Foundation of China [11071061, 11371130]
- National Basic Research Program of China [2010CB334706, 2011CB311808]
Ask authors/readers for more resources
Set-valued information systems are important generalizations of single-valued information systems. In this paper, three relations are proposed for attribute reduction of set-valued information systems. Then, we convert a large-scale set-valued information system into a smaller relation information system. An incremental algorithm is designed to compress dynamic set-valued information systems. Concretely, we mainly address the compression updating from three aspects: variations of attribute set, immigration and emigration of objects and alterations of attribute values. Finally, several illustrative examples are employed to demonstrate that attribute reduction of dynamic set-valued information systems are simplified significantly by our proposed approaches.
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