Results 1 to 10 of about 1,627 (119)
Credal Networks under Epistemic Irrelevance [PDF]
International Journal of Approximate Reasoning, 2017 A credal network under epistemic irrelevance is a generalised type of Bayesian network that relaxes its two main building blocks. On the one hand, the local probabilities are allowed to be partially specified.
De Bock, Jasper
core +5 more sources
Reintroducing credal networks under epistemic irrelevance [PDF]
, 2016 A credal network under epistemic irrelevance is a generalised version of a Bayesian network that loosens its two main building blocks. On the one hand, the local probabilities do not have to be specified exactly.
De Bock, Jasper
core +3 more sources
Reliable Uncertain Evidence Modeling in Bayesian Networks by Credal Networks
, 2018 A reliable modeling of uncertain evidence in Bayesian networks based on a set-valued quantification is proposed. Both soft and virtual evidences are considered.
Antonucci, Alessandro, Marchetti, Sabina
core +3 more sources
, 2021 This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. Given imprecise information represented by probability bounds and conditional probability bounds of logic formulas, this logic specifies a set of probability distributions over all interpretations.
Qian, Haifeng +7 more
openaire +2 more sources
Introduction : pour une mise en questions de l’appellation « réseau »
Cahiers des Amériques Latines, 2006 As an introduction for the file offered by the interdisciplinary team dedicated to the study of social networks in CREDAL, the paper sets their collective work in front of shared interrogations about the increasing action-in-network presence in Latin ...
Marielle Pepin Lehalleur
doaj +1 more source
Approximating Credal Network Inferences by Linear Programming [PDF]
, 2013 An algorithm for approximate credal network updating is presented. The problem in its general formulation is a multilinear optimization task, which can be linearized by an appropriate rule for fixing all the local models apart from those of a single variable. This simple idea can be iterated and quickly leads to very accurate inferences.
Antonucci, Alessandro +3 more
openaire +5 more sources
Evidential Communities for Complex Networks [PDF]
, 2014 Community detection is of great importance for understand-ing graph structure in social networks. The communities in real-world networks are often overlapped, i.e. some nodes may be a member of multiple clusters.
G. Palla +9 more
core +4 more sources
Median evidential c-means algorithm and its application to community detection [PDF]
, 2015 Median clustering is of great value for partitioning relational data. In this paper, a new prototype-based clustering method, called Median Evidential C-Means (MECM), which is an extension of median c-means and median fuzzy c-means on the theoretical ...
Liu, Zhun-Ga +3 more
core +4 more sources
Updating credal networks is approximable in polynomial time [PDF]
International Journal of Approximate Reasoning, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mauá, D. D. +2 more
openaire +2 more sources
Adaptive imputation of missing values for incomplete pattern classification [PDF]
, 2016 In classification of incomplete pattern, the missing values can either play a crucial role in the class determination, or have only little influence (or eventually none) on the classification results according to the context.
Dezert, Jean +3 more
core +4 more sources