Variable precision rough set model
Journal of Computer and System Sciences
Advances in the Dempster-Shafer theory of evidence
Uncertainly measures of rough set prediction
Artificial Intelligence
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
Boolean Reasoning for Decision Rules Generation
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Approximate Reducts and Association Rules - Correspondence and Complexity Results
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Classification Models Based on Approximate Bayesian Networks
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
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
Fundamenta Informaticae
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
Attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
Universal Attribute Reduction Problem
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Dependence-space-based attribute reductions in inconsistent decision information systems
International Journal of Approximate Reasoning
A Note on Attribute Reduction in the Decision-Theoretic Rough Set Model
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Universal Problem of Attribute Reduction
Transactions on Rough Sets IX
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
On Construction of Partial Association Rules
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
Information Sciences: an International Journal
On partial covers, reducts and decision rules with weights
Transactions on rough sets VI
Stability analysis on rough set based feature evaluation
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
A heuristic algorithm based on attribute importance for feature selection
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
On partial covers, reducts and decision rules
Transactions on rough sets VIII
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
International Journal of Approximate Reasoning
A note on attribute reduction in the decision-theoretic rough set model
Transactions on rough sets XIII
Lower bounds on minimal weight of partial reducts and partial decision rules
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
On partial tests and partial reducts for decision tables
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Reduced attribute oriented inconsistency handling in decision generation
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
| Hi-index | 0.00 |
We consider the family of normalized decision functions acting over conditional frequency distributions computed from data tables. We draw the connection between such functions and approaches to generating inexact decision rules for the new case classification. We also introduce the family of normalized decision measures corresponding to particular decision functions. They enable us to express efficiency of particular strategies of reasoning with respect to a given data. We show the properties of approximate decision rules and decision reducts based on normalized decision functions and measures. As a result, we obtain an intuitive and flexible tool for extracting approximate classification models from data.