The Community for Technology Leaders
2012 IEEE 24th International Conference on Tools with Artificial Intelligence (2004)
Boca Raton, Florida
Nov. 15, 2004 to Nov. 17, 2004
ISSN: 1082-3409
ISBN: 0-7695-2236-X
pp: 373-378
Taghi M. Khoshgoftaar , Florida Atlantic University
Wei Tang , Florida Atlantic University
ABSTRACT
The presence of noise in a measurement dataset can have a negative effect on the classification model built. More specifically, the noisy instances in the dataset can adversely affect the learnt hypothesis. Removal of noisy instances will improve the learnt hypothesis; thus, improving the classification accuracy of the model. A clustering-based noise detection approach using the k-means algorithm is presented. We present a new metric for measuring the potentiality (noise factor) of an instance being noisy. Based on the computed noise factor values of the instances, the clustering-based algorithm is then used to identify and eliminate p% of the instances in the dataset. These p% of instances are considered the most likely to be noisy among the instances in the dataset — the p% value is varied from 1% to 40%. THe noise detection approach is investigated with respect to two case studies of software measurement data obtained from NASA software projects. The two datasets are characterized by the same thirteen software metrics and a class labled that classifies the program modules as a fault-prone and not fault-prone. It is shown that as more noisy instances are removed, classification accuracy of the C4.5 learner improves. This indicates that the removed instances are most likely noisy instances that attributed to poor classification accuracy.
INDEX TERMS
data noise, outliers, software quality estimation, software metrics, k-means, clustering
CITATION
Taghi M. Khoshgoftaar, Wei Tang, "Noise Identification with the k-Means Algorithm", 2012 IEEE 24th International Conference on Tools with Artificial Intelligence, vol. 00, no. , pp. 373-378, 2004, doi:10.1109/ICTAI.2004.93
99 ms
(Ver 3.3 (11022016))