Association rule hiding based on intersection lattice

DOI10.1155/2013/210405MaRDI QIDQ460294zbMATH OpenOpenAlexWikidataFDO

Authors Hai Quoc Le, Somjit Arch-Int, Ngamnij Arch-Int

Publication date 13 October 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/210405

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Review text

Summary: Association rule hiding has been playing a vital role in sensitive knowledge preservation when sharing data between enterprises. The aim of association rule hiding is to remove sensitive association rules from the released database such that side effects are reduced as low as possible. This research proposes an efficient algorithm for hiding a specified set of sensitive association rules based on intersection lattice of frequent itemsets. In this research, we begin by analyzing the theory of the intersection lattice of frequent itemsets and the applicability of this theory into association rule hiding problem. We then formulate two heuristics in order to (a) specify the victim items based on the characteristics of the intersection lattice of frequent itemsets and (b) identify transactions for data sanitization based on the weight of transactions. Next, we propose a new algorithm for hiding a specific set of sensitive association rules with minimum side effects and low complexity. Finally, experiments were carried out to clarify the efficiency of the proposed approach. Our results showed that the proposed algorithm, AARHIL, achieved minimum side effects and CPU-Time when compared to current similar state of the art approaches in the context of hiding a specified set of sensitive association rules.

Recommendations

• scientific article; zbMATH DE number 1893226
• Associating rule hiding for data mining.

Cites work

• A tutorial on nonlinear time-series data mining in engineering asset health and reliability prediction: concepts, models, and algorithms
• Assessment of landslide susceptibility by decision trees in the metropolitan area of Istanbul, Turkey
• Associating rule hiding for data mining.
• Association rule hiding based on intersection lattice
• Association rule mining. Models and algorithms
• On the algorithmic construction of the 1960 sectional complement

Cited in

(6)

• A two-stage integer programming model considering transaction equivalence for privacy preservation
• Minimizing information loss and preserving privacy
• Sample size-based knowledge hiding in databases
• Association rule hiding based on intersection lattice
• scientific article; zbMATH DE number 1893226 (Why is no real title available?)
• Associating rule hiding for data mining.

This page was built for publication: Association rule hiding based on intersection lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460294)