Privacy Preserving Mining Sequential Pattern based on Random Data Perturbation

Author(s):  
Weimin Ouyang
2005 ◽  
Vol 7 (4) ◽  
pp. 387-414 ◽  
Author(s):  
Hillol Kargupta ◽  
Souptik Datta ◽  
Qi Wang ◽  
Krishnamoorthy Sivakumar

2012 ◽  
Vol 4 ◽  
pp. 350-354 ◽  
Author(s):  
Mary A. Geetha ◽  
N.Ch.S.N. Iyengar

2011 ◽  
Vol 130-134 ◽  
pp. 2629-2632
Author(s):  
Jie Liu ◽  
Tian Qi Li ◽  
Jian Pei Zhang

Multi-parameters data perturbation method is a kind of original data perturbation methods for privacy preserving association rules mining. However, the time-efficiency of restoring the frequent itemsets in multi-parameters perturbation algorithm is still not high.One method is proposed in this paper to improve the time efficiency of multi-parameters randomized perturbation algorithm according to the characteristics of the model to restore frequent itemsets. The method improves the time efficiency by getting the elements of the first line of the inversed matrix of transformation matrix. Finally, both theoretical analysis and experimental results show that the improved algorithm is more time-efficient and space-efficient than the original algorithm.


Sign in / Sign up

Export Citation Format

Share Document