PAACDA: Comprehensive Data Corruption Detection Algorithm

With technological advancements, data and its analysis have evolved beyond simple values and attributes scattered across spreadsheets, becoming a powerful catalyst for transformation across numerous fields.However, data corruption, often stemming from unethical or illegal activities, has emerged as a serious challenge, highlighting the urgent need for effective methods to detect and clearly identify corrupted data within datasets.Identifying and recovering corrupted data is a complex task that demands significant attention, as overlooking it during early stages can lead to major complications in subsequent machine learning or deep learning processes.In this work, we introduce PAACDA (Proximity-based Adamic Adar Corruption Detection Algorithm) and present consolidated results with a specific emphasis on detecting corrupted data rather than merely identifying outliers.Existing state-of-the-art models like Isolation Forest and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) depend heavily on meticulous parameter tuning to achieve high accuracy and recall; nevertheless, they still exhibit considerable uncertainty when it comes to handling corrupted data.The present study focuses on addressing niche performance limitations of various unsupervised learning algorithms when applied to both linear and clustered corrupted datasets.

Authors

Publication Details

Journal
International Journal of Research Publication and Reviews
Published
2025-05-01
DOI
https://doi.org/10.55248/gengpi.6.0525.18111
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PAACDA: Comprehensive Data Corruption Detection Algorithm

P. Venkatesh, M Poojitha
International Journal of Research Publication and Reviews
Privacy-Preserving Technologies in Data
article

PAACDA: Comprehensive Data Corruption Detection Algorithm

P. Venkatesh, M Poojitha
article en

Abstract

With technological advancements, data and its analysis have evolved beyond simple values and attributes scattered across spreadsheets, becoming a powerful catalyst for transformation across numerous fields.However, data corruption, often stemming from unethical or illegal activities, has emerged as a serious challenge, highlighting the urgent need for effective methods to detect and clearly identify corrupted data within datasets.Identifying and recovering corrupted data is a complex task that demands significant attention, as overlooking it during early stages can lead to major complications in subsequent machine learning or deep learning processes.In this work, we introduce PAACDA (Proximity-based Adamic Adar Corruption Detection Algorithm) and present consolidated results with a specific emphasis on detecting corrupted data rather than merely identifying outliers.Existing state-of-the-art models like Isolation Forest and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) depend heavily on meticulous parameter tuning to achieve high accuracy and recall; nevertheless, they still exhibit considerable uncertainty when it comes to handling corrupted data.The present study focuses on addressing niche performance limitations of various unsupervised learning algorithms when applied to both linear and clustered corrupted datasets.

International Journal of Research Publication and ReviewsVol. 6(5)
Peace, Justice and strong institutions
Openalex Percentile: Top 94%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.