An approach based on tunicate swarm algorithm to solve partitional clustering problem

The tunicate swarm algorithm (TSA) is a newly proposed population-based swarm optimizer for solving global optimization problems. TSA uses best solution in the population in order improve the intensification and diversification of the tunicates. Thus, the possibility of finding a better position for search agents has increased. The aim of the clustering algorithms is to distributed the data instances into some groups according to similar and dissimilar features of instances. Therefore, with a proper clustering algorithm the dataset will be separated to some groups and it’s expected that the similarities of groups will be minimum. In this work, firstly, an approach based on TSA has proposed for solving partitional clustering problem. Then, the TSA is implemented on ten different clustering problems taken from UCI Machine Learning Repository, and the clustering performance of the TSA is compared with the performances of the three well known clustering algorithms such as fuzzy c-means, k-means and k-medoids. The experimental results and comparisons show that the TSA based approach is highly competitive and robust optimizer for solving the partitional clustering problems

Symmetric implicational restriction method of fuzzy inference

summary:The symmetric implicational method is revealed from a different perspective based upon the restriction theory, which results in a novel fuzzy inference scheme called the symmetric implicational restriction method. Initially, the SIR-principles are put forward, which constitute optimized versions of the triple I restriction inference mechanism. Next, the existential requirements of basic solutions are given. The supremum (or infimum) of its basic solutions is achieved from some properties of fuzzy implications. The conditions are obtained for the supremum to become the maximum (or the infimum to be the minimum). Lastly, four concrete examples are provided, and it is shown that the new method is better than the triple I restriction method, because the former is able to let the inference more compact, and lead to more and superior particular inference schemes

Prediction of Voltage Sag Relative Location with Data-Driven Algorithms in Distribution Grid

Power quality (PQ) problems, including voltage sag, flicker, and harmonics, are the main concerns for the grid operator. Among these disturbances, voltage sag, which affects the sensitive loads in the interconnected system, is a crucial problem in the transmission and distribution systems. The determination of the voltage sag relative location as a downstream (DS) and upstream (US) is an important issue that should be considered when mitigating the sag problem. Therefore, this paper proposes a novel approach to determine the voltage sag relative location based on voltage sag event records of the power quality monitoring system (PQMS) in the real distribution system. By this method, the relative location of voltage sag is defined by Gaussian naive Bayes (Gaussian NB) and K-nearest neighbors (K-NN) algorithms. The proposed methods are compared with support vector machine (SVM) and artificial neural network (ANN). The results indicate that K-NN and Gaussian NB algorithms define the relative location of a voltage sag with 98.75% and 97.34% accuracy, respectively

On continuity of the entropy-based differently implicational algorithm

summary:Aiming at the previously-proposed entropy-based differently implicational algorithm of fuzzy inference, this study analyzes its continuity. To begin with, for the FMP (fuzzy modus ponens) and FMT (fuzzy modus tollens) problems, the continuous as well as uniformly continuous properties of the entropy-based differently implicational algorithm are demonstrated for the Tchebyshev and Hamming metrics, in which the R-implications derived from left-continuous t-norms are employed. Furthermore, four numerical fuzzy inference examples are provided, and it is found that the entropy-based differently implicational algorithm can obtain more reasonable solution in contrast with the fuzzy entropy full implication algorithm. Finally, in the entropy-based differently implicational algorithm, we point out that the first fuzzy implication reflects the effect of rule base, and that the second fuzzy implication embodies the inference mechanism

Approximation Theory and Related Applications

In recent years, we have seen a growing interest in various aspects of approximation theory. This happened due to the increasing complexity of mathematical models that require computer calculations and the development of the theoretical foundations of the approximation theory. Approximation theory has broad and important applications in many areas of mathematics, including functional analysis, differential equations, dynamical systems theory, mathematical physics, control theory, probability theory and mathematical statistics, and others. Approximation theory is also of great practical importance, as approximate methods and estimation of approximation errors are used in physics, economics, chemistry, signal theory, neural networks and many other areas. This book presents the works published in the Special Issue "Approximation Theory and Related Applications". The research of the world’s leading scientists presented in this book reflect new trends in approximation theory and related topics