About: On the Elicitation of an Optimal Outer Approximation of a Coherent Lower Probability

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On the Elicitation of an Optimal Outer Approximation of a Coherent Lower Probability Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : wasabi.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	On the Elicitation of an Optimal Outer Approximation of a Coherent Lower Probability
Creator	Miranda, Enrique Montes, Ignacio Vicig, Paolo
Source	PMC
abstract	The process of outer approximating a coherent lower probability by a more tractable model with additional properties, such as 2- or completely monotone capacities, may not have a unique solution. In this paper, we investigate whether a number of approaches may help in eliciting a unique outer approximation: minimising a number of distances with respect to the initial model, or maximising the specificity of the outer approximation. We apply these to 2- and completely monotone approximating lower probabilities, and also to possibility measures.
has issue date	2020-05-15(xsd:dateTime)
bibo:doi	10.1007/978-3-030-50143-3_6
has license	no-cc
sha1sum (hex)	f3f1cb739d765420958fee18029c995bf766c34d
schema:url	https://doi.org/10.1007/978-3-030-50143-3_6
resource representing a document's title	On the Elicitation of an Optimal Outer Approximation of a Coherent Lower Probability
has PubMed Central identifier	PMC7274745
schema:publication	Information Processing and Management of Uncertainty in Knowledge-Based Systems
resource representing a document's body	covid:f3f1cb739d765420958fee18029c995bf766c34d#body_text
is schema:about of	named entity 'LOWER' named entity 'MODEL' named entity 'PROPERTIES' named entity 'SOLUTION' named entity 'ADDITIONAL' named entity 'unique solution' named entity 'completely monotone' named entity 'probability measures' named entity 'vectors' named entity 'probability boxes' named entity 'vectors' named entity 'monotone function' named entity 'Möbius inverse' named entity 'probability theory' named entity 'lower probability' named entity 'vector' named entity 'monotonicity' named entity 'lower probability' named entity 'd 3' named entity 'belief functions' named entity 'lower probability' named entity 'permutation' named entity 'vector' named entity 'upper probability' named entity 'permutation' named entity 'shortest path problem' named entity 'upper probability' named entity 'shortest path' named entity 'shortest path' named entity 'lower probability' named entity 'convex' named entity 'lower probability' named entity 'OAs' named entity 'lower probability' named entity 'upper probability' named entity 'optimal solution' named entity 'linear programming problem' named entity 'credal set' named entity 'completely monotone' named entity 'credal set' named entity 'upper probability' named entity 'Möbius inverse' named entity 'lower probability' named entity 'Lemma 1' named entity 'lower probability' named entity 'permutation' named entity 'completely monotone' named entity 'finite number' named entity 'lower bound' named entity 'Lemma 1' named entity 'monotonicity' named entity 'Completely monotone' named entity 'OAs' named entity 'Proposition 2' named entity 'loss of generality' named entity 'credal' named entity 'lower probability' named entity 'imprecise probability' named entity 'permutation' named entity 'credal set' named entity 'permutation' named entity 'completely monotone' named entity 'd 3' named entity 'totally ordered' named entity 'lower probability' named entity 'lower probability' named entity 'completely monotone' named entity 'upper bound' named entity 'lower probability' named entity 'Dijkstra's algorithm' named entity 'lower probability' named entity 'shortest path problem' named entity 'Proposition 2' named entity 'Dijkstra's algorithm' named entity 'permutation' named entity 'extreme points' named entity 'Hasse diagram' named entity 'permutation' named entity 'imprecise probabilities' named entity 'shortest path' named entity 'upper probability'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software