sir,

I want details of this project

(A Divide-And-Conquer Approach for Minimum Spanning Tree-Based Clustering)

ABSTRACT
Due to ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice. However, in such clustering algorithms, the search for nearest neighbor in the construction of minimum spanning trees is the main source of computation and the standard solutions take O(N^{2}) time. In this paper, we present a fast minimum spanning tree-inspired clustering algorithm, which, by using an efficient implementation of the cut and the cycle property of the minimum spanning trees, can have much better performance


please read
http://portal.acmcitation.cfm?id=1592301

sir
please help me in presentation of final document of the above project and i need some clarifications in the project
regards
rajanikanth

a devide and conquer minimum spanning tree based clustering algorithm

sir
please help me in presentation of final document of the above project and i need some clarifications in the project
regards
naresh

to get information about the topic"A Divide-And-Conquer Approach for Minimum Spanning Tree-Based Clustering" refer the page link bellow

http://studentbank.in/report-a-divide-an...2#pid60842