Mapping of nearest neighbor for classification

Dimension reduction of data is an important theme in the data processing and on the web to represent and manipulate higher dimensional data. Reduct in the rough set is a minimal subset of features, which has almost the same discernible power as the entire features in the higher dimensional scheme. But, there are problems in the application of reducts for classification. Here, we develop a method which connects reducts and the nearest neighbor method to classify data with higher classification accuracy. To improve the classification ability of reducts, we develop a new graph mapping method of the nearest neighbor based on reducts and weighted modified reducts for the classification with higher accuracy. Then, the mapping method is useful and the weighted modified reduct classifies with higher accuracy.

[1]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[2]  Andrzej Skowron,et al.  Decision Algorithms: A Survey of Rough Set - Theoretic Methods , 1997, Fundam. Informaticae.

[3]  Naohiro Ishii,et al.  Modified Reduct: Nearest Neighbor Classification , 2012, 2012 IEEE/ACIS 11th International Conference on Computer and Information Science.

[4]  Z. Pawlak,et al.  Rough set approach to multi-attribute decision analysis , 1994 .

[5]  Naohiro Ishii,et al.  Control of Variables in Reducts - kNN Classification with Confidence , 2011, KES.

[6]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.