Hiding co-occurring sensitive patterns in progressive databases

Authors:
Amruta Mhatre;Durga Toshniwal
Affiliations:
Indian Institute of Techniology, Roorkee, Uttarakhand, India;Indian Institute of Techniology, Roorkee, Uttarakhand, India
Venue:
Proceedings of the 2010 EDBT/ICDT Workshops
Year:
2010

Citing 6
Cited 1

Security-control methods for statistical databases: a comparative study

ACM Computing Surveys (CSUR)
Data mining: concepts and techniques

Data mining: concepts and techniques
Association Rule Hiding

IEEE Transactions on Knowledge and Data Engineering
State-of-the-art in privacy preserving data mining

ACM SIGMOD Record
A General Model for Sequential Pattern Mining with a Progressive Database

IEEE Transactions on Knowledge and Data Engineering
Hiding co-occurring frequent itemsets

Proceedings of the 2009 EDBT/ICDT Workshops

Hiding co-occurring prioritized sensitive patterns over distributed progressive sequential data streams

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

These days lot of work is been carried out in the field of privacy preserving data mining. Apart from the standard techniques of privacy preservation, methods are being proposed specific to the data mining tasks carried out. However most of these methods work on static databases. One such a method is downgrading application effectiveness. The effectiveness of applications may be downgraded by hiding sensitive association rules, hiding sensitive sets of patterns etc. Sometimes although a particular pattern is not interesting, its co-occurrence with another pattern may reveal certain sensitive information. In this paper we present a novel technique to hide sensitive co-occurring sequential patterns. The proposed method works on progressive databases. Progressive databases are a generalized model of static, dynamic and incremental databases. The applicability of the method is also extended to suit these different types of databases.