A new method for feature selection based on fuzzy similarity measures using multi objective genetic algorithm

Feature selection (FS) is considered to be an important preprocessing step in machine learning and pattern recognition, and feature evaluation is the key issue for constructing a feature selection algorithm. Feature selection process can also reduce noise and this way enhance the classification accuracy. In this article, feature selection method based on fuzzy similarity measures by multi objective genetic algorithm (FSFSM - MOGA) is introduced and performance of the proposed method on published data sets from UCI was evaluated. The results show the efficiency of the method is compared with the conventional version. When this method multi-objective genetic algorithms and fuzzy similarity measures used in CFS method can improve it

Optimal triangular decompositions of matrices with entries from residuated lattices

AbstractWe describe optimal decompositions of an n×m matrix I into a triangular product I=A◁B of an n×k matrix A and a k×m matrix B. We assume that the matrix entries are elements of a residuated lattice, which leaves binary matrices or matrices which contain numbers from the unit interval [0,1] as special cases. The entries of I, A, and B represent grades to which objects have attributes, factors apply to objects, and attributes are particular manifestations of factors, respectively. This way, the decomposition provides a model for factor analysis of graded data. We prove that fixpoints of particular operators associated with I, which are studied in formal concept analysis, are optimal factors for decomposition of I in that they provide us with decompositions I=A◁B with the smallest number k of factors possible. Moreover, we describe transformations between the m-dimensional space of original attributes and the k-dimensional space of factors. We provide illustrative examples and remarks on the problem of computing the optimal decompositions. Even though we present the results for matrices, i.e. for relations between finite sets in terms of relations, the arguments behind are valid for relations between infinite sets as well

The dynamics of consensus in group decision making: investigating the pairwise interactions between fuzzy preferences.

In this paper we present an overview of the soft consensus model in group decision making and we investigate the dynamical patterns generated by the fundamental pairwise preference interactions on which the model is based. The dynamical mechanism of the soft consensus model is driven by the minimization of a cost function combining a collective measure of dissensus with an individual mechanism of opinion changing aversion. The dissensus measure plays a key role in the model and induces a network of pairwise interactions between the individual preferences. The structure of fuzzy relations is present at both the individual and the collective levels of description of the soft consensus model: pairwise preference intensities between alternatives at the individual level, and pairwise interaction coefficients between decision makers at the collective level. The collective measure of dissensus is based on non linear scaling functions of the linguistic quantifier type and expresses the degree to which most of the decision makers disagree with respect to their preferences regarding the most relevant alternatives. The graded notion of consensus underlying the dissensus measure is central to the dynamical unfolding of the model. The original formulation of the soft consensus model in terms of standard numerical preferences has been recently extended in order to allow decision makers to express their preferences by means of triangular fuzzy numbers. An appropriate notion of distance between triangular fuzzy numbers has been chosen for the construction of the collective dissensus measure. In the extended formulation of the soft consensus model the extra degrees of freedom associated with the triangular fuzzy preferences, combined with non linear nature of the pairwise preference interactions, generate various interesting and suggestive dynamical patterns. In the present paper we investigate these dynamical patterns which are illustrated by means of a number of computer simulations.

Hägusad teist liiki integraalvõrrandid

