Comparison of different algorithms of approximation by extensional fuzzy subsets

DOI10.1007/978-3-642-39165-1_31MaRDI QIDQ2864258zbMATH OpenOpenAlexFDO

Authors Gabriel Mattioli, J. Recasens

Publication date 6 December 2013

Published in Aggregation Functions in Theory and in Practise (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/20335

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• An algorithm for comparison of fuzzy sets
• On approximations of Zadeh's extension principle
• Interpretation of fuzzy subsets in modeling and control problems
• A new type of approximation for fuzzy intervals
• scientific article; zbMATH DE number 5155047

Cited in

(5)

• On extensional fuzzy sets generated by factoraggregation
• APPROXIMATION OF KNOWLEDGE AND FUZZY SETS
• On central algorithms of approximation under fuzzy information
• General aggregation operators based on a fuzzy equivalence relation in the context of approximate systems
• General \(L\)-fuzzy aggregation functions based on complete residuated lattices

This page was built for publication: Comparison of different algorithms of approximation by extensional fuzzy subsets

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