Particle Swarm Intelligence and Impact Factor-Based Privacy Preserving Association Rule Mining for Balancing Data Utility and Knowledge Privacy

被引:0
作者
G. Kalyani
M. V. P. Chandra Sekhara Rao
B. Janakiramaiah
机构
[1] Acharya Nagarjuna University,Department of Computer Science and Engineering
[2] RVR & JC College of Engineering,Department of Computer Science and Engineering
[3] Prasad V. Potluri Siddhartha Institute of Technology,Department of Computer Science and Engineering
来源
Arabian Journal for Science and Engineering | 2018年 / 43卷
关键词
Data sharing; Association rules; Sanitization; Optimization; PSO; Computational intelligence; Sensitive knowledge;
D O I
暂无
中图分类号
学科分类号
摘要
Organizations generally prefer data or knowledge sharing with others to obtain mutual benefits. The major issue in sharing the data or knowledge is data owners privacy requirements. Privacy preserving association rule mining is an area in which data owner can protect private association rules (sensitive knowledge) from disclosure while sharing the data. To safeguard sensitive association rules, individual data values of a database must be altered. Therefore, privacy concerns must not compromise data utility. A methodology that optimally selects and alters the transactions of the database is required to balance privacy and utility. Particle swarm optimization is a meta-heuristic technique used for optimization. Hence, an approach with particle swarm intelligence is developed to select a set of database transactions for alterations to minimize the number of non-sensitive association rules that are lost and to maintain high utility of the sanitized database without compromising on privacy concerns. The projected method for hiding association rules was assessed based on some performance parameters including utility of the transformed database. Experiments have revealed that the proposed method accomplished a good balance between privacy and utility by minimizing difference between original and transformed databases.
引用
收藏
页码:4161 / 4178
页数:17
相关论文
共 74 条
  • [1] Verykios VS(2004)Association rule hiding IEEE Trans. Knowl. Data Eng. 16 434-447
  • [2] Elmagarmid AK(2013)Association rule hiding in risk management for retail supply chain collaboration Comput. Ind. 64 776-784
  • [3] Bertino E(2016)A framework for categorizing and applying privacy-preservation techniques in big data mining Computer 49 54-62
  • [4] Saygin Y(2015)Privacy or utility in data collection? a contract theoretic approach IEEE J. Sel. Top. Signal Process. 9 1256-1269
  • [5] Dasseni E(2017)Dynamic privacy pricing: a multi-armed bandit approach with time-variant rewards IEEE Trans. Inf. Forensics Secur. 12 271-285
  • [6] Le HQ(2014)A random decision tree framework for privacy-preserving data mining IEEE Trans. Dependable Secur. Comput. 11 399-411
  • [7] Arch-Int S(2014)A graph-based ant colony optimization for association rule mining Arab. J. Sci. Eng. 39 4651-4665
  • [8] Nguyen HX(2015)FPS-tree algorithm to find top- Arab. J. Sci. Eng. 40 3507-3521
  • [9] Arch-Int N(2017) closed itemsets in data streams J. Big Data 4 4-18
  • [10] Xu L(2017)Scalable two-phase co-occurring sensitive pattern hiding using mapreduce Prog. Artif. Intell. 6 1-4672