Fuzzy measures and integrals in MCDA

This chapter aims at a unified presentation of various methods of MCDA based onfuzzy measures (capacity) and fuzzy integrals, essentially the Choquet andSugeno integral. A first section sets the position of the problem ofmulticriteria decision making, and describes the various possible scales ofmeasurement (difference, ratio, and ordinal). Then a whole section is devotedto each case in detail: after introducing necessary concepts, the methodologyis described, and the problem of the practical identification of fuzzy measuresis given. The important concept of interaction between criteria, central inthis chapter, is explained in details. It is shown how it leads to k-additivefuzzy measures. The case of bipolar scales leads to thegeneral model based on bi-capacities, encompassing usual models based oncapacities. A general definition of interaction for bipolar scales isintroduced. The case of ordinal scales leads to the use of Sugeno integral, andits symmetrized version when one considers symmetric ordinal scales. Apractical methodology for the identification of fuzzy measures in this contextis given. Lastly, we give a short description of some practical applications.Choquet integral; fuzzy measure; interaction; bi-capacities

Bipolar picture fuzzy sets and relations with applications

The notions of both the bipolar fuzzy sets and picture fuzzy sets have been studied by many authors, the bipolar picture fuzzy set is the nice combination of these two notions. Basically, the concepts we present in our study are the direct extensions of both the bipolar fuzzy sets and picture fuzzy sets. In this study, we add few more operations and results in the theory of the bipolar picture fuzzy sets. We also initiate the notion of bipolar picture fuzzy relations along with their applications. We present numerous basic operations along with the algebraic sums, bounded sums, algebraic product, bounded difference on bipolar picture fuzzy sets. Different types of distances between two bipolar picture fuzzy sets are also addressed. We provide the application of bipolar picture fuzzy sets towards decision making theory along with its algorithm. Afterward, we introduce different types of bipolar picture fuzzy relations like bipolar picture fuzzy reflexive, symmetric and transitive relations. Subsequently, we introduce the concepts of the bipolar picture fuzzy equivalence relation and partition. We also produce numerous interesting results based on these relations. Finally, we establish the criteria for the detection of covid-19 at the base of bipolar picture fuzzy relations

A first approach to an axiomatic model of multi-measures

We establish an axiomatic model of multi-measures, capturing some classes of measures studied in the fuzzy sets literature, where they are applied to only one or two arguments

Fuzzy Least Squares Twin Support Vector Machines

Least Squares Twin Support Vector Machine (LST-SVM) has been shown to be an efficient and fast algorithm for binary classification. It combines the operating principles of Least Squares SVM (LS-SVM) and Twin SVM (T-SVM); it constructs two non-parallel hyperplanes (as in T-SVM) by solving two systems of linear equations (as in LS-SVM). Despite its efficiency, LST-SVM is still unable to cope with two features of real-world problems. First, in many real-world applications, labels of samples are not deterministic; they come naturally with their associated membership degrees. Second, samples in real-world applications may not be equally important and their importance degrees affect the classification. In this paper, we propose Fuzzy LST-SVM (FLST-SVM) to deal with these two characteristics of real-world data. Two models are introduced for FLST-SVM: the first model builds up crisp hyperplanes using training samples and their corresponding membership degrees. The second model, on the other hand, constructs fuzzy hyperplanes using training samples and their membership degrees. Numerical evaluation of the proposed method with synthetic and real datasets demonstrate significant improvement in the classification accuracy of FLST-SVM when compared to well-known existing versions of SVM

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

We provide formal definitions and efficient secure techniques for - turning noisy information into keys usable for any cryptographic application, and, in particular, - reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed uniformly. We propose two primitives: a "fuzzy extractor" reliably extracts nearly uniform randomness R from its input; the extraction is error-tolerant in the sense that R will be the same even if the input changes, as long as it remains reasonably close to the original. Thus, R can be used as a key in a cryptographic application. A "secure sketch" produces public information about its input w that does not reveal w, and yet allows exact recovery of w given another value that is close to w. Thus, it can be used to reliably reproduce error-prone biometric inputs without incurring the security risk inherent in storing them. We define the primitives to be both formally secure and versatile, generalizing much prior work. In addition, we provide nearly optimal constructions of both primitives for various measures of ``closeness'' of input data, such as Hamming distance, edit distance, and set difference.Comment: 47 pp., 3 figures. Prelim. version in Eurocrypt 2004, Springer LNCS 3027, pp. 523-540. Differences from version 3: minor edits for grammar, clarity, and typo