| Files Posted by Guangdi |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 06 Jun 2013 |
|
Maximum(minimum) Weight Spanning Tree ( Directed ) For learning "Directed Maximum Spanning Tree", Chu-Liu/Edmonds Algorithm is implemented here.
Author: Guangdi Li |
spanning tree, learning algorithm, data mining, graphic function, optimization |
49 |
12 |
3.7 |
3 ratings
|
| 06 Jun 2013 |
|
K2 algorithm for learning DAG structure in Bayesian network This is the code of Cooper's K2 algorithm proposed in 1992, quick and convenient for using.
Author: Guangdi Li |
bayesian network, dag, data mining |
52 |
3 |
5.0 |
2 ratings
|
| 01 Feb 2013 |
|
causal polytree algorithm 2004 A polytree algorithm published by M. Ouerd, B. John Oommen, Stan Matwin.
Author: Guangdi Li |
mathematics, statistics |
3 |
0 |
|
| 01 Feb 2013 |
|
Ancestral polytree The code here provides the algorithm of learning ancestral polytree.
Author: Guangdi Li |
mathematics, statistics, modeling |
3 |
0 |
|
| 20 Sep 2011 |
|
Fisher's exact test with n x m contingency table Do you have problem with Fisher's exact test where the contingency table is more than 2*2?
Author: Guangdi Li |
statistics test, mathematics, category, data mining, fishers exact conditi... |
9 |
12 |
2.9 |
7 ratings
|
| Files Tagged by Guangdi |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 06 Jun 2013 |
|
Maximum(minimum) Weight Spanning Tree ( Directed ) For learning "Directed Maximum Spanning Tree", Chu-Liu/Edmonds Algorithm is implemented here.
Author: Guangdi Li |
spanning tree, learning algorithm, data mining, graphic function, optimization |
49 |
12 |
3.7 |
3 ratings
|
| 06 Jun 2013 |
|
K2 algorithm for learning DAG structure in Bayesian network This is the code of Cooper's K2 algorithm proposed in 1992, quick and convenient for using.
Author: Guangdi Li |
bayesian network, dag, data mining |
52 |
3 |
5.0 |
2 ratings
|
| 01 Feb 2013 |
|
causal polytree algorithm 2004 A polytree algorithm published by M. Ouerd, B. John Oommen, Stan Matwin.
Author: Guangdi Li |
mathematics, statistics |
3 |
0 |
|
| 01 Feb 2013 |
|
Ancestral polytree The code here provides the algorithm of learning ancestral polytree.
Author: Guangdi Li |
mathematics, statistics, modeling |
3 |
0 |
|
| 20 Sep 2011 |
|
Fisher's exact test with n x m contingency table Do you have problem with Fisher's exact test where the contingency table is more than 2*2?
Author: Guangdi Li |
statistics test, mathematics, category, data mining, fishers exact conditi... |
9 |
12 |
2.9 |
7 ratings
|
| Files Matching Guangdi's Watch List |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 06 Jun 2013 |
|
Maximum(minimum) Weight Spanning Tree ( Directed ) For learning "Directed Maximum Spanning Tree", Chu-Liu/Edmonds Algorithm is implemented here.
Author: Guangdi Li |
spanning tree, learning algorithm, data mining, graphic function, optimization |
49 |
12 |
3.7 |
3 ratings
|
| 06 Jun 2013 |
|
K2 algorithm for learning DAG structure in Bayesian network This is the code of Cooper's K2 algorithm proposed in 1992, quick and convenient for using.
Author: Guangdi Li |
bayesian network, dag, data mining |
52 |
3 |
5.0 |
2 ratings
|
| 20 Sep 2011 |
|
Fisher's exact test with n x m contingency table Do you have problem with Fisher's exact test where the contingency table is more than 2*2?
Author: Guangdi Li |
statistics test, mathematics, category, data mining, fishers exact conditi... |
9 |
12 |
2.9 |
7 ratings
|
| 31 Jan 2011 |
|
Discretization algorithms: Class-Attribute Contingency Coefficient To discrete continuous data, CACC is a promising discretization scheme proposed in 2008
Author: Guangdi Li |
discretization, data mining, classification, error message |
8 |
20 |
3.3 |
4 ratings
|
| 17 Oct 2010 |
|
CAIM Discretization Algorithm CAIM (class-attribute interdependence maximization) is designed to discretize continuous data.
Author: Guangdi Li |
discretization, classification, data mining |
8 |
2 |
|
|
Comment only