Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1864309#aggregation> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- aggregation classification "C1".
- aggregation creator person.
- aggregation date "2011".
- aggregation format "application/pdf".
- aggregation hasFormat 1864309.bibtex.
- aggregation hasFormat 1864309.csv.
- aggregation hasFormat 1864309.dc.
- aggregation hasFormat 1864309.didl.
- aggregation hasFormat 1864309.doc.
- aggregation hasFormat 1864309.json.
- aggregation hasFormat 1864309.mets.
- aggregation hasFormat 1864309.mods.
- aggregation hasFormat 1864309.rdf.
- aggregation hasFormat 1864309.ris.
- aggregation hasFormat 1864309.txt.
- aggregation hasFormat 1864309.xls.
- aggregation hasFormat 1864309.yaml.
- aggregation isPartOf urn:isbn:9783642228322.
- aggregation isPartOf urn:isbn:9783642228339.
- aggregation isPartOf urn:issn:1867-5662.
- aggregation language "eng".
- aggregation publisher "Springer".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Mathematics and Statistics".
- aggregation title "Completely monotone outer approximations of lower probabilities on finite possibility spaces".
- aggregation abstract "Drawing inferences from general lower probabilities on finite possibility spaces usually involves solving linear programming problems. For some applications this may be too computationally demanding. Some special classes of lower probabilities allow for using computationally less demanding techniques. One such class is formed by the completely monotone lower probabilities, for which inferences can be drawn efficiently once their Möbius transform has been calculated. One option is therefore to draw approximate inferences by using a completely monotone approximation to a general lower probability; this must be an outer approximation to avoid drawing inferences that are not implied by the approximated lower probability. In this paper, we discuss existing and new algorithms for performing this approximation, discuss their relative strengths and weaknesses, and illustrate how each one works and performs.".
- aggregation authorList BK279308.
- aggregation endPage "178".
- aggregation startPage "169".
- aggregation volume "100".
- aggregation aggregates 1864311.
- aggregation aggregates 1908331.
- aggregation isDescribedBy 1864309.
- aggregation similarTo 978-3-642-22833-9_20.
- aggregation similarTo LU-1864309.