Search

In this paper, we propose a cascade AdaBoost neural network (CANN) based on concepts and construct of AdaBoost neurons and cascade structure. Compared with AdaBoost, CANN can represent complex relationships between features. In CANN, representation learning is performed through AdaBoost, and the method of random selection features is utilized to encourage the diversity of AdaBoost neurons. Through the cascade structure, CANN has the context structure for complex feature representation. At the same time, in order to avoid the problem of feature disappearance, shortcut connection is used to add the previous information to the later nodes. Furthermore, particle swarm optimization (PSO) algorithm is utilized to optimize the structure of CANN, it can obtain the number of iterations to achieve better performance. Two types of CANN are proposed based — binary-classification CANN (BCANN) or multi-classification CANN (MCANN). The performance of CANN is evaluated with two kinds of data sets: machine learning data sets and atrial fibrillation data set. A comparative analysis illustrates that the proposed CANN leads to better performance than the models reported in the literature. [ABSTRACT FROM AUTHOR]

In this study, a novel promotive particle swarm optimizer with double hierarchical structures is proposed. It is inspired by successful mechanisms present in social and biological systems to make particles compete fairly. In the proposed method, the swarm is first divided into multiple independent subpopulations organized in a hierarchical promotion structure, which protects subpopulation at each hierarchy to search for the optima in parallel. A unidirectional communication strategy and a promotion operator are further implemented to allow excellent particles to be promoted from low-hierarchy subpopulations to high-hierarchy subpopulations. Furthermore, for the internal competition within each subpopulation of the hierarchical promotion structure, a hierarchical multiscale optimum controlled by a tiered architecture of particles is constructed for particles, in which each particle can synthesize a set of optima of its different scales. The hierarchical promotion structure can protect particles that just fly to promising regions and have low fitness from competing with the entire swarm. Also, the double hierarchical structures increase the diversity of searching. Numerical experiments and statistical analysis of results reported on 30 benchmark problems show that the proposed method improves the accuracy and convergence speed especially in solving complex problems when compared with several variations of particle swarm optimization. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new topology of fuzzy-neural networks--fuzzy-set-based polynomial neural networks (FSPNNs). The two underlying design mechanisms of such networks involve genetic optimization and information granulation (IG). The resulting constructs come in the form of fuzzy polynomial neural networks with fuzzy-set-based polynomial neurons, regarded as their generic processing elements. First, we introduce a comprehensive design methodology using which we determine the optimal structure of the FSPNNs. This methodology hinges on the extended group method of data handling and fuzzy-set-based rules. It concerns the optimization of the FSPNN-related parameters such as the number of input variables, the order of the polynomial, the number of membership functions, and a collection of a specific subset of input variables realized through the mechanism of genetic optimization. Second, the fuzzy rules used in the networks exploit a notion of information granules defined over a system's variables and formed through the process of IG. This granulation is realized with the aid of the hard C-means clustering algorithm. The performance of the network is quantified through experimentation in which we use a number of modeling benchmarks already experimented with in the realm of fuzzy or neurofuzzy modeling. Index Terms--Fuzzy-set-based polynomial neural networks (FSPNNs), fuzzy-set-based polynomial neuron (FSPN), genetic algorithms (GAs), group method of data handling (GMDH), hard C-means (HCM) clustering, information granulation (IG).

In this paper, the authors propose and investigate a new category of neurofuzzy networks--fuzzy polynomial neural networks (FPNNs)--and develop a comprehensive design methodology involving mechanisms of genetic optimization and, in particular, genetic algorithms (GAs). The conventional FPNNs developed so far are based on mechanisms of self-organization and evolutionary optimization. The design of the network exploits the extended group method of data handling, 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 design proposed in this paper addresses this issue. The augmented genetically optimized FPNN (gFPNN) results in a structurally optimized structure and comes with a higher level of flexibility in comparison with the one encountered in the conventional FPNN. The GA-based design procedure that is applied to each layer of FPNN leads to the selection of the preferred nodes (or fuzzy polynomial neurons) available within the FPNN. 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 gFPNN is quantified through experimentation where a number of modeling benchmarks are being used, i.e., synthetic and experimental data already experimented within fuzzy or neurofuzzy modeling. The obtained results demonstrate superiority of the proposed networks over the existing fuzzy and neural models. Index Terms--Fuzzy polynomial neuron (FPN), genetic algorithms (GAs), genetically optimized fuzzy polynomial neural networks (gFPNNs), multilayer perceptron (MLP), self-organizing network.

