default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th ISIPTA 2021: Granada, Spain
- Andrés Cano, Jasper De Bock, Enrique Miranda, Serafín Moral:
International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2021, 6-9 July 2021, University of Granada, Granada, Spain. Proceedings of Machine Learning Research 147, PMLR 2021 - ISIPTA 2021: Preface. 1
- Antoine Ajenjo, Emmanuel Ardillon, Vincent Chabridon, Scott Cogan, Emeline Sadoulet-Reboul:
An Info-gap Framework for Comparing Epistemic Uncertainty Models in Hybrid Structural Reliability Analysis. 2-11 - Paolo Baldi, Hykel Hosni:
Logical Approximations of Qualitative Probability. 12-21 - Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum Indistinguishability through Exchangeable Desirable Gambles. 22-31 - Andrey G. Bronevich, Igor N. Rozenberg:
Generalized Hartley Measures on Credal Sets. 32-41 - Catrin Campbell-Moore:
Probability Filters as a Model of Belief; Comparisons to the Framework of Desirable Gambles. 42-50 - Yonatan Carlos Carranza Alarcón, Sébastien Destercke:
Distributionally Robust, Skeptical Binary Inferences in Multi-label Problems. 51-60 - Arianna Casanova
, Alessio Benavoli, Marco Zaffalon:
Nonlinear Desirability as a Linear Classification Problem. 61-71 - Leonardo Cella, Ryan Martin:
Valid Inferential Models for Prediction in Supervised Learning Problems. 72-82 - Esther Anna Corsi, Tommaso Flaminio, Hykel Hosni:
When Belief Functions and Lower Probabilities are Indistinguishable. 83-89 - Jasper De Bock, Natan T'Joens:
Average Behaviour of Imprecise Markov Chains: A Single Pointwise Ergodic Theorem for Six Different Models. 90-99 - Glauber De Bona, Victor Hugo Nascimento Rocha, Fábio Gagliardi Cozman:
Epistemic Argumentation with Conditional Probabilities and Labeling Constraints. 100-109 - Gert de Cooman, Jasper De Bock:
Randomness and Imprecision: A Discussion of Recent Results. 110-121 - Sébastien Destercke, Ignacio Montes, Enrique Miranda:
Processing Multiple Distortion Models: a Comparative Study. 122-131 - Serena Doria:
Credal sets of Coherent Conditional Probabilities Defined by Hausdorff Measures. 132-139 - Alexander Erreygers, Jasper De Bock:
Extending the Domain of Imprecise Jump Processes from Simple Variables to Measurable Ones. 140-149 - Marc Fischer, Alexis Vignes:
An Imprecise Bayesian Approach to Thermal Runaway Probability. 150-160 - Ruobin Gong, Joseph B. Kadane, Mark J. Schervish, Teddy Seidenfeld:
Total Evidence and Learning with Imprecise Probabilities. 161-168 - Ander Gray, Dominik Hose, Marco de Angelis, Michael Hanss, Scott Ferson:
Dependent Possibilistic Arithmetic using Copulas. 169-179 - Dominik Hose, Michael Hanss:
A Recursive Formulation of Possibilistic Filters. 180-190 - Jürg Kohlas, Arianna Casanova, Marco Zaffalon:
Information Algebras of Coherent Sets of Gambles in General Possibility Spaces. 191-200 - Dominik Kreiss, Georg Schollmeyer, Thomas Augustin:
Towards Improving Electoral Forecasting by Including Undecided Voters and Interval-valued Prior Knowledge. 201-209 - Ignacio Montes:
On the Comonotone Natural Extension of Marginal p-Boxes. 210-219 - Serafín Moral-García, Francisco Javier García Castellano, Carlos Javier Mantas, Joaquín Abellán:
Using Credal C4.5 for Calibrated Label Ranking in Multi-Label Classification. 220-228 - Serafín Moral-García, Joaquín Abellán:
Basic Probability Assignments Representable via Belief Intervals for Singletons in Dempster-Shafer Theory. 229-234 - Nawapon Nakharutai, Matthias C. M. Troffaes:
Improving Algorithms for Decision Making with the Hurwicz Criterion. 235-243 - Floris Persiau, Jasper De Bock, Gert de Cooman:
A Remarkable Equivalence between Non-Stationary Precise and Stationary Imprecise Uncertainty Models in Computable Randomness. 244-253 - Davide Petturiti, Barbara Vantaggi:
Betting Schemes for Assessing Coherent Numerical and Comparative Conditional Possibilities. 254-263 - Benjamin Quost:
Decision-making from Partial Instances by Active Feature Querying. 264-272 - Georg Schollmeyer:
Computing Simple Bounds for Regression Estimates for Linear Regression with Interval-valued Covariates. 273-279 - Patrick Michael Schwaferts, Thomas Augustin:
Imprecise Hypothesis-Based Bayesian Decision Making with Composite Hypotheses. 280-288 - Nicholas Syring, Ryan Martin:
Stochastic Optimization for Numerical Evaluation of Imprecise Probabilities. 289-298 - Alberto Termine, Alessandro Antonucci, Alessandro Facchini, Giuseppe Primiero:
Robust Model Checking with Imprecise Markov Reward Models. 299-309 - Natan T'Joens, Jasper De Bock:
Global Upper Expectations for Discrete-Time Stochastic Processes: In Practice, They Are All The Same! 310-319 - Arthur Van Camp, Kevin Blackwell, Jason Konek:
Independent Natural Extension for Choice Functions. 320-330 - Gregory R. Wheeler:
Discounting Desirable Gambles. 331-341 - Marco Zaffalon, Enrique Miranda:
The Sure Thing. 342-351 - Rafael Cabañas, Alessandro Antonucci:
CREPO: An Open Repository to Benchmark Credal Network Algorithms. 352-356 - Marco de Angelis, Roberto Rocchetta, Ander Gray, Scott Ferson:
Constructing Consonant Predictive Beliefs from Data with Scenario Theory. 357-360 - Love Ekenberg, Mats Danielson:
Probabilistic Risk Management in Project Portfolios. 361-364 - Rupert Freeman, David M. Pennock, Daniel M. Reeves, David M. Rothschild, Bo Waggoner:
Towards a Theory of Confidence in Market-Based Predictions. 365-368 - Haifei Zhang, Benjamin Quost, Marie-Hélène Masson:
Cautious Random Forests: a New Decision Strategy and some Experiments. 369-372
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-22 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
