Open Access iconOpen Access

ARTICLE

crossmark

An Adaptive Privacy Preserving Framework for Distributed Association Rule Mining in Healthcare Databases

Hasanien K. Kuba1, Mustafa A. Azzawi2, Saad M. Darwish3,*, Oday A. Hassen4, Ansam A. Abdulhussein5

1 University of Information Technology and Communication (UOITC), Baghdad, 10081, Iraq
2 Accenture, Ling Karan TRX, Kuala Lumpur, 55188, Malaysia
3 Department of Information Technology, Institute of Graduate Studies and Research, University of Alexandria, 21526, Egypt
4 Ministry of Education, Wasit Education Directorate, Kut, 52001, Iraq
5 Information Technology Center, Iraqi Commission for Computers and Informatics, Baghdad, 10081, Iraq

* Corresponding Author: Saad M. Darwish. Email: email

Computers, Materials & Continua 2023, 74(2), 4119-4133. https://doi.org/10.32604/cmc.2023.033182

Abstract

It is crucial, while using healthcare data, to assess the advantages of data privacy against the possible drawbacks. Data from several sources must be combined for use in many data mining applications. The medical practitioner may use the results of association rule mining performed on this aggregated data to better personalize patient care and implement preventive measures. Historically, numerous heuristics (e.g., greedy search) and metaheuristics-based techniques (e.g., evolutionary algorithm) have been created for the positive association rule in privacy preserving data mining (PPDM). When it comes to connecting seemingly unrelated diseases and drugs, negative association rules may be more informative than their positive counterparts. It is well-known that during negative association rules mining, a large number of uninteresting rules are formed, making this a difficult problem to tackle. In this research, we offer an adaptive method for negative association rule mining in vertically partitioned healthcare datasets that respects users’ privacy. The applied approach dynamically determines the transactions to be interrupted for information hiding, as opposed to predefining them. This study introduces a novel method for addressing the problem of negative association rules in healthcare data mining, one that is based on the Tabu-genetic optimization paradigm. Tabu search is advantageous since it removes a huge number of unnecessary rules and item sets. Experiments using benchmark healthcare datasets prove that the discussed scheme outperforms state-of-the-art solutions in terms of decreasing side effects and data distortions, as measured by the indicator of hiding failure.

Keywords


Cite This Article

APA Style
Kuba, H.K., Azzawi, M.A., Darwish, S.M., Hassen, O.A., Abdulhussein, A.A. (2023). An adaptive privacy preserving framework for distributed association rule mining in healthcare databases. Computers, Materials & Continua, 74(2), 4119-4133. https://doi.org/10.32604/cmc.2023.033182
Vancouver Style
Kuba HK, Azzawi MA, Darwish SM, Hassen OA, Abdulhussein AA. An adaptive privacy preserving framework for distributed association rule mining in healthcare databases. Comput Mater Contin. 2023;74(2):4119-4133 https://doi.org/10.32604/cmc.2023.033182
IEEE Style
H.K. Kuba, M.A. Azzawi, S.M. Darwish, O.A. Hassen, and A.A. Abdulhussein "An Adaptive Privacy Preserving Framework for Distributed Association Rule Mining in Healthcare Databases," Comput. Mater. Contin., vol. 74, no. 2, pp. 4119-4133. 2023. https://doi.org/10.32604/cmc.2023.033182



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 773

    View

  • 443

    Download

  • 6

    Like

Share Link