Comprehensive Data Corruption Identification Using Machine Learning Algorithms (PAACDA)

Abstract

Data and analysis have evolved from being scattered numbers and qualities in spreadsheets to being seen as a means to revolutionize any substantial industry, thanks to the rise of technology. There are many unethical and unlawful ways that data may get corrupted, thus it's important to find a way to effectively detect and highlight all the corrupted data in the dataset. It is not an easy task to detect damaged data or to restore information from a corrupted dataset. This is crucial and could cause issues with data processing using machines or deep learning methods later on if not handled early enough. Rather than focusing on outlier identification, this study introduces its PAACDA: Presence driven Adamic Adar Corruption identification Algorithm and then consolidates the findings. Even though they rely on parameter tuning to achieve high accuracy and remember, current state-of-the-art models like Isolation forest and DBSCAN (which stands for "Density-Based the spatial the process of clustering of the applications with Noise") have a lot of uncertainty when they factor in corrupted data. This study investigates the specific performance problems with several unsupervised learning methods on corrupted linear and clustered datasets. In addition, we provide a new PAACDA technique that achieves a higher precision of 96.35% for cluster data and 99.04% for linear data compared to previous unsupervised training benchmarks on 15 prominent baselines, including as К-means clustering, Isolation forest, and LOF (Local Outlier Factor). From the aforementioned angles, this essay delves deeply into the relevant literature as well. In this study, we identify all the problems with current methods and suggest ways forward for research in this area.