Käesolevas doktoritöös on uuritud hägusaid teist liiki integraalvõrrandeid. Need võrrandid sisaldavad hägusaid funktsioone, s.t. funktsioone, mille väärtused on hägusad arvud. Me tõestasime tulemuse sileda tuumaga hägusate Volterra integraalvõrrandite lahendite sileduse kohta. Kui integraalvõrrandi tuum muudab märki, siis integraalvõrrandi lahend pole üldiselt sile. Nende võrrandite lahendamiseks me vaatlesime kollokatsioonimeetodit tükiti lineaarsete ja tükiti konstantsete funktsioonide ruumis. Kasutades lahendi sileduse tulemusi tõestasime meetodite koonduvuskiiruse. Me vaatlesime ka nõrgalt singulaarse tuumaga hägusaid Volterra integraalvõrrandeid. Uurisime lahendi olemasolu, ühesust, siledust ja hägusust. Ülesande ligikaudseks lahendamiseks kasutasime kollokatsioonimeetodit tükiti polünoomide ruumis. Tõestasime meetodite koonduvuskiiruse ning uurisime lähislahendi hägusust. Nii analüüs kui ka numbrilised eksperimendid näitavad, et gradueeritud võrke kasutades saame parema koonduvuskiiruse kui ühtlase võrgu korral. Teist liiki hägusate Fredholmi integraalvõrrandite lahendamiseks pakkusime uue lahendusmeetodi, mis põhineb kõigi võrrandis esinevate funktsioonide lähendamisel Tšebõšovi polünoomidega. Uurisime nii täpse kui ka ligikaudse lahendi olemasolu ja ühesust. Tõestasime meetodi koonduvuse ja lähislahendi hägususe.In this thesis we investigated fuzzy integral equations of the second kind. These equations contain fuzzy functions, i.e. functions whose values are fuzzy numbers. We proved a regularity result for solution of fuzzy Volterra integral equations with smooth kernels. If the kernel changes sign, then the solution is not smooth in general. We proposed collocation method with triangular and rectangular basis functions for solving these equations. Using the regularity result we estimated the order of convergence of these methods. We also investigated fuzzy Volterra integral equations with weakly singular kernels. The existence, regularity and the fuzziness of the exact solution is studied. Collocation methods on discontinuous piecewise polynomial spaces are proposed. A convergence analysis is given. The fuzziness of the approximate solution is investigated. Both the analysis and numerical methods show that graded mesh is better than uniform mesh for these problems. We proposed a new numerical method for solving fuzzy Fredholm integral equations of the second kind. This method is based on approximation of all functions involved by Chebyshev polynomials. We analyzed the existence and uniqueness of both exact and approximate fuzzy solutions. We proved the convergence and fuzziness of the approximate solution.https://www.ester.ee/record=b539569

An improvised similarity measure for generalized fuzzy numbers

Similarity measure between two fuzzy sets is an important tool for comparing various characteristics of the fuzzy sets. It is a preferred approach as compared to distance methods as the defuzzification process in obtaining the distance between fuzzy sets will incur loss of information. Many similarity measures have been introduced but most of them are not capable to discriminate certain type of fuzzy numbers. In this paper, an improvised similarity measure for generalized fuzzy numbers that incorporate several essential features is proposed. The features under consideration are geometric mean averaging, Hausdorff distance, distance between elements, distance between center of gravity and the Jaccard index. The new similarity measure is validated using some benchmark sample sets. The proposed similarity measure is found to be consistent with other existing methods with an advantage of able to solve some discriminant problems that other methods cannot. Analysis of the advantages of the improvised similarity measure is presented and discussed. The proposed similarity measure can be incorporated in decision making procedure with fuzzy environment for ranking purposes

(α,β,T)-Convex vague sets

By using vague sets we generalize the notion of convex sets and introduce the notion of (α, β ,T )-convex vague sets and study their properties, where T is a triangular norm on [0, 1].

Discrete Mathematics and Symmetry

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group

Orderings of fuzzy sets based on fuzzy orderings. Part II: generalizations

In Part I of this series of papers, a general approach for ordering fuzzy sets with respect to fuzzy orderings was presented. Part I also highlighted three limitations of this approach. The present paper addresses these lim- itations and proposes solutions for overcoming them. We rst consider a fuzzi cation of the ordering relation, then ways to compare fuzzy sets with di erent heights, and nally we introduce how to re ne the ordering relation by lexicographic hybridization with a di erent ordering methodPeer Reviewe

The application of z-numbers in fuzzy decision making: The state of the art

A Z-number is very powerful in describing imperfect information, in which fuzzy numbers are paired such that the partially reliable information is properly processed. During a decision-making process, human beings always use natural language to describe their preferences, and the decision information is usually imprecise and partially reliable. The nature of the Z-number, which is composed of the restriction and reliability components, has made it a powerful tool for depicting certain decision information. Its strengths and advantages have attracted many researchers worldwide to further study and extend its theory and applications. The current research trend on Z-numbers has shown an increasing interest among researchers in the fuzzy set theory, especially its application to decision making. This paper reviews the application of Z-numbers in decision making, in which previous decision-making models based on Z-numbers are analyzed to identify their strengths and contributions. The decision making based on Z-numbers improves the reliability of the decision information and makes it more meaningful. Another scope that is closely related to decision making, namely, the ranking of Z-numbers, is also reviewed. Then, the evaluative analysis of the Z-numbers is conducted to evaluate the performance of Z-numbers in decision making. Future directions and recommendations on the applications of Z-numbers in decision making are provided at the end of this review