Skip to main content
Top
Published in: Soft Computing 5/2015

01-05-2015 | Methodologies and Application

Privacy preserving and fast decision for novelty detection using support vector data description

Authors: Wenjun Hu, Shitong Wang, Fu-lai Chung, Yong Liu, Wenhao Ying

Published in: Soft Computing | Issue 5/2015

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Support vector data description (SVDD) has been widely used in novelty detection applications. Since the decision function of SVDD is expressed through the support vectors which contain sensitive information, the support vectors will be disclosed when SVDD is used to detect the unknown samples. Accordingly, privacy concerns arise. In addition, when it is applied to large datasets, SVDD does not scale well as its complexity is linear with the size of the training dataset (actually the number of support vectors). Our work here is distinguished in two aspects. First, by decomposing the kernel mapping space into three subspaces and exploring the pre-image of the center of SVDD’s sphere in the original space, a fast decision approach of SVDD, called FDA-SVDD, is derived, which includes three implementation versions, called FDA-SVDD-I, FDA-SVDD-II and FDA-SVDD-III. The decision complexity of the proposed method is reduced to only \(O\)(1). Second, as the decision function of FDA-SVDD only refers to the pre-image of the sphere center, the privacy of support vectors can be preserved. Therefore, the proposed FDA-SVDD is particularly attractive in privacy-preserving novelty detection applications. Empirical analysis conducted on UCI and USPS datasets demonstrates the effectiveness of the proposed approach and verifies the derived theoretical results.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
go back to reference BakIr G, Zien A, Tsuda K (2004) Learning to find graph pre-images. in Proc. of the 26th DAGM Symposium on Pattern Recognition, pp 253–261 BakIr G, Zien A, Tsuda K (2004) Learning to find graph pre-images. in Proc. of the 26th DAGM Symposium on Pattern Recognition, pp 253–261
go back to reference Chung FL, Deng ZH, Wang ST (2009) From minimum enclosing ball to fast fuzzy inference system training on large datasets. IEEE Trans Fuzzy Systems 17(1):173–184CrossRef Chung FL, Deng ZH, Wang ST (2009) From minimum enclosing ball to fast fuzzy inference system training on large datasets. IEEE Trans Fuzzy Systems 17(1):173–184CrossRef
go back to reference Collobert R, Bengio S, Bengio Y (2002) A parallel mixture of SVMs for very large scale problems. Neural Comput 14(5):1105–1114CrossRefMATH Collobert R, Bengio S, Bengio Y (2002) A parallel mixture of SVMs for very large scale problems. Neural Comput 14(5):1105–1114CrossRefMATH
go back to reference Cortes C, Vapnik VN (1995) Support vector networks. Mach Learn 20(3):273–297MATH Cortes C, Vapnik VN (1995) Support vector networks. Mach Learn 20(3):273–297MATH
go back to reference Deng ZH, Chung FL, Wang ST (2008) FRSDE: fast reduced set density estimator using minimal enclosing ball approximation. Pattern Recogn 41:1363–1372CrossRefMATH Deng ZH, Chung FL, Wang ST (2008) FRSDE: fast reduced set density estimator using minimal enclosing ball approximation. Pattern Recogn 41:1363–1372CrossRefMATH
go back to reference Friedman A, Wolff R, Schuster A (2008) Providing k-anonymity in data mining. VLDB J 17(4):789–804CrossRef Friedman A, Wolff R, Schuster A (2008) Providing k-anonymity in data mining. VLDB J 17(4):789–804CrossRef
go back to reference Geebelen D, Suykens JAK, Vandewalle J (2010) Reducing the number of support vectors of SVM classifiers using the smoothed separable case approximation. IEEE Trans Neural Netw Learn Systems 23(4):682–688CrossRef Geebelen D, Suykens JAK, Vandewalle J (2010) Reducing the number of support vectors of SVM classifiers using the smoothed separable case approximation. IEEE Trans Neural Netw Learn Systems 23(4):682–688CrossRef
go back to reference Ha MH, Wang C, Chen JQ (2013) The support vector machine based on intuitionistic fuzzy number and kernel function. Soft Comput 17(4):635–641CrossRefMATH Ha MH, Wang C, Chen JQ (2013) The support vector machine based on intuitionistic fuzzy number and kernel function. Soft Comput 17(4):635–641CrossRefMATH
go back to reference Hull JJ (1994) A database for handwritten text recognition research. IEEE Trans Pattern Anal Mach Intell 16(5):550–554CrossRef Hull JJ (1994) A database for handwritten text recognition research. IEEE Trans Pattern Anal Mach Intell 16(5):550–554CrossRef
go back to reference Jeffreys H, Jeffreys BS (1988) Mean-value theorems. Methods of Mathematical Physics, ed. 3. Cambridge University Press, Cambridge, England, pp 49–50 Jeffreys H, Jeffreys BS (1988) Mean-value theorems. Methods of Mathematical Physics, ed. 3. Cambridge University Press, Cambridge, England, pp 49–50
go back to reference Kwok JT, Tsang IW (2004) The pre-image problem in kernel methods. IEEE Trans Neural Netw 15(6):1517–1525CrossRef Kwok JT, Tsang IW (2004) The pre-image problem in kernel methods. IEEE Trans Neural Netw 15(6):1517–1525CrossRef
go back to reference Lin KP, Chen MS (2011) On the design and analysis of the privacy-preserving SVM classifier. IEEE Trans Knowl Data Eng 23(11):1704–1717CrossRef Lin KP, Chen MS (2011) On the design and analysis of the privacy-preserving SVM classifier. IEEE Trans Knowl Data Eng 23(11):1704–1717CrossRef
go back to reference Liu YH, Liu YC, Chen YJ (2010) Fast support vector data descriptions for novelty detection. IEEE Trans Neural Netw Learn Systems 21(8):1296–1313CrossRef Liu YH, Liu YC, Chen YJ (2010) Fast support vector data descriptions for novelty detection. IEEE Trans Neural Netw Learn Systems 21(8):1296–1313CrossRef
go back to reference Mozafari B, Zaniolo C (2009) Publishing naive bayesian classifiers: privacy without accuracy loss. In: Proceedings of the 35th International Conference on Very Large Data Bases (VLDB) 2(1): 1174–1185 Mozafari B, Zaniolo C (2009) Publishing naive bayesian classifiers: privacy without accuracy loss. In: Proceedings of the 35th International Conference on Very Large Data Bases (VLDB) 2(1): 1174–1185
go back to reference Ogiela MR, Ogiela U (2012) DNA-like linguistic secret sharing for strategic information systems. Int J Inf Manag 32(2):175–181CrossRefMathSciNet Ogiela MR, Ogiela U (2012) DNA-like linguistic secret sharing for strategic information systems. Int J Inf Manag 32(2):175–181CrossRefMathSciNet
go back to reference Osuna E, Girosi F (1999) Reducing the run-time complexity of support vector machines. in Advances in Kernel Methods: Support Vector Learning, Schölkopf B, Burges CJC, Smola A, Eds. Cambridge 271–283 Osuna E, Girosi F (1999) Reducing the run-time complexity of support vector machines. in Advances in Kernel Methods: Support Vector Learning, Schölkopf B, Burges CJC, Smola A, Eds. Cambridge 271–283
go back to reference Roberts S, Tarassenko L (1994) A probabilistic resource allocation network for novelty detection. Neural Comput 6:270–284CrossRef Roberts S, Tarassenko L (1994) A probabilistic resource allocation network for novelty detection. Neural Comput 6:270–284CrossRef
go back to reference Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326CrossRef Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326CrossRef
go back to reference Stokes K, Torra V (2012) Reidentification and k-anonymity: a model for disclosure risk in graphs. Soft Comput 16(10):1657–1670CrossRefMATH Stokes K, Torra V (2012) Reidentification and k-anonymity: a model for disclosure risk in graphs. Soft Comput 16(10):1657–1670CrossRefMATH
go back to reference Tang B, Mazzoni D (2006) Multiclass reduced-set support vector machines. in Proc. 23rd Int. Conf. Mach. Learning 921–928 Tang B, Mazzoni D (2006) Multiclass reduced-set support vector machines. in Proc. 23rd Int. Conf. Mach. Learning 921–928
go back to reference Tenenbaum JB, Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319–2323 Tenenbaum JB, Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319–2323
go back to reference Tex DMJ et al (2004) Support vector data description. Mach Learn 54(1):45–66 Tex DMJ et al (2004) Support vector data description. Mach Learn 54(1):45–66
go back to reference Towel GG (2000) Local expert autoassociators for anomaly detection. Proc. 17th ICML 1023–1030 Towel GG (2000) Local expert autoassociators for anomaly detection. Proc. 17th ICML 1023–1030
go back to reference Tsang IW, Kwok JT et al (2005) Core vector machines: fast SVM training on very large data sets. J Mach Learn Res 6:363–392 Tsang IW, Kwok JT et al (2005) Core vector machines: fast SVM training on very large data sets. J Mach Learn Res 6:363–392
go back to reference Tsang IW, Kwok JT, Zurada JM (2006) Generalized core vector machines. IEEE Trans Neural Netw 17(5):1126–1140CrossRef Tsang IW, Kwok JT, Zurada JM (2006) Generalized core vector machines. IEEE Trans Neural Netw 17(5):1126–1140CrossRef
go back to reference Vaidya J, Yu H, Jiang X (2008) Privacy-preserving SVM classification. Knowl Inf Systems 14:161–178CrossRef Vaidya J, Yu H, Jiang X (2008) Privacy-preserving SVM classification. Knowl Inf Systems 14:161–178CrossRef
go back to reference Wang C, Liu LZ, Gao LJ (2013) Research on k-Anonymity algorithm in privacy protection. Adv Mater Res 756–759:3471–3475CrossRef Wang C, Liu LZ, Gao LJ (2013) Research on k-Anonymity algorithm in privacy protection. Adv Mater Res 756–759:3471–3475CrossRef
go back to reference Wu MR, Ye JP (2009) A small sphere and large margin approach for novelty detection using training data with outliers. IEEE Trans Pattern Anal Mach Intell 31:2088–2092CrossRef Wu MR, Ye JP (2009) A small sphere and large margin approach for novelty detection using training data with outliers. IEEE Trans Pattern Anal Mach Intell 31:2088–2092CrossRef
Metadata
Title
Privacy preserving and fast decision for novelty detection using support vector data description
Authors
Wenjun Hu
Shitong Wang
Fu-lai Chung
Yong Liu
Wenhao Ying
Publication date
01-05-2015
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 5/2015
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-014-1331-8

Other articles of this Issue 5/2015

Soft Computing 5/2015 Go to the issue

Premium Partner