DPWSS: differentially private working set selection for training support vector machines

被引:2
作者
Sun, Zhenlong [1 ,2 ]
Yang, Jing [1 ]
Li, Xiaoye [2 ]
Zhang, Jianpei [1 ]
机构
[1] Harbin Engn Univ, Coll Comp Sci & Technol, Harbin, Heilongjiang, Peoples R China
[2] Qiqihar Univ, Coll Comp & Control Engn, Qiqihar, Heilongjiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Differential privacy; Exponential mechanism; Sequential minimal optimization; Support vector machines; Working set selection; SMO ALGORITHM; CONVERGENCE;
D O I
10.7717/peerj-cs.799
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Support vector machine (SVM) is a robust machine learning method and is widely used in classification. However, the traditional SVM training methods may reveal personal privacy when the training data contains sensitive information. In the training process of SVMs, working set selection is a vital step for the sequential minimal optimization-type decomposition methods. To avoid complex sensitivity analysis and the influence of high-dimensional data on the noise of the existing SVM classifiers with privacy protection, we propose a new differentially private working set selection algorithm (DPWSS) in this paper, which utilizes the exponential mechanism to privately select working sets. We theoretically prove that the proposed algorithm satisfies differential privacy. The extended experiments show that the DPWSS algorithm achieves classification capability almost the same as the original non-privacy SVM under different parameters. The errors of optimized objective value between the two algorithms are nearly less than two, meanwhile, the DPWSS algorithm has a higher execution efficiency than the original non-privacy SVM by comparing iterations on different datasets. To the best of our knowledge, DPWSS is the first private working set selection algorithm based on differential privacy.
引用
收藏
页数:36
相关论文
共 50 条
[41]   Extract candidates of support vector from training set [J].
Liu, YG ;
Chen, Q ;
Yu, RZ .
2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, :3199-3202
[42]   Purity Filtering: An Instance Selection Method for Support Vector Machines [J].
Moran-Pomes, David ;
Belanche-Munoz, Lluis A. .
ARTIFICIAL INTELLIGENCE XXXVI, 2019, 11927 :21-35
[43]   Data selection using SASH trees for support vector machines [J].
Sun, Chaofan ;
Vilalta, Ricardo .
MACHINE LEARNING AND DATA MINING IN PATTERN RECOGNITION, PROCEEDINGS, 2007, 4571 :286-+
[44]   Electrocardiogram analysis with adaptive feature selection and support vector machines [J].
Kao, Wen-Chung ;
Yu, Chun-Kuo ;
Shen, Chia-Ping ;
Chen, Wei-Hsin ;
Hsiao, Pei-Yung .
2006 IEEE Asia Pacific Conference on Circuits and Systems, 2006, :1783-1786
[45]   A wrapper method for feature selection using Support Vector Machines [J].
Maldonado, Sebastian ;
Weber, Richard .
INFORMATION SCIENCES, 2009, 179 (13) :2208-2217
[46]   Variable selection for support vector machines in moderately high dimensions [J].
Zhang, Xiang ;
Wu, Yichao ;
Wang, Lan ;
Li, Runze .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2016, 78 (01) :53-76
[47]   Gene selection for cancer classification using support vector machines [J].
Guyon, I ;
Weston, J ;
Barnhill, S ;
Vapnik, V .
MACHINE LEARNING, 2002, 46 (1-3) :389-422
[48]   Gene Selection for Cancer Classification using Support Vector Machines [J].
Isabelle Guyon ;
Jason Weston ;
Stephen Barnhill ;
Vladimir Vapnik .
Machine Learning, 2002, 46 :389-422
[49]   Cost-sensitive Feature Selection for Support Vector Machines [J].
Benitez-Pena, S. ;
Blanquero, R. ;
Carrizosa, E. ;
Ramirez-Cobo, P. .
COMPUTERS & OPERATIONS RESEARCH, 2019, 106 :169-178
[50]   Optimal feasible step-size based working set selection for large scale SVMs training [J].
Peng, Shili ;
Hu, Qinghua ;
Dang, Jianwu ;
Wang, Wenwu .
NEUROCOMPUTING, 2020, 407 :366-375