Conservative Noise Filters

Noisy training data have a huge negative impact on machine learning algorithms. Noise-filtering algorithms have been proposed to eliminate such noisy instances. In this work, we empirically show that the most popular noise-filtering algorithms have a large False Positive (FP) error rate. In other words, these noise filters mistakenly identify genuine instances as outliers and eliminate them. Therefore, we propose more conservative outlier identification criteria that improve the FP error rate and, thus, the performance of the noise filters. With the new filter, an instance is eliminated if and only if it is misclassified by a mutual decision of Naïve Bayesian (NB) classifier and the original filtering criteria being used. The number of genuine instances that are incorrectly eliminated is reduced as a result, thereby improving the classification accuracy.

@article{M.Jamjoom2016,
  title     = {Conservative Noise Filters},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {5},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Mona M.Jamjoom and Khalil El Hindi},
  doi       = {10.14569/IJACSA.2016.070548},
  url       = {https://doi.org/10.14569/IJACSA.2016.070548}
}