Results 51 to 60 of about 3,608,849 (131)
International audienceThis paper introduces Choice Trees (CTrees), a monad for modeling nondeterministic, recursive, and impure programs in Rocq. Inspired by Xia et al.'s ITrees, this novel data structure embeds computations into coinductive trees with ...
He, Paul +5 more
core +6 more sources
DECISION TREES – A PERSPECTIVE OF ELECTRONIC DECISIONAL SUPPORT [PDF]
Without substitute decision-maker, decision support system, through their components,can facilitate the work of decision-maker by providing useful clues to solving problems andidentifying opportunities.
Janetta Sirbu +2 more
core
A mass assignment based ID3 algorithm for decision tree induction [PDF]
, 1997 A mass assignment based ID3 algorithm for learning probabilistic fuzzy decision trees is introduced. Fuzzy partitions are used to discretize continuous feature universes and to reduce complexity when universes are discrete but with large cardinalities ...
Baldwin, JF, Martin, TP, Lawry, J
core +1 more source
Decision making with decision event graphs [PDF]
, 2010 We introduce a new modelling representation, the Decision Event Graph (DEG), for asymmetric multistage decision problems. The DEG explicitly encodes conditional independences and has additional significant advantages over other representations of ...
Thwaites, Peter +2 more
core
On Complexity of Decision Trees for Decision Tables from Closed Classes
In this thesis, we consider classes of decision tables closed under operations of removal of attributes (columns) and changing of decisions and sometimes some other operations and study for the tables from these classes relationships among the minimum ...
Ostonov, Azimkhon
core +1 more source
Deterministic and nondeterministic decision rules in classification process [PDF]
, 2010 In this paper an algorithm of calculating nondeterministic decision rules from the decision table was presented. The algorithm uses additional conditions imposed on rules. This is a greedy algorithm.
Paszek, P., Marszał-Paszek, B.
core
Non-Malleable Code in the Split-State Model. [PDF]
Entropy (Basel), 2022 Aggarwal D, Ball M, Obremski M.
europepmc +1 more source
Relations between Decision Trees and Decision Rule Systems
The study of relationships between systems of decision rules and deterministic decision trees is an important task of computer science. It is easy to transform a decision tree into a decision rule system.
Durdymyradov, Kerven
core +1 more source
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
, 2005 We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language.
Walukiewicz, Igor, Niwinski, Damian
core +1 more source
Cost-Sensitive Decision Trees with Completion Time Requirements [PDF]
In many classification tasks, managing costs and completion times are the main concerns. In this paper, we assume that the completion time for classifying an instance is determined by its class label, and that a late penalty cost is incurred if the ...
Hung-Pin KAO, Kwei TANG, Jen TANG
core