Abstract

Clustering technique is one of the most important and basic tool for data mining. Cluster algorithms have the ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice. In such clustering algorithms, the search for nearest objects in the construction of minimum spanning trees is the main source of computation and the standard solutions take O(N2) 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 than O(N2).

How to Cite
P.SAMPURNIMA, J SRINIVAS, HARIKRISHNA, Dr.. Performanace of Improved Minimum Spanning Tree Based on Clustering Technique. Global Journal of Computer Science and Technology, [S.l.], sep. 2012. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/595>. Date accessed: 30 mar. 2020.