Irredundant test for binary tables

MaRDI QIDQ1974747zbMATH OpenFDO

Authors Kh. A. Madatyan

Publication date 19 June 2000

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

algorithmirredundant testspattern recognitiontest

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Pattern recognition, speech recognition (68T10) Fault detection; testing in circuits and networks (94C12)

Review text

The author describes an algorithm designed for constructing all irredundant tests for an arbitrary table. The irredundant test is an incompressible set of features retaining all information concerning the division of a table into classes. As a rule, there are numerous such irredundant sets of features, and they are extremely difficult to construct. The algorithm described in the present paper is particularly efficient when the number of columns exceeds the number of rows.

Recommendations

• An algorithm for constructing irredundant tests for binary tables
• On characteristic functions of checking tests of binary tables
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• scientific article; zbMATH DE number 3903826
• scientific article; zbMATH DE number 5129614

Cited in

(5)

• An algorithm for constructing irredundant tests for binary tables
• On characteristic functions of checking tests of binary tables
• scientific article; zbMATH DE number 3903826 (Why is no real title available?)
• scientific article; zbMATH DE number 16574 (Why is no real title available?)
• scientific article; zbMATH DE number 3609171 (Why is no real title available?)

This page was built for publication: Irredundant test for binary tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974747)