Ramp-based twin support vector clustering
- 38 Downloads
Traditional plane-based clustering methods measure the within-cluster or between-cluster scatter by linear, quadratic or some other unbounded functions, which are sensitive to the samples far from the cluster center. This paper introduces the ramp functions into plane-based clustering and proposes a ramp-based twin support vector clustering (RampTWSVC). RampTWSVC is very robust to the samples far from the cluster center, because its within-cluster and between-cluster scatters are measured by the bounded ramp functions. Thus, it is easier to find the intrinsic clusters than other plane-based clustering methods. The nonconvex programming problem in RampTWSVC is solved efficiently through an alternating iteration algorithm, and its local solution can be obtained in a finite number of iterations theoretically. In addition, its nonlinear manifold clustering formation is also proposed via a kernel trick. Experimental results on several benchmark datasets show the better performance of our RampTWSVC compared with other plane-based clustering methods.
KeywordsClustering Plane-based clustering Ramp function Twin support vector clustering Nonconvex programming
This work is supported in part by National Natural Science Foundation of China (Nos. 61966024, 11501310, 61866010, 11871183 and 61703370), in part by Program for Young Talents of Science and Technology in Universities of Inner Mongolia Autonomous Region (No. NJYT-19-B01), in part by Natural Science Foundation of Hainan Province (No. 118QN181), in part by Scientific Research Foundation of Hainan University (No. kyqd(sk)1804) and in part by Zhejiang Provincial Natural Science Foundation of China (No. LQ17F030003).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- 8.Tan P, Steinbach M, Kumar V (2005) Introduction to data mining, 1st edn. Addison-Wesley Longman Publishing Co. Inc, BostonGoogle Scholar
- 26.Souvenir R, Pless R (2005) Manifold clustering. In: Tenth IEEE international conference on computer vision, ICCV 2005, vol 1, IEEE, pp 648–653Google Scholar
- 27.Cao W, Haralick R (2006) Nonlinear manifold clustering by dimensionality. In: 18th international conference on pattern recognition. ICPR 2006, vol 1. IEEE, pp 920–924Google Scholar
- 29.Platt J (1999) Fast training of support vector machines using sequential minimal optimization. Advances in kernel methods-support vector learning. MIT Press, Cambridge, pp 185–208Google Scholar
- 31.Blake C, Merz C (1998) UCI Repository for Machine Learning Databases, http://www.ics.uci.edu/~mlearn/MLRepository.html
- 32.Li C, Shao Y, Yin W, Liu M (2019) Robust and sparse linear discriminant analysis via an alternating direction method of multipliers. IEEE Trans Neural Netw Learn Syst (in press) Google Scholar
- 33.Liu H, Fu Y (2015) Clustering with partition level side information. In: 2015 IEEE international conference on data mining (ICDM). IEEE, pp 877–882Google Scholar