Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation

Abstract

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 b asic information for classification. We propose here a multireduct 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.

Adaptive Omni-directional Walking Method with Fuzzy Interpolation for Biped Robots

“…In rotation walking adjustment part, the relative acute angle between a robot and target is regarded as the input and the rotational speed is the output. Especially, the relative distance and acute angle can be obtained by some methods, such as image processing methods [30][31][32][33], localization techniques [34][35][36], mapping techniques [37][38], noise reducing method [39][40] and so on.…”

A Pruning Algorithm for Reverse Nearest Neighbors in Directed Road Networks

“…It starts expanding the network from the location of query object q in an increasing order of distance from the query object. Whenever, a sequence n s n e is popped, it is examined for data objects and if any data object is found, it becomes a candidate answer object and a range-NN [8,9] query is issued to verify if k nearest neighbors of object under consideration contains query point q. This process continues until the minheap is empty.…”