Application of universal constraints in the analysis of classification algorithms
From MaRDI portal
Recommendations
- Symmetric constraints in classification problems that permit replacement by functional constraints
- scientific article; zbMATH DE number 4033129
- scientific article; zbMATH DE number 2099743
- Completeness criteria for classification problems with set-theoretical constraints
- scientific article; zbMATH DE number 4053085
Cites work
- scientific article; zbMATH DE number 3589743 (Why is no real title available?)
- Completeness and universal constraints in the correction problem for heuristic classification algorithms
- Symmetric and functional constraints in the correction problem of heuristic classification algorithms
- Universal and local constraints in the problem of correction of heuristic algorithms
Cited in
(11)- Predicate description of universal constraints in the algebraic approach to pattern recognition problems
- A survey of constrained classification
- Algorithms and Fundamental Limits for Unlabeled Detection Using Types
- Relationship between homogeneity and independence constraints for classification algorithms
- Straight-line instruction sequence completeness for total calculation on cancellation meadows
- scientific article; zbMATH DE number 4033129 (Why is no real title available?)
- scientific article; zbMATH DE number 2099743 (Why is no real title available?)
- Standardization of the input data in classification problems using the descent vector method
- On the contribution of backward jumps to instruction sequence expressiveness
- scientific article; zbMATH DE number 4053085 (Why is no real title available?)
- scientific article; zbMATH DE number 1966629 (Why is no real title available?)
This page was built for publication: Application of universal constraints in the analysis of classification algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468630)
