On the usage of the probability integral transform to reduce the complexity of multi-way fuzzy decision trees in Big Data classification problems

We present a new distributed fuzzy partitioning method to reduce the complexity of multi-way fuzzy decision trees in Big Data classification problems. The proposed algorithm builds a fixed number of fuzzy sets for all variables and adjusts their shape and position to the real distribution of training data. A two-step process is applied : 1) transformation of the original distribution into a standard uniform distribution by means of the probability integral transform. Since the original distribution is generally unknown, the cumulative distribution function is approximated by computing the q-quantiles of the training set; 2) construction of a Ruspini strong fuzzy partition in the transformed attribute space using a fixed number of equally distributed triangular membership functions. Despite the aforementioned transformation, the definition of every fuzzy set in the original space can be recovered by applying the inverse cumulative distribution function (also known as quantile function). The experimental results reveal that the proposed methodology allows the state-of-the-art multi-way fuzzy decision tree (FMDT) induction algorithm to maintain classification accuracy with up to 6 million fewer leaves.Comment: Appeared in 2018 IEEE International Congress on Big Data (BigData Congress). arXiv admin note: text overlap with arXiv:1902.0935

Fuzzy weakest precondition and fuzzy invariants

Design and formal verification of algorithms can be translated into a fuzzy framework introducing fuzzy logic and assert transformations. Following the classical scheme, and in order to develop codes with good behavior, this paper defines the concepts of fuzzy algorithm specification and fuzzy weakest precondition operator which are then applied to a fuzzy decision making algorithm. Keywords: Fuzzy algorithms and programming,decision making

Multiple Attributes Decision Fusion for Wireless Sensor Networks Based on Intuitionistic Fuzzy Set

Decision fusion is an important issue in wireless sensor networks (WSN), and intuitionistic fuzzy set (IFS) is a novel method for dealing with uncertain data. We propose a multi-attribute decision fusion model based on IFS, which includes two aspects: data distribution-based IFS construction algorithm (DDBIFCA) and the category similarity weight-based TOPSIS intuitionistic fuzzy decision algorithm (CSWBT-IFS). The DDBIFCA is an IFS construction algorithm that transforms the original attribute values into intuitionistic fuzzy measures, and the CSWBT-IFS is an intuitionistic fuzzy aggregation algorithm improved by the traditional TOPSIS algorithm, which combines intuitionistic fuzzy values of different attributes and obtains a final decision for the monitoring target. Both algorithms have benefits, such as low energy consumption and low computational complexity, which make them suitable for implementation in energy-constrained WSNs. Simulation results show the efficiency of intuitionistic fuzzification for the DDBIFCA and a high classification accuracy, compared with traditional fuzzy fusion and other intuitionistic fuzzy aggregation algorithms, for the CSWBT-IFS

Multi-criteria reliability optimization for a complex system with a bridge structure in a fuzzy environment : A fuzzy multi-criteria genetic algorithm approach

Abstract: Optimizing system reliability in a fuzzy environment is complex due to the presence of imprecise multiple decision criteria such as maximizing system reliability and minimizing system cost. This calls for multi-criteria decision making approaches that incorporate fuzzy set theory concepts and heuristic methods. This paper presents a fuzzy multi-criteria nonlinear model, and proposes a fuzzy multi-criteria genetic algorithm (FMGA) for complex bridge system reliability design in a fuzzy environment. The algorithm uses fuzzy multi-criteria evaluation techniques to handle fuzzy goals, preferences, and constraints. The evaluation approach incorporates fuzzy preferences and expert choices of the decision maker in regards to cost and reliability goals. Fuzzy evaluation gives the algorithm flexibility and adaptability, yielding near-optimal solutions within short computation times. Results from computational experiments based on benchmark problems demonstrate that the FMGA approach is a more reliable and effective approach than best known algorithm, especially in a fuzzy multi-criteria environment

Possibility expectation and its decision making algorithm

