Optimization of Inhibitory Decision Rules Relative to Length and Coverage
نویسندگان
چکیده
The paper is devoted to the study of an algorithm for optimization of inhibitory rules relative to the length. Such rules on the right-hand side have a relation "attribute value". The considered algorithm is based on an extension of dynamic programming. After the procedure of optimization relative to length, we obtain a graph (T) which describes all nonredundant inhibitory rules with minimum length.
منابع مشابه
Sequential Optimization of γ-Decision Rules
The paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to length, coverage and number of misclassifications. Presented algorithm constructs a directed acyclic graph ∆γ(T ) which nodes are subtables of the decision table T . Based on the graph ∆γ(T ) we can describe all irredundant γ-decision r...
متن کاملDynamic programming approach to optimization of approximate decision rules
This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number b, we consider b-decision rules that local...
متن کاملApplication of Dynamic Programming Approach to Optimization of Association Rules Relative to Coverage and Length
In the paper, an application of dynamic programming approach to optimization of approximate association rules relative to the coverage and length is presented. It is based on the extension of dynamic programming approach for optimization of decision rules [1] to the case of inconsistent decision tables. Applications of rough sets theory to the construction of rules for knowledge representation ...
متن کاملFuzzy Apriori Rule Extraction Using Multi-Objective Particle Swarm Optimization: The Case of Credit Scoring
There are many methods introduced to solve the credit scoring problem such as support vector machines, neural networks and rule based classifiers. Rule bases are more favourite in credit decision making because of their ability to explicitly distinguish between good and bad applicants.In this paper multi-objective particle swarm is applied to optimize fuzzy apriori rule base in credit scoring. ...
متن کاملFuzzy Apriori Rule Extraction Using Multi-Objective Particle Swarm Optimization: The Case of Credit Scoring
There are many methods introduced to solve the credit scoring problem such as support vector machines, neural networks and rule based classifiers. Rule bases are more favourite in credit decision making because of their ability to explicitly distinguish between good and bad applicants.In this paper multi-objective particle swarm is applied to optimize fuzzy apriori rule base in credit scoring. ...
متن کامل