In this paper, we develop an advanced architecture and come up with a comprehensive design methodology of genetically optimized hybrid fuzzy neural networks (gHFNNs). The construction of gHFNN exploits fundamental technologies of computational intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms (GAs). The architecture of the gHFNN results from a highly synergistic usage of the genetic optimization-driven hybrid system being generated by combining fuzzy neural networks (FNNs) with polynomial neural networks (PNN). FNN contributes to the formation of the premise part of the overall network structure of the gHFNN. The consequence part of the gHFNN is designed using PNNs. The optimization of the FNN is realized with the aid of a standard backpropagation learning algorithm and genetic optimization. As the consequence part of the gHFNN, the development of the PNN dwells on two general optimization mechanisms: the structural optimization is realized via GAs whereas in the case of the parametric optimization we proceed with a standard least square method-based learning (optimization). Through the consecutive process of such structural and parametric optimization, an optimized PNN becomes generated in a dynamic fashion. To evaluate the performance of the gHFNNs, we experimented with a number of representative numerical examples. A comparative analysis demonstrates that the proposed gHFNNs are neurofuzzy systems with higher accuracy as well as more superb predictive capability than other models available in the literature. Index Terms--Computational intelligence (CI), design procedure, fuzzy neural networks (FNNs), genetically optimized hybrid fuzzy neural networks (gHFNNs), genetically optimized polynomial neural networks (gPNNs), group method of data handling (GMDH).

In this study, we introduce and investigate a class of neural architectures of Polynomial Neural Networks (PNNs), discuss a comprehensive design methodology and carry out a series of numeric experiments. Two kinds of PNN architectures, namely a basic PNN and a modified PNN architecture are discussed. Each of them comes with two types such as the generic and the advanced type. The essence of the design procedure dwells on the Group Method of Data Handling. PNN is a flexible neural architecture whose structure is developed through learning. In particular, the number of layers of the PNN is not fixed in advance but becomes dynamically meaning that the network grows over the training period. In this sense, PNN is a self-organizing network. A comparative analysis shows that the proposed PNN are models with higher accuracy than other fuzzy models. Keywords: Polynomial neural networks (PNNs); The generic and the advanced type of PNNs; Group method of data handling (GMDH); Self-organizing network; Design procedure

Experimental software datasets describing software projects in terms of their complexity and development time have been a subject of intensive modeling. A number of various modeling methodologies and modeling designs have been proposed including such development frameworks as neural networks, fuzzy and neurofuzzy models. In this study, we introduce a concept of self-organizing neurofuzzy networks (SONFN), a hybrid modeling architecture combining neurofuzzy networks (NFN) and polynomial neural networks (PNN). For these networks we develop a comprehensive design methodology. The construction of SONFNs takes advantage of the we!l-established technologies of computational intelligence (CI), namely fuzzy sets, neural networks and genetic algorithms. The architecture of the SONFN results from a synergistic usage of NFNs and PNNs. NFN contributes to the formation of the premise part of the rule-based structure of the SONFN. The consequence part of the SONFN is designed using PNNs. We discuss two types of SONFN architectures whose taxonomy is based on the NFN scheme being applied to the premise part of SONFN. We introduce a comprehensive learning algorithm. It is shown that this network exhibits a dynamic structure as the number of its layers as well as the number of nodes in each layer of the SONFN are not predetermined (as this is the case in a popular topology of a multilayer perceptron). The experimental results include a well-known NASA dataset concerning software cost estimation. Index Terms--Computational intelligence, genetic algorithms, linear fuzzy inference, neurofuzzy networks, polynomial neural networks, self-organizing neurofuzzy networks.

