Feature‐Based Trajectory Privacy Preserving via Low‐Rank and Sparse Decomposition. Issue 4 (1st July 2018)

• Record Type: Journal Article
• Authors: Li, Wenping; Deng, Kun; Yu, Fahong
• Is Part Of: Chinese journal of electronics. Volume 27:Issue 4(2018)
• Page Start: 746
• Page End: 755
• Publication Date: 2018-07-01
• Subjects: Privacy preserving -- Trajectory -- Low‐rank and sparse decomposition -- Feature; data privacy -- iterative methods -- matrix decomposition -- sparse matrices; low‐rank components -- feature‐based trajectory privacy preserving -- sparse decomposition -- spatiotemporal structure -- partial structure -- global feature -- feature matrix -- privacy security -- mobile data -- sparseness feature; Electronics -- Periodicals; Electronics -- China -- Periodicals; Electronics; China; Periodicals; 621.38105
• DOI: 10.1049/cje.2018.04.015
• Languages: English
• ISSNs: 1022-4653

Abstract

Abstract : The disclosure of sensitive contents hidden in trajectories may jeopardize individuals' privacy security. The privacy preserving technologies on trajectories face the challenge of how to give consideration to the spatiotemporal structure of mobile data. Traditional trajectory privacy preserving tricks focus chiefly on partial structure, while ignoring global feature of trajectories. This research orientation tends to cause exorbitant distortion on the spatiotemporal structure of trajectories, which may give rise to low data utility. The moving behavior has itself innate sparseness feature. Thus a trajectory privacy preserving method based on feature maintaining is proposed by introducing the low‐rank and sparse decomposition technique about large matrix. The proposed method iteratively decompose the feature matrix until the rank achieving stability to extract the primary feature and eliminate the private parts. The released trajectories are reconstructed by perturbing the final refined feature matrix with a series of low‐rank components generated in the decomposition procedure. Experimental results on real‐world dataset verified that the proposed method has low information loss on large‐scale data.