Sensitive association rules hiding using electromagnetic field optimization algorithm

•The proposed method hides sensitive rules using electromagnetic field optimization.•Several sensitive association rules are hided simultaneously in the method.•The proposed method also has fewer lost rules than other well-known algorithms.•Two fitness functions are proposed to find the solution wit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications 2018-12, Vol.114, p.155-172
Hauptverfasser: Talebi, Behnam, Dehkordi, Mohammad Naderi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•The proposed method hides sensitive rules using electromagnetic field optimization.•Several sensitive association rules are hided simultaneously in the method.•The proposed method also has fewer lost rules than other well-known algorithms.•Two fitness functions are proposed to find the solution with minimum side effects.•The method is evaluated on both real-world and synthetic datasets. Privacy preserving data mining has been a major research subject in recent years. The most important goal of this area is to protect personal information and prevent disclosure of this information during the data mining process. There are various techniques in the field of privacy preserving data mining. One of these techniques is association rules mining. The main purpose of association rules mining is to hide sensitive association rules. So far, various algorithms have been presented to this field in order to reach the purpose of sensitive association rules hiding. Each algorithm has its own specific functions and methods. To hide sensitive association rules, this paper presents an electromagnetic field optimization algorithm (EFO4ARH). This algorithm utilizes the data distortion technique to hide the sensitive association rules. In this algorithm, two fitness functions are used to reach the solution with the least side effects. Also, in this algorithm, the runtime has been reduced. This algorithm consists of a technique for exiting from local optima point and moving toward global optimal points. The performance of the proposed algorithm is evaluated by doing experiments on both real-world and synthetic datasets. Compared to four reference algorithms, the proposed algorithm shows a reduction in the side effects and better preservation of data quality. The performance of EFO4ARH is tested by standard deviation and mean Friedman ranks of error for standard functions (CEC benchmarks). In addition, hiding experiments show that our proposed algorithm outperforms existing hiding algorithms.
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2018.07.031