Results 11 to 20 of about 86,722 (264)

Time and space complexity of deterministic and nondeterministic decision trees

open access: yesAnnals of Mathematics and Artificial Intelligence, 2022
AbstractIn this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a problem over information system, which is described by a finite number of attributes and a mapping ...
Mikhail Moshkov
openaire   +4 more sources

End-to-End Learning of Deterministic Decision Trees [PDF]

open access: yes, 2019
Conventional decision trees have a number of favorable properties, including interpretability, a small computational footprint and the ability to learn from little training data. However, they lack a key quality that has helped fuel the deep learning revolution: that of being end-to-end trainable, and to learn from scratch those features that best ...
Hehn, Thomas, Hamprecht, Fred A.
openaire   +2 more sources

Development and validation of predictive models for unplanned hospitalization in the Basque Country: analyzing the variability of non-deterministic algorithms

open access: yesBMC Medical Informatics and Decision Making, 2023
Background The progressive ageing in developed countries entails an increase in multimorbidity. Population-wide predictive models for adverse health outcomes are crucial to address these growing healthcare needs.
Alexander Olza   +2 more
doaj   +1 more source

Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes

open access: yes, 2023
In this paper, we consider classes of decision tables with 0-1-decisions closed relative to removal of attributes (columns) and changing decisions assigned to rows. For tables from an arbitrary closed class, we study the dependence of the minimum complexity of deterministic decision trees on various parameters of the tables: the minimum complexity of a
Ostonov, Azimkhon, Moshkov, Mikhail
openaire   +2 more sources

Low-visibility forecasts for different flight planning horizons using tree-based boosting models [PDF]

open access: yesAdvances in Statistical Climatology, Meteorology and Oceanography, 2019
Low-visibility conditions enforce special procedures that reduce the operational flight capacity at airports. Accurate and probabilistic forecasts of these capacity-reducing low-visibility procedure (lvp) states help the air traffic management in ...
S. J. Dietz   +3 more
doaj   +1 more source

Scientific Opinion on the development of a risk ranking toolbox for the EFSA BIOHAZ Panel [PDF]

open access: yesEFSA Journal, 2015
Eight tools relevant to risk ranking of biological hazards in food were identified and assessed using two case studies. Differences in their performance were observed, related to the risk metrics, data requirements, ranking approach, model type, model ...
EFSA Panel on Biological Hazards (BIOHAZ)
doaj   +1 more source

On the Computational Power of Radio Channels [PDF]

open access: yes, 2019
Radio networks can be a challenging platform for which to develop distributed algorithms, because the network nodes must contend for a shared channel. In some cases, though, the shared medium is an advantage rather than a disadvantage: for example, many ...
Braverman, Mark   +3 more
core   +1 more source

Detection of deterministic and probabilistic convection initiation using Himawari-8 Advanced Himawari Imager data [PDF]

open access: yesAtmospheric Measurement Techniques, 2017
The detection of convective initiation (CI) is very important because convective clouds bring heavy rainfall and thunderstorms that typically cause severe socio-economic damage.
S. Lee   +4 more
doaj   +1 more source

Towards Better Separation between Deterministic and Randomized Query Complexity [PDF]

open access: yes, 2015
We show that there exists a Boolean function $F$ which observes the following separations among deterministic query complexity $(D(F))$, randomized zero error query complexity $(R_0(F))$ and randomized one-sided error query complexity $(R_1(F))$: $R_1(F)
Mukhopadhyay, Sagnik, Sanyal, Swagato
core   +2 more sources

Universal Communication, Universal Graphs, and Graph Labeling [PDF]

open access: yes, 2019
We introduce a communication model called universal SMP, in which Alice and Bob receive a function f belonging to a family ?, and inputs x and y. Alice and Bob use shared randomness to send a message to a third party who cannot see f, x, y, or the shared
Harms, Nathaniel
core   +2 more sources

Home - About - Disclaimer - Privacy