Author
Mahdi Aliyari Shoorehdeli
Other affiliations: Islamic Azad University, Science and Research Branch, Tehran, Islamic Azad University
Bio: Mahdi Aliyari Shoorehdeli is an academic researcher from K.N.Toosi University of Technology. The author has contributed to research in topic(s): Fuzzy control system & Control theory. The author has an hindex of 20, co-authored 157 publication(s) receiving 1812 citation(s). Previous affiliations of Mahdi Aliyari Shoorehdeli include Islamic Azad University, Science and Research Branch, Tehran & Islamic Azad University.
Papers
More filters
27 Jun 2007
TL;DR: This algorithm is shown to be a better interpretation of continuous PSO into discrete PSO than the older versions and a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.
Abstract: Particle swarm optimization (PSO) as a novel computational intelligence technique, has succeeded in many continuous problems. But in discrete or binary version there are still some difficulties. In this paper a novel binary PSO is proposed. This algorithm proposes a new definition for the velocity vector of binary PSO. It will be shown that this algorithm is a better interpretation of continuous PSO into discrete PSO than the older versions. Also a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.
316 citations
01 Mar 2009
TL;DR: It is shown that instability will not occur for the leaning rate and PSO factors in the presence of constraints and stable learning algorithms for two common methods are proposed based on Lyapunov stability theory and some constraints are obtained.
Abstract: This paper proposes a novel hybrid learning algorithm with stable learning laws for Adaptive Network based Fuzzy Inference System (ANFIS) as a system identifier and studies the stability of this algorithm. The new hybrid learning algorithm is based on particle swarm optimization (PSO) for training the antecedent part and forgetting factor recursive least square (FFRLS) for training the conclusion part. Two famous training algorithms for ANFIS are the gradient descent (GD) to update antecedent part parameters and using GD or recursive least square (RLS) to update conclusion part parameters. Lyapunov stability theory is used to study the stability of the proposed algorithms. This paper, also studies the stability of PSO as an optimizer in training the identifier. Stable learning algorithms for the antecedent and consequent parts of fuzzy rules are proposed. Some constraints are obtained and simulation results are given to validate the results. It is shown that instability will not occur for the leaning rate and PSO factors in the presence of constraints. The learning rate can be calculated on-line and will provide an adaptive learning rate for the ANFIS structure. This new learning scheme employs adaptive learning rate that is determined by input-output data. Also, stable learning algorithms for two common methods are proposed based on Lyapunov stability theory and some constraints are obtained.
124 citations
TL;DR: It is shown that applying PSO, a powerful optimizer, to optimally train the parameters of the membership function on the antecedent part of the fuzzy rules in ANFIS system is a stable approach which results in an identifier with the best trained model.
Abstract: This paper proposes a novel hybrid learning algorithm with stable learning laws for Adaptive Network-based Fuzzy Inference System (ANFIS) as a system identifier. The proposed hybrid learning algorithm is based on the particle swarm optimization (PSO) for training the antecedent part and the extended Kalman filter (EKF) for training the conclusion part. Lyapunov stability theory is used to study the stability of the proposed algorithm. Comparison results of the proposed approach, PSO algorithm for training the antecedent part and recursive least squares (RLSs) or EKF algorithm for training the conclusion part, with the other classical approaches such as, gradient descent, resilient propagation, quick propagation, Levenberg-Marquardt for training the antecedent part and RLSs algorithm for training the conclusion part are provided. Moreover, it is shown that applying PSO, a powerful optimizer, to optimally train the parameters of the membership function on the antecedent part of the fuzzy rules in ANFIS system is a stable approach which results in an identifier with the best trained model. Stability constraints are obtained and different simulation results are given to validate the results. Also, the stability of Levenberg-Marquardt algorithms for ANFIS training is analyzed.
102 citations
27 Jun 2007
TL;DR: One of the swarm intelligent branches, named particle swarm optimization (PSO) with some modification in it is applied to the training of all parameters of ANFIS structure and is compared with basic PSO and showed quite satisfactory results.
Abstract: This paper introduces a new approach for training the adaptive network based fuzzy inference system (ANFIS). The previous works emphasized on gradient base method or least square (LS) based method. In this study we apply one of the swarm intelligent branches, named particle swarm optimization (PSO) with some modification in it to the training of all parameters of ANFIS structure. These modifications are inspired by natural evolutions. Finally the method is applied to the identification of nonlinear dynamical system and is compared with basic PSO and showed quite satisfactory results.
96 citations
TL;DR: This study proposes a model-based robust fault detection and isolation (RFDI) method with hybrid structure that was tested on a single-shaft industrial gas turbine prototype model and has been evaluated based on the gas turbine data.
Abstract: This study proposes a model-based robust fault detection and isolation (RFDI) method with hybrid structure. Robust detection and isolation of the realistic faults of an industrial gas turbine in steady-state conditions is mainly considered. For residual generation, a bank of time-delay multilayer perceptron (MLP) models is used, and in fault detection step, a passive approach based on model error modelling is employed to achieve threshold adaptation. To do so, local linear neuro-fuzzy (LLNF) modelling is utilised for constructing error-model to generate uncertainty interval upon the system output in order to make decision whether a fault occurred or not. This model is trained using local linear model tree (LOLIMOT) which is a progressive tree-construction algorithm. Simple thresholding is also used along with adaptive thresholding in fault detection phase for comparative purposes. Besides, another MLP neural network is utilised to isolate the faults. In order to show the effectiveness of proposed RFDI method, it was tested on a single-shaft industrial gas turbine prototype model and has been evaluated based on the gas turbine data. A brief comparative study with the related works done on this gas turbine benchmark is also provided to show the pros and cons of the presented RFDI method.
51 citations
Cited by
More filters
Journal Article•
[...]
TL;DR: In this paper, two major figures in adaptive control provide a wealth of material for researchers, practitioners, and students to enhance their work through the information on many new theoretical developments, and can be used by mathematical control theory specialists to adapt their research to practical needs.
Abstract: This book, written by two major figures in adaptive control, provides a wealth of material for researchers, practitioners, and students. While some researchers in adaptive control may note the absence of a particular topic, the book‘s scope represents a high-gain instrument. It can be used by designers of control systems to enhance their work through the information on many new theoretical developments, and can be used by mathematical control theory specialists to adapt their research to practical needs. The book is strongly recommended to anyone interested in adaptive control.
1,680 citations
TL;DR: An in depth review of rare event detection from an imbalanced learning perspective and a comprehensive taxonomy of the existing application domains of im balanced learning are provided.
Abstract: 527 articles related to imbalanced data and rare events are reviewed.Viewing reviewed papers from both technical and practical perspectives.Summarizing existing methods and corresponding statistics by a new taxonomy idea.Categorizing 162 application papers into 13 domains and giving introduction.Some opening questions are discussed at the end of this manuscript. Rare events, especially those that could potentially negatively impact society, often require humans decision-making responses. Detecting rare events can be viewed as a prediction task in data mining and machine learning communities. As these events are rarely observed in daily life, the prediction task suffers from a lack of balanced data. In this paper, we provide an in depth review of rare event detection from an imbalanced learning perspective. Five hundred and seventeen related papers that have been published in the past decade were collected for the study. The initial statistics suggested that rare events detection and imbalanced learning are concerned across a wide range of research areas from management science to engineering. We reviewed all collected papers from both a technical and a practical point of view. Modeling methods discussed include techniques such as data preprocessing, classification algorithms and model evaluation. For applications, we first provide a comprehensive taxonomy of the existing application domains of imbalanced learning, and then we detail the applications for each category. Finally, some suggestions from the reviewed papers are incorporated with our experiences and judgments to offer further research directions for the imbalanced learning and rare event detection fields.
902 citations
TL;DR: This paper presents a comprehensive survey of the state-of-the-art work on EC for feature selection, which identifies the contributions of these different algorithms.
Abstract: Feature selection is an important task in data mining and machine learning to reduce the dimensionality of the data and increase the performance of an algorithm, such as a classification algorithm. However, feature selection is a challenging task due mainly to the large search space. A variety of methods have been applied to solve feature selection problems, where evolutionary computation (EC) techniques have recently gained much attention and shown some success. However, there are no comprehensive guidelines on the strengths and weaknesses of alternative approaches. This leads to a disjointed and fragmented field with ultimately lost opportunities for improving performance and successful applications. This paper presents a comprehensive survey of the state-of-the-art work on EC for feature selection, which identifies the contributions of these different algorithms. In addition, current issues and challenges are also discussed to identify promising areas for future research.
855 citations
TL;DR: Results prove the capability of the proposed binary version of grey wolf optimization (bGWO) to search the feature space for optimal feature combinations regardless of the initialization and the used stochastic operators.
Abstract: In this work, a novel binary version of the grey wolf optimization (GWO) is proposed and used to select optimal feature subset for classification purposes. Grey wolf optimizer (GWO) is one of the latest bio-inspired optimization techniques, which simulate the hunting process of grey wolves in nature. The binary version introduced here is performed using two different approaches. In the first approach, individual steps toward the first three best solutions are binarized and then stochastic crossover is performed among the three basic moves to find the updated binary grey wolf position. In the second approach, sigmoidal function is used to squash the continuous updated position, then stochastically threshold these values to find the updated binary grey wolf position. The two approach for binary grey wolf optimization (bGWO) are hired in the feature selection domain for finding feature subset maximizing the classification accuracy while minimizing the number of selected features. The proposed binary versions were compared to two of the common optimizers used in this domain namely particle swarm optimizer and genetic algorithms. A set of assessment indicators are used to evaluate and compared the different methods over 18 different datasets from the UCI repository. Results prove the capability of the proposed binary version of grey wolf optimization (bGWO) to search the feature space for optimal feature combinations regardless of the initialization and the used stochastic operators.
623 citations