A new heuristic reduction algorithm based on general binary relations
Lists
Only you see this
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.
BibTeX
@inproceedings{teng2009new,
author = {Shuhua Teng and Jixiang Sun and Zhiyong Li and Gang Zou},
title = {{A new heuristic reduction algorithm based on general binary relations}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2009},
doi = {10.1117/12.832682},
}Loading related content...