Criteria for the completeness of algorithms for fuzzy marking

MaRDI QIDQ2836651zbMATH OpenFDO

Authors N. Yu. Dorofeev

Publication date 3 July 2013

Published in Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/zvmmf/v52/i8/p1551

zbMATH Keywords

algebraic approachcriteria of algorithm completenesspoint configuration markingtime series

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Dynamic programming (90C39)

Review text

The author studies the synthesis of adaptive algorithms for classification of points in plane configurations. The modified problem is based upon metrics for the neighborhood comparison and introduction of a continuous set of marks. Solvability criteria are given as well as completeness criteria for a family of solving rules.

Recommendations

• Distinguishability and completeness of crisp deterministic fuzzy automata
• The completion of a fuzzy measure and its applications
• scientific article; zbMATH DE number 486939
• An algorithm for comparison of fuzzy sets
• SPECIFICATION AND COMPUTING STATES IN FUZZY ALGORITHMS
• Completeness criteria for classification problems with set-theoretical constraints
• Structural completeness in fuzzy logics
• A fuzzy theory refinement algorithm
• scientific article; zbMATH DE number 4049577

Cited in

(2)

• Completeness criteria for classification problems with set-theoretical constraints
• scientific article; zbMATH DE number 2099743 (Why is no real title available?)

This page was built for publication: Criteria for the completeness of algorithms for fuzzy marking

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