Abstract: In terms of electrical energy, the technical fusion with solar energy system is promisingly applied in order to improve the efficiency in the power applications, since the solar energy system can convert an eternal electric energy in all-year-around. As one of such power applications, we proposed a current charging system for HTS magnet combined with solar energy (CHS). As this system can operate without external utility power to charge the HTS load magnet due to the solar energy, the operating efficiency is practically improved. The power converter, which is interfaced with solar energy and HTS magnet systems, plays an important role to transfer the stable electric energy and thus, the stabilized performance of the converter with solar energy system is one of essential factors. In this study, we investigated various charging performances under different operating conditions of the converter. In addition, operating characteristics have been analyzed by solving solar cell equivalent equations based on circuit simulation program. [Copyright &y& Elsevier]

Abstract: In this study, we discuss a design of an optimized cascade fuzzy controller for the rotary inverted pendulum system and ball & beam system by using an optimization vehicle of differential evolution (DE). The structure of the differential evolution optimization environment is simple and a convergence to optimal values realized here is very good in comparison to the convergence reported for other optimization algorithms. DE is easy to use given its mathematical operators. It also requires a limited computing overhead. The rotary inverted pendulum system and ball & beam system are nonlinear systems, which exhibit unstable motion. The performance of the proposed fuzzy controller is evaluated from the viewpoint of several performance criteria such as overshoot, steady-state error, and settling time. Their values are obtained through simulation studies and practical, real-world experiments. We evaluate and analyze the performance of the proposed optimal fuzzy controller optimized by Genetic Algorithm (GA), and DE. In this setting, we show the superiority of DE versus other methods being used here as well as highlight the characteristics of this optimization tool. [Copyright &y& Elsevier]

Abstract: The paper is concerned with a hybrid optimization of fuzzy inference systems based on hierarchical fair competition-based parallel genetic algorithms (HFCGA) and information granulation. The process of information granulation is realized with the aid of the C-Means clustering. HFCGA being a multi-population based parallel genetic algorithms (PGA) is exploited here to realize structure optimization and carry out parameter estimation of the fuzzy models. The HFCGA becomes helpful in the context of fuzzy models as it restricts a premature convergence encountered quite often in optimization problems. It concerns a set of parameters of the model including among others the number of input variables to be used, a specific subset of input variables, and the number of membership functions. In the hybrid optimization process, two general optimization mechanisms are explored. The structural development of the fuzzy model is realized via the HFCGA optimization and C-Means, whereas to deal with the parametric optimization we proceed with a standard least square method and the use of the HFCGA technique. A suite of comparative studies demonstrates that the proposed algorithm leads to the models whose performance is superior in comparison with some other constructs commonly used in fuzzy modeling. [Copyright &y& Elsevier]

Abstract: In this study, we introduce a design methodology for an optimized fuzzy cascade controller for ball and beam system by exploiting the use of hierarchical fair competition-based genetic algorithm (HFCGA). The ball and beam system is a well-known control engineering experimental setup which consists of servo motor, beam and ball and exhibits a number of interesting and challenging properties when considered from the control perspective. The position of ball is determined through the control of a servo motor. The displacement change of the position of ball requires the change of the angle of the beam which determines the position angle of a servo motor. Consequently, the variation of the position of the moving ball and the ensuing change of the angle of the beam results in the change of the position angle of a servo motor. We introduce the fuzzy cascade controller scheme which consists of the outer (1st) controller and the inner (2nd) controller in a cascaded architecture. Auto-tuning of the parameters of the controller (viz. scaling factors) of each fuzzy controller is realized with the use of the HFCGA. The set-point value of the inner controller (the 2nd controller) corresponds to the position angle of a servo motor, and is given as a reference value which enters into the inner controller as the 2nd controller of the two cascaded controllers. HFCGA is a kind of a parallel genetic algorithm (PGA), which helps alleviate an effect of premature convergence being a potential shortcoming present in conventional genetic algorithms (GAs). A detailed comparative analysis carried out from the viewpoint of the performance and the design methodology, is provided for the fuzzy cascade controller and the conventional PD cascade controller whose design relied on the use of the serial genetic algorithms. [Copyright &y& Elsevier]

