Application of universal constraints in the analysis of classification algorithms
From MaRDI portal
DOI10.1007/BF01069519zbMATH Open0693.68053MaRDI QIDQ3468630FDOQ3468630
Authors: K. V. Rudakov 
Publication date: 1988
Published in: Cybernetics (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Universal and local constraints in the problem of correction of heuristic algorithms
- Completeness and universal constraints in the correction problem for heuristic classification algorithms
- Symmetric and functional constraints in the correction problem of heuristic classification algorithms
Cited In (11)
- Standardization of the input data in classification problems using the descent vector method
- Relationship between homogeneity and independence constraints for classification algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the contribution of backward jumps to instruction sequence expressiveness
- Algorithms and Fundamental Limits for Unlabeled Detection Using Types
- Title not available (Why is that?)
- A survey of constrained classification
- Straight-line instruction sequence completeness for total calculation on cancellation meadows
- Title not available (Why is that?)
- Predicate description of universal constraints in the algebraic approach to pattern recognition problems
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)
