Representative frequent pattern mining from a transaction dataset has been well studied in both the database and the data mining community for many years. One popular scenario is that if the input dataset contains private information, publishing representative patterns may pose great threats to individual’s privacy. In this paper, we study the subject of mining representative patterns under the differential privacy model. We propose a method that combines RPlocal with differential privacy to mine representative patterns. We analyze the breach of privacy in RPlocal, and utilize the differential privacy to protect the private information of transaction dataset. Through formal privacy analysis, we prove that our proposed algorithm satisfies ε -differential privacy. Extensive experimental results on real datasets reveal that our algorithm produces similar number of representative patterns compared to RPlocal.
CITATION STYLE
Ding, X., Chen, L., & Jin, H. (2017). Mining representative patterns under differential privacy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10570 LNCS, pp. 295–302). Springer Verlag. https://doi.org/10.1007/978-3-319-68786-5_23
Mendeley helps you to discover research relevant for your work.