Please use this identifier to cite or link to this item:
Title: Privacy preserving and fast decision for novelty detection using support vector data description
Authors: Hu, W
Wang, S
Chung, FL 
Liu, Y
Ying, W
Keywords: Decision complexity
Integrated squared error (ISE)
Kernelized sphere
Novelty detection
Pre-image of sphere center
Support vector data description (SVDD)
Issue Date: 2015
Publisher: Springer
Source: Soft computing, 2015, v. 19, no. 5, p. 1171-1186 How to cite?
Journal: Soft computing 
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 (Formula presented.)(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.
ISSN: 1432-7643
DOI: 10.1007/s00500-014-1331-8
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.