Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Variable precision rough set model
Journal of Computer and System Sciences
Advances in the Dempster-Shafer theory of evidence
Theoretical foundations of order-based genetic algorithms
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Fast discovery of association rules
Advances in knowledge discovery and data mining
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Uncertainly measures of rough set prediction
Artificial Intelligence
Rough set methods and applications: new developments in knowledge discovery in information systems
Rough set methods and applications: new developments in knowledge discovery in information systems
Rough set algorithms in classification problem
Rough set methods and applications
Various approaches to reasoning with frequency based decision reducts: a survey
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
The Case against Accuracy Estimation for Comparing Induction Algorithms
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Application of Normalized Decision Measures to the New Case Classification
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Technologies for constructing intelligent systems
Handbook of data mining and knowledge discovery
Handbook of data mining and knowledge discovery
Order based genetic algorithms for the search of approximate entropy reducts
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis
Fundamenta Informaticae
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On Construction of Partial Reducts and Irreducible Partial Decision Rules
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Approaches to Conflict Dynamics Based on Rough Sets
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Short communication: Uncertainty measures for fuzzy relations and their applications
Applied Soft Computing
A weighted rough set based method developed for class imbalance learning
Information Sciences: an International Journal
A comparative study on rough set based class imbalance learning
Knowledge-Based Systems
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Optimization in Discovery of Compound Granules
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On Construction of Partial Reducts and Irreducible Partial Decision Rules
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Approaches to Conflict Dynamics Based on Rough Sets
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
A Comparison of Rough Set Methods and Representative Inductive Learning Algorithms
Fundamenta Informaticae - The 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Conputing (RSFDGrC 2003)
Unsupervised Similarity Learning from Textual Data
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
An Improved Axiomatic Definition of Information Granulation
Fundamenta Informaticae
Alternative rule induction methods based on incremental object using rough set theory
Applied Soft Computing
Attribute reduction for dynamic data sets
Applied Soft Computing
Attribute reduction: A dimension incremental strategy
Knowledge-Based Systems
An Evaluation Method of Relative Reducts Based on Roughness of Partitions
International Journal of Cognitive Informatics and Natural Intelligence
The problem of finding the sparsest bayesian network for an input data set is NP-Hard
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
An accelerator for attribute reduction based on perspective of objects and attributes
Knowledge-Based Systems
Quick attribute reduction in inconsistent decision tables
Information Sciences: an International Journal
Feature selection with test cost constraint
International Journal of Approximate Reasoning
Set-based granular computing: A lattice model
International Journal of Approximate Reasoning
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Hi-index | 0.00 |
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.