Search
New Code
Social Media Script 1.0
ByteScout PDF Renderer SDK 9.0.0.3079
Magento Mobile App Builder 2.0.0
Binary MLM Plan 1.0.2
Review Assistant 4.0
SSIS Data Flow Components 1.8
Maulik Shah 1.0
GetOrgChart 2.4.91
ODBC Driver for SQL Azure 2.4
EntityDAC 2.0
CarMax Clone Script 1.0
Mega Menu Magento 2 2.0
Luxand FaceSDK 6.5.1
Data Puppy Lite (64-bit) 1.0
Bytescout BarCode Reader SDK 10.1.0.1778
Top Code
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Code Listing by Guangdi Li

Code 1-6 of 6   






As a famous sub-structure of Bayesian network, causal polytree is able to recover the causality very efficiently.

Here, I implement pearl's classical algorithm here for easy using. Details can be seen in Pearl's paper[1].

To recover general Causal polytree, one can download "Fisher's exact test" in my space for conditional independence test.

One can start from ControlCenter.m, I add a simple...



The probabilistic logic sampling algorithm is described in (Henrion 1988). Here is the website:
http://genie.sis.pitt.edu/wiki/Stochastic_Sampling_Algorithms:_Probabilistic_Logic_Sampling

About the theory under PLS, please refer...



Our basic idea is based on (n,k)-gray code which was introduced in one paper named :"Generalized Gray Codes with Applications".

Our extention is allowing each digit ranged from different digit which is widely useful in some...



A simple, fast and short code for beginners, who cares about Fisher's Exact Test, .
As a beginner, at least you need to know what we do with Fisher's Exact Test (see [1][2]). My function is simple,

Pvalue =...



The definition of mutual information could resort to wiki:
http://en.wikipedia.org/wiki/Mutual_information

For marginal mutual information, we say it is :
I(A,B)=sum sum P(A,B) log[P(A,B)/P(A)P(B)]

For conditional...



We use the idea of Chu-Liu/Edmonds Algorithm, see paper [1,2], to implement four functions here.
1. Maximal Directed Maximum Spanning Tree
By DirectedMaximumSpanningTree.m
2. Minimal Directed Maximum Spanning Tree
By...