scholarly journals The M-DUCG Methodology to Calculate the Joint Probability Distribution of Directed Cycle Graph With Local Data and Domain Causal Knowledge

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 36087-36099
Author(s):  
Kun Qiu ◽  
Qin Zhang
F1000Research ◽  
2021 ◽  
Vol 10 ◽  
pp. 1243
Author(s):  
Yit Yin Wee ◽  
Shing Chiang Tan ◽  
KuokKwee Wee

Background: Bayesian Belief Network (BBN) is a well-established causal framework that is widely adopted in various domains and has a proven track record of success in research and application areas. However, BBN has weaknesses in causal knowledge elicitation and representation. The representation of the joint probability distribution in the Conditional Probability Table (CPT) has increased the complexity and difficulty for the user either in comprehending the causal knowledge or using it as a front-end modelling tool.   Methods: This study aims to propose a simplified version of the BBN ─ Bayesian causal model, which can represent the BBN intuitively and proposes an inference method based on the simplified version of BBN. The CPT in the BBN is replaced with the causal weight in the range of[-1,+1] to indicate the causal influence between the nodes. In addition, an inferential algorithm is proposed to compute and propagate the influence in the causal model.  Results: A case study is used to validate the proposed inferential algorithm. The results show that a Bayesian causal model is able to predict and diagnose the increment and decrement as in BBN.   Conclusions: The Bayesian causal model that serves as a simplified version of BBN has shown its advantages in modelling and representation, especially from the knowledge engineering perspective.


2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Huilin Huang

We consider an inhomogeneous growing network with two types of vertices. The degree sequences of two different types of vertices are investigated, respectively. We not only prove that the asymptotical degree distribution of typesfor this process is power law with exponent2+1+δqs+β1-qs/αqs, but also give the strong law of large numbers for degree sequences of two different types of vertices by using a different method instead of Azuma’s inequality. Then we determine asymptotically the joint probability distribution of degree for pairs of adjacent vertices with the same type and with different types, respectively.


Author(s):  
Reza Seifi Majdar ◽  
Hassan Ghassemian

Unlabeled samples and transformation matrix are two main parts of unsupervised and semi-supervised feature extraction (FE) algorithms. In this manuscript, a semi-supervised FE method, locality preserving projection in the probabilistic framework (LPPPF), to find a sufficient number of reliable and unmixed unlabeled samples from all classes and constructing an optimal projection matrix is proposed. The LPPPF has two main steps. In the first step, a number of reliable unlabeled samples are selected based on the training samples, spectral features, and spatial information in the probabilistic framework. In this way, the spectral and spatial probability distribution function is calculated for each unlabeled sample. Therefore, the spectral features and spatial information are integrated together with a joint probability distribution function. Finally, a sufficient number of unlabeled samples with the highest joint probability distribution are selected. In the second step, the selected unlabeled samples are applied to construct the transformation matrix based on the spectral and spatial information of the unlabeled samples. The adjacency graph is improved by using new weights based on spectral and spatial information. This method is evaluated on three data sets: Indian Pines, Pavia University, and Kennedy Space Center (KSC) and compared with some recent and well-known supervised, semi-supervised, and unsupervised FE methods. Various experiments demonstrate the efficiency of the LPPPF in comparison with the other FE methods. LPPPF has also considerable performance with limited training samples.


Sign in / Sign up

Export Citation Format

Share Document