Information Technology Journal1812-56381812-5646Asian Network for Scientific Information10.3923/itj.2008.850.858ShaoFubo DuanHua HeGuoping ZhangXin 6200876We propose a novel unified model for Privacy-Preserving
Support Vector Machines (PPSVM for short) classifier on horizontally and
vertically partitioned data. We prove the feasibility of the model. Besides
we give out the algorithms for horizontally partitioned data and vertically
partitioned data, respectively. The columns of data matrix A represent
input features and the rows represent the individual data which is called
a training/testing point in SVM. For horizontally partitioned data, the
data matrix A whose rows including all input features are divided into
groups belonging to different entities. While for vertically partitioned
data, the data matrix A`s columns are divided into groups belonging to
different entities. Each entity is unwilling to share its group of data
or leak the data for various reasons. The proposed SVM classifiers are
public but do not reveal any private data. And when we calculate the classifier
at last, we do not need to recover the original data. Besides, it has
comparable accuracy with that of an ordinary SVM classifier that uses
the centralized data set directly. Experiments show that our approach
is effective.]]>Agrawal, R. and R. Srikant,2000Burges, C.J.C.,1998Chen, K. and L. Liu,2005Fung, G. and O.L. Mangasarian,2001Fung, G. and O.L. Mangasarian,2001Ioannidis, I., A. Grama and M. Atallah,2002Kantarcioglu, M. and C. Clifton,2004Lee, Y.J. and S.Y. Huang,2007Vaidya, J. and C. Clifton,2002Vapnik, V.N.,2000Yu, H., X. Jiang and J. Vaidya,2006Yu, H., J. Vaidya and X. Jiang,2006