Back close

A dynamic clustering technique using minimumspanning tree

Publication Type : Conference Proceedings

Publisher : IACSIT Press

Source : 2nd International Conference on Biotechnology and Food Science IPCBEE, IACSIT Press, Volume 7, Singapore (2011)

Url : https://pdfs.semanticscholar.org/3129/518b6061a7d060e03c27d244aff5a8db353e.pdf

Campus : Coimbatore

School : School of Engineering

Department : Computer Science

Year : 2011

Abstract : Clustering technique is one of the most important and basic tool for data mining. In this paper, we present a clustering algorithm that is inspired by minimum spanning tree. Given the minimum spanning tree over a data set, selects or rejects the edges of the MST in process of forming the clusters, depending on the threshold value. The Algorithm is invoked repeatedly until all the clusters are fully formed. We present experimental results of our algorithm on some synthetic data sets as well as real world data sets.

Cite this Research Publication : V. M. K. Prasad Goura, Madhusudana Rao Nalluri, and M. Rajasekhar Reddy, “A dynamic clustering technique using minimumspanning tree”, 2nd International Conference on Biotechnology and Food Science IPCBEE, vol. 7. IACSIT Press, Singapore, 2011.

Admissions Apply Now