Comparison of heuristics for optimization of association rules
F Alsolami, T Amin, M Moshkov… - Fundamenta …, 2019 - content.iospress.com
In this paper, seven greedy heuristics for construction of association rules are compared
from the point of view of the length and coverage of constructed rules. The obtained rules …
from the point of view of the length and coverage of constructed rules. The obtained rules …
Optimization and analysis of decision trees and rules: dynamic programming approach
This paper is devoted to the consideration of software system Dagger created in KAUST.
This system is based on extensions of dynamic programming. It allows sequential …
This system is based on extensions of dynamic programming. It allows sequential …
Relationships between length and coverage of decision rules
Relationships Between Length and Coverage of Decision Rules 1. Introduction Page 1
Fundamenta Informaticae 129 (2014) 1–13 1 DOI 10.3233/FI-2014-956 IOS Press …
Fundamenta Informaticae 129 (2014) 1–13 1 DOI 10.3233/FI-2014-956 IOS Press …
Optimization of approximate decision rules relative to coverage
B Zielosko - Beyond Databases, Architectures, and Structures: 10th …, 2014 - Springer
We present a modification of the dynamic programming algorithm. The aims of the paper
are:(i) study of the coverage of decision rules, and (ii) study of the size of a directed acyclic …
are:(i) study of the coverage of decision rules, and (ii) study of the size of a directed acyclic …
Weighting attributes based on the greedy algorithm properties
Estimation of importance for considered features is an important issue for any knowledge
exploration process and it can be executed by a variety of approaches. In the research …
exploration process and it can be executed by a variety of approaches. In the research …
Decision Rules Induced From Sets of Decision Trees
Decision rules belong to known forms of knowledge representation. Among popular
measures of their quality length and support can be distinguished. Shorter rules are easier …
measures of their quality length and support can be distinguished. Shorter rules are easier …
Optimization of decision rules based on dynamic programming approach
This chapter is devoted to the study of an extension of dynamic programming approach
which allows optimization of approximate decision rules relative to the length and coverage …
which allows optimization of approximate decision rules relative to the length and coverage …
Multi-heuristic Induction of Decision Rules
The main objectives of data mining tasks involve extracting knowledge from data, which can
be presented in the form of distributed local sources or centralized one. Inducing decision …
be presented in the form of distributed local sources or centralized one. Inducing decision …
Enriched Discretisation: Information Fusion from Supervised and Unsupervised Processing
U Stańczyk, B Zielosko, G Baron - Advances in Information Systems …, 2024 - Springer
When data is incomplete and inconsistent, an approximation of concepts can be obtained by
applying the rough set theory. The classical approach allows to recognise only nominal …
applying the rough set theory. The classical approach allows to recognise only nominal …
Sequential optimization of γ-decision rules
B Zielosko - 2012 Federated Conference on Computer Science …, 2012 - ieeexplore.ieee.org
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 …
allows sequential optimization of approximate decision rules relative to length, coverage …