Partitioning Clustering Based on Support Vector Ranking

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10086)


Support Vector Clustering (SVC) has become a significant boundary-based clustering algorithm. In this paper we propose a novel SVC algorithm named “Partitioning Clustering Based on Support Vector Ranking (PC-SVR)”, which is aimed at improving the traditional SVC, which suffers the drawback of high computational cost during the process of cluster partition. PC-SVR is divided into two parts. For the first part, we sort the support vectors (SVs) based on their geometrical properties in the feature space. Based on this, the second part is to partition the samples by utilizing the clustering algorithm of similarity segmentation based point sorting (CASS-PS) and thus produce the clustering. Theoretically, PC-SVR inherits the advantages of both SVC and CASS-PS while avoids the downsides of these two algorithms at the same time. According to the experimental results, PC-SVR demonstrates good performance in clustering, and it outperforms several existing approaches in terms of Rand index, adjust Rand index, and accuracy index.


Support vector clustering Support vector ranking Partitioning clustering 



This work is supported by the National Natural Science Foundation of China (Grant Nos. 61472159, 61572227), Development Project of Jilin Province of China (20140101180JC,20160204022GX).


  1. 1.
    Tung, A.K., Hou, J., Han, J.: Spatial clustering in the presence of obstacles. In: 17th IEEE International Conference on Data Engineering, pp. 359–367. IEEE, Heidelberg (2001)Google Scholar
  2. 2.
    Kaufman, L.R., Rousseeuw, P.: Finding Groups in Data: An Introduction to Cluster Analysis. Hoboken NJ John Wiley & Sons Inc., New York (1990)CrossRefMATHGoogle Scholar
  3. 3.
    Ng, R.T., Han, J.: Efficient and Effective Clustering Methods for Spatial Data Mining. University of British Columbia, Vancouver (1994)Google Scholar
  4. 4.
    Bradley, P.S., Fayyad, U.M., Reina., C.: Scaling Clustering Algorithms to Large Databases. In: KDD, New York, pp. 9–15 (1998)Google Scholar
  5. 5.
    Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: ACM SIGMOD International Conference on Management of Data, pp. 103–114. ACM, New York (1996)Google Scholar
  6. 6.
    Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: ACM SIGMOD Record, vol. 27, No. 2, pp. 73–84. ACM, Seattle (1998)Google Scholar
  7. 7.
    Karypis, G., Han, E.-H., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. Computer 32(8), 68–75 (1999)CrossRefGoogle Scholar
  8. 8.
    Ester, M., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, No. 34, Portland, pp. 226–231 (1996)Google Scholar
  9. 9.
    Ankerst, M., et al.: OPTICS: ordering points to identify the clustering structure. In: ACM Sigmod Record. vol. 28, pp. 49–60. ACM, Philadelphia (1999)Google Scholar
  10. 10.
    Hinneburg, A., Keim, D.A.: An efficient approach to clustering in large multimedia databases with noise. In: KDD, vol. 98, New York, pp. 58–65 (1998)Google Scholar
  11. 11.
    Wang, W., Yang, J., Muntz, R.: STING: A statistical information grid approach to spatial data mining. In: VLDB, vol. 97, Athens, pp. 186–195 (1997)Google Scholar
  12. 12.
    Sheikholeslami, G., Chatterjee, S., Zhang, A.: Wavecluster: a multi-resolution clustering approach for very large spatial databases. In: VLDB, vol. 98, New York, pp. 428–439 (1998)Google Scholar
  13. 13.
    Shavlik, J.W., Dietterich, T.G.: Readings in machine learning. Morgan Kaufmann (1990)Google Scholar
  14. 14.
    Kohonen, T.: Self-organized formation of topologically correct feature maps. Biol. Cybern. 43(1), 59–69 (1982)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Ben-Hur, A., et al.: Support vector clustering. J. Mach. Learn. Res. 2(12), 125–137 (2001)MATHGoogle Scholar
  16. 16.
    Schölkopf, B., et al.: Estimating the support of a high-dimensional distribution. Neural Comput. 13(7), 1443–1471 (2001)CrossRefMATHGoogle Scholar
  17. 17.
    Ping, L., Chun-Guang, Z., Xu, Z.: Improved support vector clustering. Eng. Appl. Artif. Intell. 23(4), 552–559 (2010)CrossRefGoogle Scholar
  18. 18.
    Yang, J., Estivill-Castro, V., Chalup, S.K.: Support vector clustering through proximity graph modelling. In: 9th International Conference on Neural Information Processing, pp. 898–903. IEEE, Singapore (2002)Google Scholar
  19. 19.
    Lee, J., Lee, D.: An improved cluster labeling method for support vector clustering. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 461–464 (2005)CrossRefGoogle Scholar
  20. 20.
    Jung, K.H., Lee, D., Lee, J.: Fast support-based clustering method for large-scale problems. Pattern Recogn. 43(5), 1975–1983 (2010)CrossRefMATHGoogle Scholar
  21. 21.
    Lee, S.H., Daniels, K.M.: Gaussian kernel width exploration and cone cluster labeling for support vector clustering. Pattern Anal. Appl. 15(3), 327–344 (2012)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Ping, Y., et al.: Convex decomposition based cluster labeling method for support vector clustering. J. Comput. Sci. Technol. 27(2), 428–442 (2012)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    D’Orangeville, V., et al.: Efficient cluster labeling for support vector clustering. IEEE Trans. Knowl. Data Eng. 25(11), 2494–2506 (2013)CrossRefGoogle Scholar
  24. 24.
    Le, T., et al.: Proximity multi-sphere support vector clustering. Neural Comput. Appl. 22(7–8), 1309–1319 (2013)CrossRefGoogle Scholar
  25. 25.
    Saltos, R., Weber, R.: A rough-fuzzy approach for support vector clustering. Inf. Sci. 339, 353–368 (2016)CrossRefGoogle Scholar
  26. 26.
    Li, H.B., Wang, Y., Huang, L., et al.: Clustering algorithm of similarity segmentation based on point sorting. In: The International Conference on Logistics Engineering, Management and Computer Science (2015)Google Scholar
  27. 27.
    Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846–850 (1971)CrossRefGoogle Scholar
  28. 28.
    Naganathan, G.K., et al.: A prototype on-line AOTF hyperspectral image acquisition system for tenderness assessment of beef carcasses. J. Food Eng. 154, 1–9 (2015)CrossRefGoogle Scholar
  29. 29.
    Shao-Hong, Z., Yang, L., Dong-Qing, X.: Unsupervised evaluation of cluster ensemble solutions. In: 7th International Conference on Advanced Computational Intelligence, pp. 101–106. IEEE, Wuyi (2015)Google Scholar
  30. 30.
    UCI machine learning repository.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.College of Computer Science and TechnologyJilin UniversityChangchunChina
  2. 2.School of Nature and Computing SciencesUniversity of AberdeenAberdeenScotland, UK

Personalised recommendations