Dynamic Attribute Reduction Algorithms in Set-valued Decision Systems by Rough Set
Keywords:
Tolerance relations, rough sets, set-valued decision system, generalized discernibility matrix, attribute reduction, decision table.Abstract
Attribute reduction is an important research concept in rough set theory. However, most of attribute reduction methods are performed on single-valued decision system decision table. In this paper, the author’s methods for attribute reduction in static set-valued decision systems and dynamic set-valued decision systems with dynamically increasing and decreasing conditional attributes. The methods use generalized discernibility matrix and function in tolerance-based rough sets.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
