Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation
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 a...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2014-01-01
|
| Series: | International Journal of Networked and Distributed Computing (IJNDC) |
| Subjects: | |
| Online Access: | https://www.atlantis-press.com/article/10860.pdf |
| _version_ | 1797712600946966528 |
|---|---|
| author | Naohiro Ishii Ippei Torii Toyoshiro Nakashima Hidekazu Tanaka |
| author_facet | Naohiro Ishii Ippei Torii Toyoshiro Nakashima Hidekazu Tanaka |
| author_sort | Naohiro Ishii |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T07:24:10Z |
| format | Article |
| id | doaj.art-59fbe98acde44bf78f209d1b8052ca23 |
| institution | Directory Open Access Journal |
| issn | 2211-7946 |
| language | English |
| last_indexed | 2024-03-12T07:24:10Z |
| publishDate | 2014-01-01 |
| publisher | Springer |
| record_format | Article |
| series | International Journal of Networked and Distributed Computing (IJNDC) |
| spelling | doaj.art-59fbe98acde44bf78f209d1b8052ca232023-09-02T22:14:55ZengSpringerInternational Journal of Networked and Distributed Computing (IJNDC)2211-79462014-01-012110.2991/ijndc.2014.2.1.1Generation and Mapping of Multi-Reducts Based on Nearest Neighbor RelationNaohiro IshiiIppei ToriiToyoshiro NakashimaHidekazu TanakaDimension 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.https://www.atlantis-press.com/article/10860.pdfclassification; reduct generation; mapping of reducts; multi- reducts; nearest neighbor relation; embedding of nearest neighbor |
| spellingShingle | Naohiro Ishii Ippei Torii Toyoshiro Nakashima Hidekazu Tanaka Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation International Journal of Networked and Distributed Computing (IJNDC) classification; reduct generation; mapping of reducts; multi- reducts; nearest neighbor relation; embedding of nearest neighbor |
| title | Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation |
| title_full | Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation |
| title_fullStr | Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation |
| title_full_unstemmed | Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation |
| title_short | Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation |
| title_sort | generation and mapping of multi reducts based on nearest neighbor relation |
| topic | classification; reduct generation; mapping of reducts; multi- reducts; nearest neighbor relation; embedding of nearest neighbor |
| url | https://www.atlantis-press.com/article/10860.pdf |
| work_keys_str_mv | AT naohiroishii generationandmappingofmultireductsbasedonnearestneighborrelation AT ippeitorii generationandmappingofmultireductsbasedonnearestneighborrelation AT toyoshironakashima generationandmappingofmultireductsbasedonnearestneighborrelation AT hidekazutanaka generationandmappingofmultireductsbasedonnearestneighborrelation |