Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a difficult task. Errors are introduced as the result of transcription errors, incomplete information, lack of standard formats, or any combination of these factors. In this paper, we present a thorough analysis of the literature on duplicate record detection. We cover similarity metrics that are commonly used to detect similar field entries, and we present an extensive set of duplicate detection algorithms that can detect approximately duplicate records in a database. We also cover multiple techniques for improving the efficiency and scalability of approximate duplicate detection algorithms. We conclude with coverage of existing tools and with a brief discussion of the big open problems in the area

We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.

Large repositories of data contain sensitive information that must be protected against unauthorized access. The protection of the confidentiality of this information has been a long-term goal for the database security research community and for the government statistical agencies. Recent advances in data mining and machine learning algorithms have increased the disclosure risks that one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. We investigate confidentiality issues of a broad category of rules, the association rules. In particular, we present three strategies and five algorithms for hiding a group of association rules, which is characterized as sensitive. One rule is characterized as sensitive if its disclosure risk is above a certain privacy threshold. Sometimes, sensitive rules should not be disclosed to the public since, among other things, they may be used for inferring sensitive data, or they may provide business competitors with an advantage. We also perform an evaluation study of the hiding algorithms in order to analyze their time complexity and the impact that they have in the original database.

Machine learning (ML) algorithms are increasingly applied in medical research and in healthcare, gradually improving clinical practice. Among various applications of these novel methods, their usage in the combat against antimicrobial resistance (AMR) is one of the most crucial areas of interest, as increasing resistance to antibiotics and management of difficult-to-treat multidrug-resistant infections are significant challenges for most countries worldwide, with life-threatening consequences. As antibiotic efficacy and treatment options decrease, the need for implementation of multimodal antibiotic stewardship programs is of utmost importance in order to restrict antibiotic misuse and prevent further aggravation of the AMR problem. Both supervised and unsupervised machine learning tools have been successfully used to predict early antibiotic resistance, and thus support clinicians in selecting appropriate therapy. In this paper, we reviewed the existing literature on machine learning and artificial intelligence (AI) in general in conjunction with antimicrobial resistance prediction. This is a narrative review, where we discuss the applications of ML methods in the field of AMR and their value as a complementary tool in the antibiotic stewardship practice, mainly from the clinician’s point of view.

Data mining technology has given us new capabilities to identify correlations in large data sets. This introduces risks when the data is to be made public, but the correlations are private. We introduce a method for selectively removing individual values from a database to prevent the discovery of a set of rules, while preserving the data for other applications. The efficacy and complexity of this method are discussed. We also present an experiment showing an example of this methodology.