Download:
by Xintao Wu, Ying Wu, Yongge Wang
Proc. of the 5th SIAM Int’l Conf. on Data Mining. Newport Beach: SIAM
http://www.cs.uncc.edu/~xwu/privacy/WuX.pdf
Add To MetaCart
Abstract:
Association rule mining has received a lot of attention in the data mining community and several algorithms were proposed to improve the performance of association rule or frequent itemset mining. The IBM Almaden synthetic data generator has been commonly used for performance evaluation. One recent work shows that the data generated is not good enough for benchmarking as it has very different characteristics from real-world data sets. Hence there is a great need to use real-world data sets as benchmarks. However, organizations hesitate to provide their data due to privacy concerns. Recent work on privacy preserving association rule mining addresses this issue by modifying real data sets to hide sensitive or private rules. However, modifying individual values in real data may impact on other, non-sensitive rules. In this paper, we propose a feasible solution to the NPcomplete problem of inverse frequent set mining. Since solving this problem by linear programming techniques is very computationally prohibitive, we apply graph-theoretical results to divide the original itemsets into components that preserve maximum likelihood estimation. We then use iterative proportional fitting method to each component. The technique is experimentally evaluated with two real data sets and one synthetic data set. The results show that our approach is effective and efficient for reconstructing market basket data set from a given set of frequent itemsets while preserving sensitive information. 1
Citations
|
1556
|
Mining association rules between sets of items in large databases
– Agrawal, Imielinski, et al.
- 1993
|
|
583
|
Graphical Models
– Lauritzen
- 1996
|
|
155
|
Privacy preserving mining of association rules
– Evfimievski, Srikant, et al.
- 2002
|
|
128
|
Limiting Privacy Breaches in Privacy Preserving Data Mining
– Evfimievski, Gehrke, et al.
- 2003
|
|
94
|
Real World Performance of Association Rule Algorithms
– Zheng, Kohavi, et al.
- 2001
|
|
82
|
Maintaining data privacy in association rule mining
– Rizvi, Haritsa
- 2002
|
|
62
|
Decomposition by clique separators
– Tarjan
- 1985
|
|
53
|
Disclosure Limitation of Sensitive Rules
– Atallah, Bertino, et al.
- 1999
|
|
38
|
Using Unknowns to Prevent Discovery of Association Rules
– Saygin, Verykios, et al.
- 2001
|
|
33
|
Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
– Dobra, Fienberg
- 2000
|
|
27
|
Hiding Association Rules by Using Confidence and Support
– Dasseni, Verykios, et al.
- 2001
|
|
24
|
An Environment for Graphical Models
– Badsberg
- 1995
|
|
18
|
Graphical Models in Applied Mathematical Multivariate Statistics
– Whittaker
- 1990
|
|
15
|
On inverse frequent set mining
– Mielikäinen
- 2003
|
|
12
|
Computational complexity of itemset frequency satisfiability
– Calders
- 2004
|
|
12
|
Protecting Sensitive Knowledge By Data Sanitization
– Oliveira, Zaiane
- 2003
|
|
11
|
Bounds for cell entries in contingency tables induced by fixed marginal totals with applications to disclosure limitation
– Dobra, Fienberg
- 2001
|
|
11
|
Feasible itemset distributions in data mining: Theory and application
– Ramesh, Maniatty, et al.
- 2003
|
|
9
|
Screening and interpreting multi-item associations based on log-linear modeling
– Wu, Barbará, et al.
- 2003
|
|
6
|
Privacy preserving database application testing
– Wu, Wang, et al.
- 2003
|
|
2
|
Categorical data anlysis
– Agresti
- 1990
|
