Completeness criteria for classification problems with set-theoretical constraints

MaRDI QIDQ3366788zbMATH OpenFDO

Authors

Publication date 15 February 2006

zbMATH Keywords

algebraic approachalgorithmic operatorclassificationcompletenesscorrecting operationresolving ruleset-theoretical constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 2099743
• scientific article; zbMATH DE number 2101499
• Completeness criteria for a linear model of classification algorithms with respect to families of decision rules
• On the completeness and supercompleteness of algorithmic models for comparing text fragments
• Criteria for the completeness of algorithms for fuzzy marking

Cited in

(9)

• Symmetric constraints in classification problems that permit replacement by functional constraints
• Completeness criteria for a linear model of classification algorithms with respect to families of decision rules
• Criteria for the completeness of algorithms for fuzzy marking
• Application of universal constraints in the analysis of classification algorithms
• On the completeness and supercompleteness of algorithmic models for comparing text fragments
• scientific article; zbMATH DE number 2099743 (Why is no real title available?)
• scientific article; zbMATH DE number 2101499 (Why is no real title available?)
• On the Classification of Deterministic Objects via Set Agreement Power
• On metric properties of spaces in classification problems

This page was built for publication: Completeness criteria for classification problems with set-theoretical constraints

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