In this study, we introduce an advanced architecture of genetically optimized Hybrid Fuzzy Neural Networks (gHFNN) and develop a comprehensive design methodology supporting their construction. A series of numeric experiments is included to illustrate the performance of the networks. The construction of gHFNN exploits fundamental technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms (GAs). The architecture of the gHFNNs results from a synergistic usage of the genetic optimization-driven hybrid system generated by combining Fuzzy Neural Networks (FNN) with Polynomial Neural Networks (PNN). In this tandem, a FNN supports the formation of the condition part of the rule-based structure of the gHFNN. The conclusion part of the gHFNN is designed using PNNs. We distinguish between two types of the simplified fuzzy inference rule-based FNN structures showing how this taxonomy depends upon the type of a fuzzy partition of input variables. As to the conclusion part of the gHFNN, the development of the PNN dwells on two general optimization mechanisms: the structural optimization is realized via GAs whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the gHFNN, we experimented with three representative numerical examples. A comparative analysis demonstrates that the proposed gHFNN come with higher accuracy as well as superb predictive capabilities when compared with other neurofuzzy models. [ABSTRACT FROM AUTHOR]

In this paper, a new approach to estimate scaling factors of the fuzzy PID controller is presented. The performance of the fuzzy PID controller is sensitive to the variety of scaling factors. The design procedure dwells on the use of evolutionary computing (more specifically, a genetic algorithm) and estimation algorithm. The tuning of the scaling factors of the fuzzy PID controller is essential to the entire optimization process. And then we estimate scaling factors of the fuzzy PID controller by means of three types of estimation algorithms such as HCM (Hard C-Means) clustering-based regression polynomial, neuro-fuzzy networks, and regression polynomials. Numerical studies are presented in detail along with a detailed comparative analysis. [Copyright &y& Elsevier]

We propose a hybrid architecture based on a combination of fuzzy systems and polynomial neural networks. The resulting Hybrid Fuzzy Polynomial Neural Networks (HFPNN) dwells on the ideas of fuzzy rule-based computing and polynomial neural networks. The structure of the network comprises of fuzzy polynomial neurons (FPNs) forming the nodes of the first (input) layer of the HFPNN and polynomial neurons (PNs) that are located in the consecutive layers of the network. In the FPN (that forms a fuzzy inference system), the generic rules assume the form "if A then y = P(x)" where A is a fuzzy relation in the condition space while P(x) is a polynomial standing in the conclusion part of the rule. The conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as constant, linear, quadratic, and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership functions are considered. Each PN of the network realizes a polynomial type of partial description (PD) of the mapping between input and out variables. HFPNN is a flexible neural architecture whose structure is based on the Group Method of Data Handling (GMDH) and developed through learning. In particular, the number of layers of the PNN is not fixed in advance but is generated in a dynamic way. The experimental part of the study involves two representative numerical examples such as chaotic time series and Box-Jenkins gas furnace data. [ABSTRACT FROM AUTHOR]

We establish one-sided weighted endpoint estimates for the ϱ -variation ( ϱ > 2 ) operators of one-sided singular integrals under certain priori assumption by applying one-sided Calderón–Zygmund argument. Using one-sided sharp maximal estimates, we further prove that the ϱ -variation operators of related commutators are bounded on one-sided weighted Lebesgue and Morrey spaces. In addition, we also show that these operators are bounded from one-sided weighted Morrey spaces to one-sided weighted Campanato spaces. As applications, we obtain some results for the λ -jump operators and the numbers of up-crossings. Our main results represent one-sided extensions of many previously known ones. [ABSTRACT FROM AUTHOR]