Abstract
We propose a rough margin-based one class support vector machine (Rough one class SVM) by introducing the rough set theory into the one class SVM, to deal with the over-fitting problem. We first construct rough lower margin, rough upper margin, and rough boundary and then maximize the rough margin rather than the margin in the one class SVM. Thus, more points are adaptively considered in constructing the separating hyper-plane than those used in the conventional one class SVM. Moreover, different points staying at the different positions are proposed to give different penalties. Specifically, the samples staying at the lower margin are given the larger penalties than those in the boundary of the rough margin. Therefore, the new classifier can avoid the over-fitting problem to a certain extent and yields great generalization performance. Experimental results on one artificial dataset and eight benchmark datasets demonstrate the feasibility and validity of our proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Vapnik V (1995) The nature of statistical learning theory. Springer, New York
Ripley B (1996) Pattern recognition and neural networks. Cambridge University Press, Cambridge
Manevitz LM, Yousef M (2001) One-class SVMs for document classification. J Mach Learn Res 2(1):139–154
Adankon MM, Cheriet M (2010) Genetic algorithm–based training for semi-supervised SVM. Neural Comput Appl 19(8):1197–1026
Ben-Hur A, Horn D, Siegelmann HT, Vapnik V (2002) Support vector clustering. J Mach Learn Res 2:125–137
Schölkopf B, Platt J, Shawe-Taylor J, Smola AJ, Williamson RC (2001) Estimating the support of a high-dimensional distribution. Neural Comput 13(7):1443–1471
Choi Y-S (2009) Least squares one-class support vector machine. Pattern Recogn Lett 30(13):1236–1240
Hao P (2008) Fuzzy one-class support vector machines. Fuzzy Sets Syst 159(18):2317–2336
Bicego M, Figueiredo MAT (2009) Soft clustering using weighted one-class support vector machines. Pattern Recogn 42(1):27–32
Xu Y (2009) Classification algorithm based on feature selection and samples selection. Lect Notes Comput Sci 5552:631–638
Pawlak Z (1982) Rough sets. Int J Comput Inform Sci 11:341–356
Pawlak Z (2002) Rough sets and intelligent data analysis. Inf Sci 147(1):1–12
Asharaf S, Shevade SK, Narasimha murty M (2005) Rough support vector clustering. Pattern Recogn 38(10):1779–1783
Zhang J, Wang Y (2008) A rough margin based on support vector machine. Inf Sci 178(9):2204–2214
Xu Y, Wang L (2011) A rough margin-based ν-twin support vector machine. Neural Comput Appl. doi:10.1007/s00521-011-0565-y
Acknowledgments
The authors gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation. This work was supported by the National Natural Science Foundation of China (Grant No. 61153003, 11171346).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xu, Y., Liu, C. A rough margin-based one class support vector machine. Neural Comput & Applic 22, 1077–1084 (2013). https://doi.org/10.1007/s00521-012-0869-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-012-0869-6