9555956
Face recognition using fuzzy Integral and wavelet decomposition method
In this paper, we develop a method for recognizing face images by combining wavelet decomposition, Fisherface method, and fuzzy integral. The proposed approach is comprised of four main stages. The first stage uses the wavelet decomposition that helps extract intrinsic features of face images. As a result of this decomposition, we obtain four subimages (namely approximation, horizontal, vertical, and diagonal detailed images). The second stage of the approach concerns the application of the Fisherface method to these four decompositions. The choice of the Fisherface method in this setting is motivated by its insensitivity to large variation in light direction, face pose, and facial expression. The two last phases are concerned with the aggregation of the individual classifiers by means of the fuzzy integral. Both Sugeno and Choquet type of fuzzy integral are considered as the aggregation method. In the experiments we use n-fold cross-validation to assure high consistency of the produced classification outcomes. The experimental results obtained for the Chungbuk National University (CNU) and Yale University face databases reveal that the approach presented in this paper yields better classification performance in comparison to the results obtained by other classifiers.
31716066
The genetic development of ordinal sums
Abstract The aim of this study is to develop an operational model of an ordinal sum of triangular norms. The essence of this construct lies in the use of different t-norms (and/or t-conorms) defined over disjoint subintervals of the unit interval. The result of such aggregation is a highly versatile logic operator that can be easily adapted to the existing experimental evidence. We propose a genetic optimisation environment (Genetic Algorithms, GAs, in particular) to construct ordinal sums and show how the GA mechanism helps optimize subintervals and to allocate individual local t-norms. The application of the genetically designed ordinal sums is shown in case of Zimmermann–Zysno logic operator data. We also demonstrate the use of the ordinal sum to the construction of neuro-fuzzy systems; in this case we quantify the performance of ordinal sums to “standard” logic operators used in such models.
2982088
Fuzzy Aggregation Method Using Fisherface and Wavelet Decomposition for Face Recognition
34168275
Fuzzy clustering with supervision
This study is concerned with clustering carried out in presence of labeled patterns. An objective of this optimization is to reconcile between the structure residing in data (and being primarily discovered by the underlying clustering mechanism) and the labels of the patterns forming such structure. In this sense, one can consider the supervised fuzzy clustering to be a framework of preliminary data analysis providing with a thorough insight into the structure of the data and supporting the ensuing design of detailed classifiers. The proposed method augments the standard fuzzy C-means algorithm by extending the original objective function by the supervision component (labeled patterns). Experimental results illustrate the approach and discuss the use of this type of clustering in vector quantization.
19471846
Fuzzy clustering with a knowledge-based guidance
Fuzzy clustering becomes a broadly accepted synonym of fundamental endeavors aimed at finding structures in multidimensional data. In essence, these methods operate in unsupervised mode. This means that they act upon data while being directed by some predefined objective function (criterion) for which they "discover" a structure (clusters) that yields a minimal value of this criterion. In this study, we discuss an issue of exploiting and effectively incorporating auxiliary problem dependent hints being available as a part of the domain knowledge associated with the pattern recognition problem at hand. As such hints are usually expressed by experts/data analysts at the level of clusters (information granules) rather than individual data (patterns), we refer to them as knowledge-based indicators and allude to a set of them as a knowledge-based guidance available to fuzzy clustering. The proposed paradigm shift in which fuzzy clustering incorporates this type of knowledge-based supervision is discussed and contrasted with the "pure" (that is data-driven) version of fuzzy clustering. Several fundamental categories of the guidance mechanisms are introduced and discussed, namely partial supervision, proximity-based guidance and uncertainty driven knowledge hints. The details on how the guidance machinery translates into updates of the partition matrices are presented. We also present a number of practical scenarios in which the role of knowledge hints becomes evident and highly justifiable. This concerns Web exploration, exploitation of labeled patterns, issues of incomplete feature spaces, and constraints of typicality of patterns, to name a few representative applications.
12910860
Multi-layer hybrid fuzzy polynomial neural networks: a design in the framework of computational intelligence
We introduce a new architecture of hybrid fuzzy polynomial neural networks (HFPNN) that is based on a genetically optimized multi-layer perceptron and develop their comprehensive design methodology involving mechanisms of genetic optimization. The construction of HFPNN exploits fundamental technologies of computational intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms (GAs). The architecture of the resulting genetically optimized HFPNN (namely gHFPNN) results from a synergistic usage of the hybrid system generated by combining fuzzy polynomial neurons (FPNs)-based fuzzy neural networks (FNN) with polynomial neurons (PNs)-based polynomial neural networks (PNN). The design of the conventional HFPNN exploits the extended group method of data handling (GMDH) with some essential parameters of the network being provided by the designer and kept fixed throughout the overall development process. This restriction may hamper a possibility of producing an optimal architecture of the model. The augmented gHFPNN results in a structurally optimized structure and comes with a higher level of flexibility in comparison to the one we encounter in the conventional HFPNN. The GA-based design procedure being applied at each layer of HFPNN leads to the selection of preferred nodes (FPNs or PNs) available within the HFPNN. In the sequel, two general optimization mechanisms are explored. First, the structural optimization is realized via GAs whereas the ensuing detailed parametric optimization is carried out in the setting of a standard least square method-based learning. The performance of the gHFPNN is quantified through experimentation where we exploit data coming from processes of pH neutralization and NOx emission. These datasets have already been used quite intensively in fuzzy and neurofuzzy modeling. The obtained results demonstrate superiority of the proposed networks over the existing fuzzy and neural models.
22511023
Fuzzy clustering with partial supervision
Presented here is a problem of fuzzy clustering with partial supervision, i.e., unsupervised learning completed in the presence of some labeled patterns. The classification information is incorporated additively as a part of an objective function utilized in the standard FUZZY ISODATA. The algorithms proposed in the paper embrace two specific learning scenarios of complete and incomplete class assignment of the labeled patterns. Numerical examples including both synthetic and real-world data arising in the realm of software engineering are also provided.
17239140
Granular clustering: a granular signature of data
The study is devoted to a granular analysis of data. We develop a new clustering algorithm that organizes findings about data in the form of a collection of information granules-hyperboxes. The clustering carried out here is an example of a granulation mechanism. We discuss a compatibility measure guiding a construction (growth) of the clusters and explain a rationale behind their development. The clustering promotes a data mining way of problem solving by emphasizing the transparency of the results (hyperboxes). We discuss a number of indexes describing hyperboxes and expressing relationships between such information granules. It is also shown how the resulting family of the information granules is a concise descriptor of the structure of the data-a granular signature of the data. We examine the properties of features (variables) occurring of the problem as they manifest in the setting of the information granules. Numerical experiments are carried out based on two-dimensional (2-D) synthetic data as well as multivariable Boston data available on the WWW.
5269666
Conditional Fuzzy C-Means
A Fuzzy C-Means-based clustering method guided by an auxiliary (conditional) variable is introduced. The method reveals a structure within a family of patterns by considering their vicinity in a feature space along with the similarity of the values assumed by a certain conditional variable. The usefulness of the algorithm is exemplified in the problems of data mining.