2012
DOI: 10.5121/ijaia.2012.3207
|View full text |Cite
|
Sign up to set email alerts
|

Hiding Sensitive Association Rules Without Altering the Support of Sensitive Item(S)

Abstract: Association rule mining is an important data-mining technique that finds interesting association among a large set of data items. Since it may disclose patterns and various kinds of sensitive knowledge that are difficult to find otherwise, it may pose a threat to the privacy of discovered confidential information. Such information is to be protected against unauthorized access. Many strategies had been proposed to hide the information. Some use distributed databases over several sites, data perturbation, clust… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
18
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(18 citation statements)
references
References 12 publications
0
18
0
Order By: Relevance
“…Jain et al explore the data mining in privacy preservation in which the knowledge discovery process of finding the useful information and patterns out of large database [19]. In recent times data mining has gained immense importance as it paves way for the management to obtain hidden information and use them in decision-making for exposing it for the betterment of web mining.…”
Section: Literature Surveymentioning
confidence: 99%
“…Jain et al explore the data mining in privacy preservation in which the knowledge discovery process of finding the useful information and patterns out of large database [19]. In recent times data mining has gained immense importance as it paves way for the management to obtain hidden information and use them in decision-making for exposing it for the betterment of web mining.…”
Section: Literature Surveymentioning
confidence: 99%
“…In 2012, D. Jain et al [16], introduced an algorithm to hide sensitive association rules without changing the support of frequent itemsets. This algorithm used a new concept named Representative Rule RR, where all sensitive rules can be inferred without any access to the main database.…”
Section: Introductionmentioning
confidence: 99%
“…Readers looking for more information regarding these approaches can refer to [9]. At recent, many works have been focused on mining association rules at a single concept level [2], [7], [10], [11]. There are applications which need to find associations at multiple concept levels.…”
Section: Introductionmentioning
confidence: 99%