Generalized discernibility function based attribute reduction in set-valued decision systems
Thi Thu Hien Phung
Abstract
Thi Thu Hien Phung
Abstract
Rough set approach for attribute reduction is an important research subject in data mining and machine learning. However, most of attribute reduction methods are performed on single-valued decision system decision table. In this paper, we propose 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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Rough set approach for attribute reduction is an important research subject in data mining and machine learning. However, most of attribute reduction methods are performed on single-valued decision system decision table. In this paper, we propose 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.
Key concepts: Rough set, Decision table, Reduction (mathematics), Dominance-based rough set approach, Decision system, Computer science, Attribute domain, Data mining