On the relation between rough set reducts and typical testors
Article
Overview
Research
Identity
Additional Document Info
View All
Overview
abstract
This paper studies the relations between rough set reducts and typical testors from the so-called logical combinatorial approach to pattern recognition. Definitions, comments and observations are formally introduced and supported by illustrative examples. Furthermore, some theorems expressing theoretical relations between reducts and typical testors are enunciated and proved. We also discuss several practical applications of these relations that can mutually enrich the development of research and applications in both areas. Although we focus on the relation between the classical concepts of testor and reduct, our study can be expanded to include other types of testors and reducts. © 2014 Elsevier Inc. All rights reserved.
publication date
funding provided via
published in
Research
keywords
Logical-combinatorial pattern recognition; Reduct; Rough set; Typical testor Pattern recognition; Set theory; Combinatorial approach; Reduct; Research and application; Typical testor; Rough set theory
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume