×

zbMATH — the first resource for mathematics

On probabilistic methods in fuzzy theory. (English) Zbl 1101.68874
Summary: This lecture is mainly a survey of useful probabilistic methods in the theoretical analysis of fuzzy theory for modeling and design of intelligent systems. The probabilistic methods also are useful for fusing domain knowledge with numerical data in the field of intelligent data analysis.

MSC:
68T35 Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Uncertainty models for knowledge-based systems. New York: North Holland; 1985.
[2] Robbins, Ann Math Stat 15 pp 70– (1944)
[3] Random sets and integral geometry. New York: Wiley; 1975. · Zbl 0321.60009
[4] Mathematics of data fusion. New York: Kluwer Academic Press; 1997. · Zbl 0882.68140 · doi:10.1007/978-94-015-8929-1
[5] A first course in fuzzy logic, 2nd edition. Chapman & Hall/CRC; Boca Raton, FL, 2000. · Zbl 0927.03001
[6] An introduction to copulas. Lecture Notes in Statistics, No. 39, New York: Springer; 1999. · doi:10.1007/978-1-4757-3076-0
[7] Nguyen, J Inf Sci 128 pp 67– (2000)
[8] Introduction to neuro-fuzzy systems. New York: Springer; 2000. · Zbl 0937.68098 · doi:10.1007/978-3-7908-1852-9
[9] Dubois, J Fuzzy Set Syst 49 pp 65– (1992)
[10] Fuzzy measures and related topics. In: Proc of the Workshop on Current Trends and Developments in Fuzzy Logic, Thessaloniki, Greece, October 16-20, 1998. pp 63-99.
[11] Feed forward neural network methodology. New York: Springer; 1999.
[12] Statistical learning theory. New York: Wiley; 1998. · Zbl 0935.62007
[13] Intelligent data analysis. New York: Springer; 1999. · doi:10.1007/978-3-662-03969-4
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.