A Clustering Algorithm Based on Improved Minimum Spanning Tree

See more:

C++

C

Java

thank you very much.. thanks for ur suggestions.. bye.. take care

Restoring author's original question (which I am restoring
as an example of a question you should not answer):

PLS SEND ME THE CODE FOR THE BELOW ABSTRACT AND ALSO TRY TO EXPLAIN IN DETAILS....

                                                   THANK YOU

                                                                KALYAN

                                     ABSTRACT

The algorithms of data mining need better efficiency as data scale becomes larger and larger and the dimension of data is more. Aiming at the lower efficiency of the former MST (minimum spanning tree) clustering algorithm based on gene expression, a modified IMST (improved minimum spanning tree) clustering algorithm applied to common problem is brought forward. The analyzing of theory and example show that new IMST clustering algorithm can enhance the efficiency of constructing spanning tree and can solve sorting problem for shorter edges of clustering in minimum spanning trees. At last, both the efficiency of clustering and its effect are improved whole.