In this paper, we present three approaches for construction of decision rules for decision tables with many-valued decisions. We construct decision rules directly for rows of decision …
M Azad, M Moshkov - Procedia Computer Science, 2014 - Elsevier
The paper is devoted to the analysis of greedy algorithms for the minimization of average depth of decision trees for decision tables such that each row is labeled with a set of …
M Azad, M Moshkov - 2014 IEEE International Conference on …, 2014 - ieeexplore.ieee.org
In this paper, we consider multi-label decision tables that have a set of decisions attached to each row. Our goal is to find one decision from the set of decisions for each row by using …
M Azad, M Moshkov - 2015 Federated Conference on …, 2015 - ieeexplore.ieee.org
Decision tree is a widely used technique to discover patterns from consistent data set. But if the data set is inconsistent, where there are groups of examples (objects) with equal values …
M Azad, M Moshkov - 2014 Federated Conference on …, 2014 - ieeexplore.ieee.org
We used decision tree as a model to discover the knowledge from multi-label decision tables where each row has a set of decisions attached to it and our goal is to find out one …
A Sabitov, R Minnikhanov, M Dagaeva… - Cyber-Physical Systems …, 2021 - Springer
In this chapter text mining approach for emergency calls management systems is investigated. A data mining approach of emergency calls classification based on the …
In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a …