2010•Unpublished venueRequires access

The Algorithm for the Reduction of Decision Table Based on Rough Entropy

Song Lan

Abstract

The attribute reduction is a core theory of the rough set theory. It has been proven that computing the optimal reduction of decision table is a NP-hard problem. In the paper here, the application of rough entropy in rough sets theory is analyzed, the uncertainty measure of the importance of attribute in decision table is proposed, then, a heuristic algorithm based on rough entropy for reduction of knowledge is proposed.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Rough set, Decision table, Dominance-based rough set approach, Entropy (arrow of time), Reduction (mathematics), Computer science, Algorithm, Mathematics