Noisy data elimination using mutual k-nearest neighbor for classification mining

Journal of Systems and Software - Tập 85 - Trang 1067-1074 - 2012
Huawen Liu1,2, Shichao Zhang3,4
1Department of Computer Science, Zhejiang Normal University, China
2Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education, China
3College of Computer Science and Information Technology, Guangxi Normal University, China
4Faculty of Engineering and Information Technology,, University of Technology, Sydney, Australia

Tài liệu tham khảo

Asuncion, 2007

Chapman, A.D., (2005). Principles and Methods of Data Cleaning-Primary Species and Species-Occurrence Data, version 1.0. Report for the Global Biodiversity Information Facility, Copenhagen.

Cohen, 1995, Fast effective rule induction, 115

Ding, 2004, K-nearest-neighbor consistency in data clustering: incorporating local information into global optimization, 584

Duda, 2001

Fayed, 2009, A novel template reduction approach for the k-nearest neighbor method, IEEE Transactions on Neural Networks, 20, 890, 10.1109/TNN.2009.2018547

Gowda, 1979, The condensed nearest neighbor rule using the concept of mutual nearest neighborhood, IEEE Transactions on Information Theory, 25, 488, 10.1109/TIT.1979.1056066

Liu, 2009, Feature selection with dynamic mutual information, Pattern Recognition, 42, 1330, 10.1016/j.patcog.2008.10.028

Marchiori, 2010, Class conditional nearest neighbor for large margin instance selection, IEEE Transactions on Pattern Analysis and Machine Intelligence, 32, 364, 10.1109/TPAMI.2009.164

Pyle, 1999

Witten, 2005

Yang, 2006, 10 challenging problems in data mining research, International Journal of Information Technology and Decision Making, 5, 597, 10.1142/S0219622006002258

Zollanvari, 2010, Joint sampling distribution between actual and estimated classification errors for linear discriminant analysis, IEEE Transactions on Information Theory, 56, 784, 10.1109/TIT.2009.2037034