Abstract In this era of big data, seamless distribution of healthcare information is crucial for improving patient care and advancing medical research, necessitating meticulous attention to preserving health data privacy. However, overly stringent protection measures can impede the efficient utilization of invaluable resources for medical research and personalized healthcare, posing a central challenge in balancing privacy protection with effective data utilization. This study aims to explore various methods used to protect the privacy of patients’ health records, and evaluates their advantages and limitations. Additionally, it conducts an in-depth analysis of a public medical dataset concerning privacy protection, assessing the effectiveness of k-anonymity and l-diversity privacy criteria and examining the influence of quasi-identifier (QID) attributes on privacy preservation. The study showcases techniques to achieve privacy standards, including generalization and suppression. Furthermore, it introduces a novel approach that utilizes the genetic algorithm (GA) and a non-dominated sorting technique to maximize both privacy and utility in health data through multi-objective optimization. After examining the results, this paper offers a guide for data owners on selecting attributes for medical data publication and choosing suitable privacy preservation strategies. Through the exploration of the GA and the non-dominated sorting approach, this paper suggests that the proposed GA can offer promising non-dominated solutions to the issue of health data privacy in the era of data-driven healthcare. A combination of these algorithms can enhance privacy protection and provide healthcare professionals and researchers with essential knowledge, ultimately benefiting patient care and ensuring a more secure database system.

Abstract The growing need for data publication and the escalating concerns regarding data privacy have led to a surge in interest in Privacy-Preserving Data Publishing (PPDP) across research, industry, and government sectors. Despite its significance, PPDP remains a challenging NP-hard problem, particularly when dealing with complex datasets, often rendering traditional traversal search methods inefficient. Evolutionary Algorithms (EAs) have emerged as a promising approach in response to this challenge, but their effectiveness, efficiency, and robustness in PPDP applications still need to be improved. This paper presents a novel Hierarchical Adaptive Evolution Framework (HAEF) that aims to optimizet-closeness anonymization through attribute generalization and record suppression using Genetic Algorithm (GA) and Differential Evolution (DE). To balance GA and DE, the first hierarchy of HAEF employs a GA-prioritized adaptive strategy enhancing exploration search. This combination aims to strike a balance between exploration and exploitation. The second hierarchy employs a random-prioritized adaptive strategy to select distinct mutation strategies, thus leveraging the advantages of various mutation strategies. Performance bencmark tests demonstrate the effectiveness and efficiency of the proposed technique. In 16 test instances, HAEF significantly outperforms traditional depth-first traversal search and exceeds the performance of previous state-of-the-art EAs on most datasets. In terms of overall performance, under the three privacy constraints tested, HAEF outperforms the conventional DFS search by an average of 47.78%, the state-of-the-art GA-based ID-DGA method by an average of 37.38%, and the hybrid GA-DE method by an average of 8.35% in TLEF. Furthermore, ablation experiments confirm the effectiveness of the various strategies within the framework. These findings enhance the efficiency of the data publishing process, ensuring privacy and security and maximizing data availability.

Abstract Knowledge graph, as an extension of graph data structure, is being used in a wide range of areas as it can store interrelated data and reveal interlinked relationships between different objects within a large system. This paper proposes an algorithm to construct an access control knowledge graph from user and resource attributes. Furthermore, an online learning framework for access control decision-making is proposed based on the constructed knowledge graph. Within the framework, we extract topological features to represent high cardinality categorical user and resource attributes. Experimental results show that topological features extracted from knowledge graph can improve the access control performance in both offline learning and online learning scenarios with different degrees of class imbalance status.

Diabetic eye disease (DED) is a cluster of eye problem that affects diabetic patients. Identifying DED is a crucial activity in retinal fundus images because early diagnosis and treatment can eventually minimize the risk of visual impairment. The retinal fundus image plays a significant role in early DED classification and identification. An accurate diagnostic model's development using a retinal fundus image depends highly on image quality and quantity. This paper presents a methodical study on the significance of image processing for DED classification. The proposed automated classification framework for DED was achieved in several steps: image quality enhancement, image segmentation (region of interest), image augmentation (geometric transformation), and classification. The optimal results were obtained using traditional image processing methods with a new build convolution neural network (CNN) architecture. The new built CNN combined with the traditional image processing approach presented the best performance with accuracy for DED classification problems. The results of the experiments conducted showed adequate accuracy, specificity, and sensitivity.