Title: Hiding critical transactions using a modified un-realisation approach

Authors: T. Satyanarayana Murthy; N.P. Gopalan; T.R. Athira

Addresses: Department of Computer Applications, National Institute of Technology, Tiruchirapalli, India ' Department of Computer Applications, National Institute of Technology, Tiruchirapalli, India ' Department of Computer Science and Engineering, National Institute of Technology, Puducherry, India

Abstract: Huge amount of data generated from the hospitals, social media sites and online departmental stores contains sensitive data. Nowadays finding association rules among these data may lead to privacy issues, in turn to leakage of sensitive information that may reveal the facts about an individual. In this paper an algorithm is proposed for hiding the sensitive association rules by minimising the ghost rules and lost rules. This maximum association rule (MAR) hiding performs better than GA and PSO algorithms. These traditional algorithms may lack in hiding the association rules due to its computational complexity, hiding failure, lost rules and ghost rules. The performance of this approach has been improved by using a modified un-realisation algorithm for hiding the sensitive association rules.

Keywords: association rule hiding; hiding failure; lost rule; ghost rule.

DOI: 10.1504/IJEB.2020.109071

International Journal of Electronic Business, 2020 Vol.15 No.3, pp.223 - 234

Accepted: 16 Mar 2019
Published online: 13 Aug 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article