Rank: 526 based on 128 downloads (last 30 days) and 12 files submitted
photo

Guangdi Li

E-mail
Company/University
Medical school of K.U.Leuven

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Files Posted by Guangdi View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
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... 18 11
  • 3.16667
3.2 | 6 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, classification, data mining, error message 11 18
  • 4.5
4.5 | 2 ratings
29 Nov 2010 Screenshot Maximum(minimum) Weight Spanning Tree ( Directed ) For learning "Directed Maximum Spanning Tree", Chu-Liu/Edmonds Algorithm is implemented here. Author: Guangdi Li spanning tree, data mining, learning algorithm, graphic function, optimization 23 11
  • 5.0
5.0 | 2 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 10 2
01 Feb 2010 Screenshot Causal Polytree ---Pearl's classical algorithm(1988) Pearl's famous causal polytree recover algorithm is implemented here. Author: Guangdi Li data ming, causal polytree, bayesian network, mathematics 1 4
Comments and Ratings by Guangdi View all
Updated File Comments Rating
02 Dec 2011 Maximum Weight Spanning tree (Undirected) Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here. Author: Guangdi Li

I would like to help, but I don't have time, sorry.

02 Dec 2011 Maximum Weight Spanning tree (Undirected) Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here. Author: Guangdi Li

I guess that's the task of your project, no?

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

Thanks for report, Karin.

The infinite problem is solved and a new version based on matlab-R is provided(for those who are familiar with fisher test in R).

05 Sep 2011 Discretization algorithms: Class-Attribute Contingency Coefficient To discrete continuous data, CACC is a promising discretization scheme proposed in 2008 Author: Guangdi Li

You can use the returned variable: DiscretizationSet, to discrete new continuous data. DiscretizationSet is a matrix containing K row and F columns, each column represent one feature, following your input feature data, then the cutoff is saved in corresponding column for your new discretization.
hope it is clear :)

06 Apr 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

I only did the programming based on the mathworld website. Indeed, there may be some fast and efficient way for n * m table, if so, please let me know the reference for further improvement.Thanks for comments.

Comments and Ratings on Guangdi's Files View all
Updated File Comment by Comments Rating
05 Jan 2012 Discretization algorithms: Class-Attribute Contingency Coefficient To discrete continuous data, CACC is a promising discretization scheme proposed in 2008 Author: Guangdi Li FIR

hi i have used this algorithm for my data set as indicated in my paper , in which the cacc and cut off points does not match according to my paper ,please help..

my dataset is

age=[3 ;56 ;15 ;17 ;21 ;35 ;45 ;46 ;51 ;56 ;57;66 ;70 ;71 ]

20 Dec 2011 Discretization algorithms: Class-Attribute Contingency Coefficient To discrete continuous data, CACC is a promising discretization scheme proposed in 2008 Author: Guangdi Li FIR

I hava a dataste of 5 columns say the 1st column has numbers 60 numbers randomlf between 1 to 100,now i want to set a cut off point for this dataset ,is it possible with this algorithm,

cut of point means
for ex-0-10
 10-30
 30-50
50-80
80-100

09 Dec 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 Emmanuel

You have not addressed the comment from Mike above, which is crucial. If Mike is correct, which to me appears to be the case, your function does not compute the Pvalue, but the Pcutoff (equation (2) in the mathworld link). Please address this issue as this is not a minor distinction at all.

02 Dec 2011 Maximum Weight Spanning tree (Undirected) Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here. Author: Guangdi Li Sim

its okie.... i know its my problem and i have to deal with it myself... :S

GOD BLESS U

02 Dec 2011 Maximum Weight Spanning tree (Undirected) Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here. Author: Guangdi Li Li, Guangdi

I would like to help, but I don't have time, sorry.

Top Tags Applied by Guangdi
data mining, bayesian network, mathematics, classification, dag
Files Tagged by Guangdi View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
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... 18 11
  • 3.16667
3.2 | 6 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, classification, data mining, error message 11 18
  • 4.5
4.5 | 2 ratings
29 Nov 2010 Screenshot Maximum(minimum) Weight Spanning Tree ( Directed ) For learning "Directed Maximum Spanning Tree", Chu-Liu/Edmonds Algorithm is implemented here. Author: Guangdi Li spanning tree, data mining, learning algorithm, graphic function, optimization 23 11
  • 5.0
5.0 | 2 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 10 2
01 Feb 2010 Screenshot Causal Polytree ---Pearl's classical algorithm(1988) Pearl's famous causal polytree recover algorithm is implemented here. Author: Guangdi Li data ming, causal polytree, bayesian network, mathematics 1 4

Contact us at files@mathworks.com