The fuzzy integral has been shown to be an effective tool for the aggregation of evidence in decision making. Of primary importance in the development of a fuzzy integral pattern recognition algorithm is the choice (construction) of the measure which embodies the importance of subsets of sources of evidence. Sugeno fuzzy measures have received the most attention due to the recursive nature of the fabrication of the measure on nested sequences of subsets. Possibility measures exhibit an even simpler generation capability, but usually require that one of the sources of information possess complete credibility. In real applications, such normalization may not be possible, or even desirable. In this report, both the theory and a decision making algorithm for a variation of the fuzzy integral are presented. This integral is based on a possibility measure where it is not required that the measure of the universe be unity. A training algorithm for the possibility densities in a pattern recognition application is also presented with the results demonstrated on the shuttle-earth-space training and testing images

Integrating Information Theory Measures and a Novel Rule-Set-Reduction Tech-nique to Improve Fuzzy Decision Tree Induction Algorithms

Machine learning approaches have been successfully applied to many classification and prediction problems. One of the most popular machine learning approaches is decision trees. A main advantage of decision trees is the clarity of the decision model they produce. The ID3 algorithm proposed by Quinlan forms the basis for many of the decision trees’ application. Trees produced by ID3 are sensitive to small perturbations in training data. To overcome this problem and to handle data uncertainties and spurious precision in data, fuzzy ID3 integrated fuzzy set theory and ideas from fuzzy logic with ID3. Several fuzzy decision trees algorithms and tools exist. However, existing tools are slow, produce a large number of rules and/or lack the support for automatic fuzzification of input data. These limitations make those tools unsuitable for a variety of applications including those with many features and real time ones such as intrusion detection. In addition, the large number of rules produced by these tools renders the generated decision model un-interpretable. In this research work, we proposed an improved version of the fuzzy ID3 algorithm. We also introduced a new method for reducing the number of fuzzy rules generated by Fuzzy ID3. In addition we applied fuzzy decision trees to the classification of real and pseudo microRNA precursors. Our experimental results showed that our improved fuzzy ID3 can achieve better classification accuracy and is more efficient than the original fuzzy ID3 algorithm, and that fuzzy decision trees can outperform several existing machine learning algorithms on a wide variety of datasets. In addition our experiments showed that our developed fuzzy rule reduction method resulted in a significant reduction in the number of produced rules, consequently, improving the produced decision model comprehensibility and reducing the fuzzy decision tree execution time. This reduction in the number of rules was accompanied with a slight improvement in the classification accuracy of the resulting fuzzy decision tree. In addition, when applied to the microRNA prediction problem, fuzzy decision tree achieved better results than other machine learning approaches applied to the same problem including Random Forest, C4.5, SVM and Knn

A compromise-based particle swarm optimization algorithm for solving Bi-level programming problems with fuzzy parameters

© 2015 IEEE. Bi-level programming has arisen to handle decentralized decision-making problems that feature interactive decision entities distributed throughout a bi-level hierarchy. Fuzzy parameters often appear in such a problem in applications and this is called a fuzzy bi-level programming problem. Since the existing approaches lack universality in solving such problems, this study aims to develop a particle swarm optimization (PSO) algorithm to solve fuzzy bi-level programming problems in the linear and nonlinear versions. In this paper, we first present a general fuzzy bi-level programming problem and discuss related theoretical properties based on a fuzzy number ranking method commonly used. A PSO algorithm is then developed to solve the fuzzy bi-level programming problem based on different compromised selections by decision entities on the feasible degree for constraint conditions under fuzziness. Lastly, an illustrative numerical example and two benchmark examples are adopted to state the effectiveness of the compromise-based PSO algorithm

Fuzzy multilevel programming with a hybrid intelligent algorithm

AbstractIn order to model fuzzy decentralized decision-making problem, fuzzy expected value multilevel programming and chance-constrained multilevel programming are introduced. Furthermore, fuzzy simulation, neural network, and genetic algorithm are integrated to produce a hybrid intelligent algorithm for finding the Stackelberg-Nash equilibrium. Finally, two numerical examples are provided to illustrate the effectiveness of the hybrid intelligent algorithm