Are reducts and typical testors the same? Conference Paper

•  
• Overview
•  
• Research
•  
• Identity
•  
• Additional Document Info
•  
• View All
•  

Overview

abstract

• This paper deals with the relation between rough set reducts and typical testors from the logical combinatorial approach to pattern recognition. The main objective is to clarify once and for all that although in many cases the two concepts coincide, being rigorous they are not the same. 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. © Springer International Publishing Switzerland 2014.

authors

• Carrasco-Ochoa J.A.
• Lazo-Cortes M.
• Martínez-Trinidad J.F.
• Sánchez Díaz Guillermo

publication date

• 2014-01-01

published in

• Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  Journal

Research

keywords

• Artificial intelligence; Computer science; Computers; Combinatorial approach; Pattern recognition

Identity

Digital Object Identifier (DOI)

• 10.1007/978-3-319-12568-8_36

Additional Document Info

start page

• 294

end page

• 301

volume

• 8827