A sanitization approach for hiding sensitive itemsets based on particle swarm optimization

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86098018" target="_blank" >RIV/61989100:27240/16:86098018 - isvavai.cz</a>

Result on the web

<a href="http://www.sciencedirect.com/science/article/pii/S0952197616300653" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0952197616300653</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.engappai.2016.03.007" target="_blank" >10.1016/j.engappai.2016.03.007</a>

Result language

angličtina

Original language name

A sanitization approach for hiding sensitive itemsets based on particle swarm optimization

Original language description

Privacy-preserving data mining (PPDM) has become an important research field in recent years, as approaches for PPDM can discover important information in databases, while ensuring that sensitive information is not revealed. Several algorithms have been proposed to hide sensitive information in databases. They apply addition and deletion operations to perturb an original database and hide the sensitive information. Finding an appropriate set of transactions/itemsets to be perturbed for hiding sensitive information while preserving other important information is a NP-hard problem. In the past, genetic algorithm (GA)-based approaches were developed to hide sensitive itemsets in an original database through transaction deletion. In this paper, a particle swarm optimization (PSO)-based algorithm called PSO2DT is developed to hide sensitive itemsets while minimizing the side effects of the sanitization process. Each particle in the designed PSO2DT algorithm represents a set of transactions to be deleted. Particles are evaluated using a fitness function that is designed to minimize the side effects of sanitization. The proposed algorithm can also determine the maximum number of transactions to be deleted for efficiently hiding sensitive itemsets, unlike the state-of-the-art GA -based approaches. Besides, an important strength of the proposed approach is that few parameters need to be set, and it can still find better solutions to the sanitization problem than GA -based approaches. Furthermore, the pre-large concept is also adopted in the designed algorithm to speed up the evolution process. Substantial experiments on both real-world and synthetic datasets show that the proposed PSO2DT algorithm performs better than the Greedy algorithm and GA -based algorithms in terms of runtime, fail to be hidden (F-T-H), not to be hidden (N-T-H), and database similarity (DS).

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE

ISSN

0952-1976

e-ISSN

—

Volume of the periodical

53

Issue of the periodical within the volume

AUGUST

Country of publishing house

GB - UNITED KINGDOM

Number of pages

18

Pages from-to

1-18

UT code for WoS article

000378180800001

EID of the result in the Scopus database

2-s2.0-84964000598