Volume 2, Issue 1, January 2014, Pages 1 - 10
Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation
Naohiro Ishii, Ippei Torii, Toyoshiro Nakashima, Hidekazu Tanaka
Received 20 February 2013, Accepted 14 November 2013, Available Online 1 January 2014.
- https://doi.org/10.2991/ijndc.2014.2.1.1How to use a DOI?
- classification; reduct generation; mapping of reducts; multi- reducts; nearest neighbor relation; embedding of nearest neighbor
- Dimension reduction of data is an important theme in the data processing to represent and manipulate higher dimensional data. Rough set is fundamental and useful to process 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. Combination of multi-reducts is effective for parallel processing of the classification. Nearest neighbor relation between different classes has a basic information for classification. We propose here a multi-reduct parallel processing classification scheme with efficient and higher accuracy by using nearest neighbor relation. To improve the classification ability of reducts, we develop a generation method of reducts and its graph mapping method by using the nearest neighbor relation, which is based on characteristics of the weighted reducts for the classification. Further, a dependency relation and an embedding of nearest neighbor relation are proposed to improve the classification accuracy.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - JOUR AU - Naohiro Ishii AU - Ippei Torii AU - Toyoshiro Nakashima AU - Hidekazu Tanaka PY - 2014 DA - 2014/01 TI - Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation JO - International Journal of Networked and Distributed Computing SP - 1 EP - 10 VL - 2 IS - 1 SN - 2211-7946 UR - https://doi.org/10.2991/ijndc.2014.2.1.1 DO - https://doi.org/10.2991/ijndc.2014.2.1.1 ID - Ishii2014 ER -