Paper
30 October 2009 A new heuristic reduction algorithm based on general binary relations
Shuhua Teng, Jixiang Sun, Zhiyong Li, Gang Zou
Author Affiliations +
Proceedings Volume 7496, MIPPR 2009: Pattern Recognition and Computer Vision; 749629 (2009) https://doi.org/10.1117/12.832682
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China
Abstract
Firstly, the concepts of discernibility degree and relative discernibility degree are presented based on general binary relations. Then the properties of these concepts are analyzed. Furthermore, an efficient attribute reduction algorithm is designed based on the relative discernibility degree. Especially, the attribute reduction algorithm is able to deal with various kinds of extended models of classical rough set theory, such as the tolerance relation-based rough set model, non-symmetric similarity relation-based rough set model. Finally, the theoretical analysis is backed up with numerical examples to prove that the proposed reduction method is an effective technique to select useful features and eliminate redundant and irrelevant information.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shuhua Teng, Jixiang Sun, Zhiyong Li, and Gang Zou "A new heuristic reduction algorithm based on general binary relations", Proc. SPIE 7496, MIPPR 2009: Pattern Recognition and Computer Vision, 749629 (30 October 2009); https://doi.org/10.1117/12.832682
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Remote sensing

Binary data

Tolerancing

Distributed interactive simulations

Systems modeling

Algorithms

Silicon

Back to Top