Optimizing association rule hiding using combination of border and heuristic approaches

Optimizing association rule hiding using combination of border and heuristic approaches Data sanitization process transforms the original database into a modified database to protect the disclosure of sensitive knowledge by reducing the confidence/support of patterns. This process produces side-effects on the sanitized database, where some non-sensitive patterns are lost or new patterns are produced. Recently, a number of approaches have been proposed to minimize these side-effects by selecting appropriate transactions/items for sanitization. The heuristic approach is applied to hide sensitive patterns both in association rules and in frequent itemsets. On the other hand, the border, exact, and evolutionary approaches have only been designed to hide frequent itemsets. In this paper, a new hybrid algorithm, called Decrease the Confidence of Rule (DCR), proposed to improve a border-based solution, namely MaxMin, using two heuristics to hide the association rules. To achieve this, first, a heuristic was formulated in combination with MaxMin solution to select victim items in order to control the impact of sanitization process on result quality. Then, the victim items were removed from transactions with the shortest length. Some experiments have been conducted on the four real datasets to compare performance of DCR with the Association Rule Hiding based on Intersection Lattice (ARHIL) algorithm. The experimental results showed that the proposed algorithm yielded fewer side-effects than ARHIL algorithm. In addition, its efficiency was better than the heuristic approach. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Intelligence Springer Journals

Optimizing association rule hiding using combination of border and heuristic approaches

Loading next page...
 
/lp/springer_journal/optimizing-association-rule-hiding-using-combination-of-border-and-Y0NM3IUP1S
Publisher
Springer US
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mechanical Engineering; Manufacturing, Machines, Tools
ISSN
0924-669X
eISSN
1573-7497
D.O.I.
10.1007/s10489-017-0906-3
Publisher site
See Article on Publisher Site

Abstract

Data sanitization process transforms the original database into a modified database to protect the disclosure of sensitive knowledge by reducing the confidence/support of patterns. This process produces side-effects on the sanitized database, where some non-sensitive patterns are lost or new patterns are produced. Recently, a number of approaches have been proposed to minimize these side-effects by selecting appropriate transactions/items for sanitization. The heuristic approach is applied to hide sensitive patterns both in association rules and in frequent itemsets. On the other hand, the border, exact, and evolutionary approaches have only been designed to hide frequent itemsets. In this paper, a new hybrid algorithm, called Decrease the Confidence of Rule (DCR), proposed to improve a border-based solution, namely MaxMin, using two heuristics to hide the association rules. To achieve this, first, a heuristic was formulated in combination with MaxMin solution to select victim items in order to control the impact of sanitization process on result quality. Then, the victim items were removed from transactions with the shortest length. Some experiments have been conducted on the four real datasets to compare performance of DCR with the Association Rule Hiding based on Intersection Lattice (ARHIL) algorithm. The experimental results showed that the proposed algorithm yielded fewer side-effects than ARHIL algorithm. In addition, its efficiency was better than the heuristic approach.

Journal

Applied IntelligenceSpringer Journals

Published: Apr 12, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off