scholarly journals Privacy‐preserving evaluation for support vector clustering

2020 ◽  
Author(s):  
J. Byun ◽  
J. Lee ◽  
S. Park
Electronics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 178
Author(s):  
Yuan Ping ◽  
Bin Hao ◽  
Xiali Hei ◽  
Jie Wu ◽  
Baocang Wang

Despite its remarkable capability in handling arbitrary cluster shapes, support vector clustering (SVC) suffers from pricey storage of kernel matrix and costly computations. Outsourcing data or function on demand is intuitively expected, yet it raises a great violation of privacy. We propose maximized privacy-preserving outsourcing on SVC (MPPSVC), which, to the best of our knowledge, is the first all-phase outsourceable solution. For privacy-preserving, we exploit the properties of homomorphic encryption and secure two-party computation. To break through the operation limitation, we propose a reformative SVC with elementary operations (RSVC-EO, the core of MPPSVC), in which a series of designs make selective outsourcing phase possible. In the training phase, we develop a dual coordinate descent solver, which avoids interactions before getting the encrypted coefficient vector. In the labeling phase, we design a fresh convex decomposition cluster labeling, by which no iteration is required by convex decomposition and no sampling checks exist in connectivity analysis. Afterward, we customize secure protocols to match these operations for essential interactions in the encrypted domain. Considering the privacy-preserving property and efficiency in a semi-honest environment, we proved MPPSVC’s robustness against adversarial attacks. Our experimental results confirm that MPPSVC achieves comparable accuracies to RSVC-EO, which outperforms the state-of-the-art variants of SVC.


Author(s):  
M. Tanveer ◽  
Tarun Gupta ◽  
Miten Shah ◽  

Twin Support Vector Clustering (TWSVC) is a clustering algorithm inspired by the principles of Twin Support Vector Machine (TWSVM). TWSVC has already outperformed other traditional plane based clustering algorithms. However, TWSVC uses hinge loss, which maximizes shortest distance between clusters and hence suffers from noise-sensitivity and low re-sampling stability. In this article, we propose Pinball loss Twin Support Vector Clustering (pinTSVC) as a clustering algorithm. The proposed pinTSVC model incorporates the pinball loss function in the plane clustering formulation. Pinball loss function introduces favorable properties such as noise-insensitivity and re-sampling stability. The time complexity of the proposed pinTSVC remains equivalent to that of TWSVC. Extensive numerical experiments on noise-corrupted benchmark UCI and artificial datasets have been provided. Results of the proposed pinTSVC model are compared with TWSVC, Twin Bounded Support Vector Clustering (TBSVC) and Fuzzy c-means clustering (FCM). Detailed and exhaustive comparisons demonstrate the better performance and generalization of the proposed pinTSVC for noise-corrupted datasets. Further experiments and analysis on the performance of the above-mentioned clustering algorithms on structural MRI (sMRI) images taken from the ADNI database, face clustering, and facial expression clustering have been done to demonstrate the effectiveness and feasibility of the proposed pinTSVC model.


IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 24499-24512
Author(s):  
Yi-Bo Jiang ◽  
Wei-Jie Chen ◽  
Yu-Qing Wang ◽  
Ming-Chuan Zhang ◽  
Yuan-Hai Shao

Scholarpedia ◽  
2008 ◽  
Vol 3 (6) ◽  
pp. 5187 ◽  
Author(s):  
Asa Ben-Hur

2013 ◽  
Vol 25 (11) ◽  
pp. 2494-2506 ◽  
Author(s):  
V. D'Orangeville ◽  
M. Andre Mayers ◽  
M. Ernest Monga ◽  
M. Shengrui Wang

Sign in / Sign up

Export Citation Format

Share Document