On the relation between rough set reducts and typical testors

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.