Minimum Spanning Tree Based Clustering Using Partitional Approach

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 199)


Graph-based clustering techniques have widely been researched in the literature. MST-based clustering is the well known graph-based model in producing the clusters of arbitrary shapes. However, the MST-based clustering methods suffer from high computational complexity (i.e. quadratic). In this paper, we propose a partitional approach not only to speed up the MST-based clustering, but also to identify the outlier points. Initially, a squared error clustering algorithm is used as a pre-processing stage for MST-based clustering. Then the MST-based approach is applied on the representative points (centroids) of the sub-clusters produced by the squared error clustering method. The local outlier factor is used to deal with the outliers. We have performed wide-ranging experiments on several synthetic and real world data sets. The results of the multi-dimensional data are evaluated using the computation time of the algorithms.


Clustering minimum spanning tree squared error method local outlier factor 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jain, A.K., Dubes, R.C.: Algorithms for Clustering. Prentice Hall, New Jersey (1988)MATHGoogle Scholar
  2. 2.
    Juang, L., Wu, M.N.: Psoriasis Image Identification using K-means Clustering with Morphological Processing. Measurement 44, 895–905 (2011)CrossRefGoogle Scholar
  3. 3.
    Parks, J.M.: Cluster Analysis Applied to Multivariate Geologic Problems. The Journal of Geology 74(5), 703–715 (1966)CrossRefGoogle Scholar
  4. 4.
    Reyes, S., Nino, A., Munoz-Caro, C.: Customizing Clustering Computing for A Computational Chemistry Environment - The Case of the DBO-83 Nicotinic Analgesic. Molecular Structure: THEOCHEM 727(1-3), 41–48 (2005)CrossRefGoogle Scholar
  5. 5.
    Garibaldi, U., Costantini, D., Donadio, S., Viarengo, P.: Herding and Clustering in Economics: The Yule-Zipf-Simon Model. Computational Economics 27, 115–134 (2006)CrossRefMATHGoogle Scholar
  6. 6.
    Wang, B., Rahal, I., Dong, A.: Parallel Hierarchical Clustering using Weighted Confidence Affinity. International Journal of Data Mining, Modelling and Management 3(2), 110–129 (2011)CrossRefGoogle Scholar
  7. 7.
    Jiang, D., Pei, J., Zhang, A.: DHC: A Density-based Hierarchical Clustering Method for Time Series Gene Expression Data. In: 3rd IEEE Symposium on Bioinformatics and Bioengineering, USA, pp. 1–8 (2003)Google Scholar
  8. 8.
    Zahn, C.T.: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters. IEEE Transactions on Computers 20(1), 68–86 (1971)CrossRefMATHGoogle Scholar
  9. 9.
    Wang, X., Wang, X., Wilkes, D.M.: A Divide-and-Conquer Approach for Minimum Spanning Tree-based Clustering. IEEE Transactions on Knowledge and Data Engineering 21, 945–958 (2009)CrossRefGoogle Scholar
  10. 10.
    Zhong, C., Miao, D., Wang, R.: A Graph-Theoretical Clustering Method based on Two Rounds of Minimum Spanning Trees. Pattern Recognition 43, 752–766 (2010)CrossRefMATHGoogle Scholar
  11. 11.
    Chowdhury, N., Murthy, C.A.: Minimal Spanning Tree based Clustering Technique: Relationship with Bayes Classifier. Pattern Recognition 30(11), 1919–1929 (1997)CrossRefGoogle Scholar
  12. 12.
    Langley, P., Iba, W., Thompson, K.: An Analysis of Bayesian Classifiers. In: 10th National Conference on Artificial Intelligence, California, pp. 223–228 (1992)Google Scholar
  13. 13.
    Zhong, C., Miao, D., Franti, P.: Minimum Spanning Tree based Split-and-Merge: A Hierarchical Clustering Method. Information Sciences 181(16), 3397–3410 (2011)CrossRefGoogle Scholar
  14. 14.
    Breunig, M.M., Kriegel, H., Ng, R.T., Sander, J.: LOF: Identifying Density-based Local Outliers. In: ACM SIGMOD International Conference on Management of Data, Dallas, TX, pp. 93–104 (2000)Google Scholar
  15. 15.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, USA (2001)MATHGoogle Scholar
  16. 16.
    UCI Machine Learning Repository,
  17. 17.
    Paivinen, N.: Clustering with A Minimum Spanning Tree of Scale-Free-Like Structure. Pattern Recognition Letters 26, 921–930 (2005)CrossRefGoogle Scholar
  18. 18.
    Grygorash, O., Zhou, Y., Jorgensen, Z.: Minimum Spanning Tree-based Clustering Algorithms. In: IEEE International Conference on Tools with Artificial Intelligence, pp. 73–81. IEEE Computer Society, USA (2006)Google Scholar
  19. 19.
    He, Y., Chen, L.: MinClue: A MST-based Clustering Method with Auto-Threshold Detection. In: IEEE International Conference Cybernetics and Intelligent Systems, Singapore, pp. 229–233 (2004)Google Scholar
  20. 20.
    Ng, A.Y., Jordan, M.I., Weiss, Y.: On Spectral Clustering: Analysis and an Algorithm. In: International Conference on Advances in Neural Information Processing Systems, pp. 849–856. MIT Press, USA (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Computer Science & EngineeringIndian School of MinesDhanbadIndia

Personalised recommendations