Abstract
Typical testors have been used in feature selection and supervised classification problems in the logical combinatorial pattern recognition. Several algorithms have been used to find the set of all typical testors of a basic matrix. This algorithms are based on different heuristics. There is no doubt these algorithms find the set of all typical testors. However, the time spent on this search strategies, differs between them. Due to size of this set, the search time is a critical factor. There is not a standard procedure to evaluate the time performance of typical testors algorithms. In this paper we introduce a strategy to solve this problem through a new set of test matrices. These test matrices have the property that the set’s cardinality of all typical testors is known in advance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
