Answers are grounded in this paper and cite their sources.
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplification (reduction of attributes) in the decision model, which approximately preserves its conditional entropy (the measure of inconsistency of defining decision by conditional attributes) should be performed to decrease its prior entropy (the measure of the model's complexity). We show NP-hardness of optimization tasks concerning application of various modifications of AERP to data analysis.
No takes yet. Share an insight, caveat, or question.
Dominik Ślȩzak (2002) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: