International Journal of Applied Information Systems |
Foundation of Computer Science (FCS), NY, USA |
Volume 3 - Number 5 |
Year of Publication: 2012 |
Authors: V. Valli Kumari, Bhvs Ramakrishnam Raju, Azad Naik |
10.5120/ijais12-450549 |
V. Valli Kumari, Bhvs Ramakrishnam Raju, Azad Naik . Hybrid Clustering Algorithm based on Mahalanobis Distance and MST. International Journal of Applied Information Systems. 3, 5 ( July 2012), 60-63. DOI=10.5120/ijais12-450549
Most of the clustering algorithms are based on Euclidean distance as measure of similarity between data objects. Theses algorithms also require initial setting of parameters as a prior, for example the number of clusters. The Euclidean distance is very sensitive to scales of variables involved and independent of correlated variables. To conquer these drawbacks a hybrid clustering algorithm based on Mahalanobis distance is proposed in this paper. The reason for the hybridization is to relieve the user from setting the parameters in advance. The experimental results of the proposed algorithm have been presented for both synthetic and real datasets.