Evaluation of Different Time Domain Peak Models using Extreme Learning Machine‐Based Peak Detection for EEG Signal

Various peak models have been introduced to detect and analyze peaks in the time domain analysis of electroencephalogram (EEG) signals. In general, peak model in the time domain analysis consists of a set of signal parameters, such as amplitude, width, and slope. Models including those proposed by Dumpala, Acir, Liu, and Dingle are routinely used to detect peaks in EEG signals acquired in clinical studies of epilepsy or eye blink. The optimal peak model is the most reliable peak detection performance in a particular application. A fair measure of performance of different models requires a common and unbiased platform. In this study, we evaluate the performance of the four different peak models using the extreme learning machine (ELM)-based peak detection algorithm. We found that the Dingle model gave the best performance, with 72 % accuracy in the analysis of real EEG data. Statistical analysis conferred that the Dingle model afforded significantly better mean testing accuracy than did the Acir and Liu models, which were in the range 37–52 %. Meanwhile, the Dingle model has no significant difference compared to Dumpala model

Enhanced Nadaraya-Watson kernel regression: surface approximation for extremely small samples

The function approximation problem is to find the appropriate relationship between a dependent and independent variable(s). Function approximation algorithms generally require sufficient samples to approximate a function. Insufficient samples may cause any approximation algorithm to result in unsatisfactory predictions. To solve this problem, a function approximation algorithm called Weighted Kernel Regression (WKR), which is based on Nadaraya-Watson kernel regression, is proposed. In the proposed framework, the original Nadaraya-Watson kernel regression algorithm is enhanced by expressing the observed samples in a square kernel matrix. The WKR is trained to estimate the weight for the testing phase. The weight is estimated iteratively and is governed by the error function to find a good approximation model. Two experiments are conducted to show the capability of the WKR. The results show that the proposed WKR model is effective in cases where the target surface function is non-linear and the given training sample is small. The performance of the WKR is also compared with other existing function approximation algorithms, such as artificial neural networks (ANN)

Function and surface approximation based on enhanced kernel regression for small sample sets

The function approximation problem is to find the appropriate relationship between a dependent and independent variable(s). Function approximation algorithms generally require sufficient samples to approximate a function. Insufficient samples may cause any function approximation algorithm to result in unsatisfactory predictions. To solve this problem, a function approximation algorithm called Weighted Kernel Regression (WKR), which is based on Nadaraya-Watson kernel regression (NWKR), is proposed. In the proposed framework, the original NWKR algorithm is enhanced by expressing the observed samples in a square kernel matrix. The WKR is trained to estimate the weight for the testing phase. The weight is estimated iteratively and governed by the error function to find a good approximation model. Four experiments are conducted to show the capability of the WKR. The results show that the proposed WKR model is effective in cases where the target function is non-linear and the given training sample is small. The performance of the WKR is also compared with other existing function approximation algorithms, such as artificial neural networks (ANN)

Inferring gene regulatory networks from gene expression data by a dynamic Bayesian network-based model

Enabled by recent advances in bioinformatics, the inference of gene regulatory networks (GRNs) from gene expression data has garnered much interest from researchers. This is due to the need of researchers to understand the dynamic behavior and uncover the vast information lay hidden within the networks. In this regard, dynamic Bayesian network (DBN) is extensively used to infer GRNs due to its ability to handle time-series microarray data and modeling feedback loops. However, the efficiency of DBN in inferring GRNs is often hampered by missing values in expression data, and excessive computation time due to the large search space whereby DBN treats all genes as potential regulators for a target gene. In this paper, we proposed a DBN-based model with missing values imputation to improve inference efficiency, and potential regulators detection which aims to lessen computation time by limiting potential regulators based on expression changes. The performance of the proposed model is assessed by using time-series expression data of yeast cell cycle. The experimental results showed reduced computation time and improved efficiency in detecting gene-gene relationships

A novel multi-state gravitational search algorithm for discrete optimization problems

The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. Many improvements of the binary-based algorithms have been reported. In this paper, a variant of GSA called multi-state gravitational search algorithm (MSGSA) for discrete optimization problems is proposed. The MSGSA concept is based on a simplified mechanism of transition between two states. The performance of the MSGSA is empirically compared to the original BGSA based on six sets of selected benchmarks instances of traveling salesman problem (TSP). The results are statistically analyzed and show that the MSGSA has performed consistently in solving the discrete optimization problems

Inferring gene regulatory networks from gene expression data by a dynamic Bayesian network-based model

Enabled by recent advances in bioinformatics, the inference of gene regulatory networks (GRNs) from gene expression data has garnered much interest from researchers. This is due to the need of researchers to understand the dynamic behavior and uncover the vast information lay hidden within the networks. In this regard, dynamic Bayesian network (DBN) is extensively used to infer GRNs due to its ability to handle time-series microarray data and modeling feedback loops. However, the efficiency of DBN in inferring GRNs is often hampered by missing values in expression data, and excessive computation time due to the large search space whereby DBN treats all genes as potential regulators for a target gene. In this paper, we proposed a DBN-based model with missing values imputation to improve inference efficiency, and potential regulators detection which aims to lessen computation time by limiting potential regulators based on expression changes. The performance of the proposed model is assessed by using time-series expression data of yeast cell cycle. The experimental results showed reduced computation time and improved efficiency in detecting gene-gene relationships

Evaluation Of Different Peak Models Of Eye Blink Eeg For Signal Peak Detection Using Artificial Neural Network

There is a growing interest of research being conducted on detecting eye blink to assist physically impaired people for verbal communication and controlling devices using electroencephalogram (EEG) signal. One particular eye blink can be determined from use of peak points. Therefore, the purpose of peak detection algorithm is to distinguish an actual peak location from a list of peak candidates. The need of a good peak model is important in ensuring a satisfy classification performance. In general, there are various peak models available in literature, which have been tested in several peak detection algorithms. In this study, performance evaluation of the existing peak models is conducted based on Artificial Neural Network (ANN) with particle swarm optimization (PSO) as learning algorithm. This study evaluates the performance of eye blink EEG signal peak detection algorithm for four different peak models which are Dumpala’s, Acir’s, Liu’s, and Dingle’s peak models. To generalize the performance evaluation, two case studies of eye blink EEG signal are considered, which are single and double eye blink signals. It has been observed that the best test performance, in average, is 91.94% and 87.47% for single and double eye blink signals, respectively. These results indicate that the Acir’s peak model offers high accuracy of peak detection for the two eye blink EEG signals as compared to other peak models. The result of statistical analysis also indicates that the Acir’s peak model is better than Dingle’s and Dumpala’s peak models

A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and Swap Operator

The simulated Kalman filter (SKF) is an algorithm for population-based optimization based on the Kalman filter framework. Each agent in SKF is treated as a Kalman filter. The SKF utilizes a Kalman filter process that includes prediction, measurement, and estimation to determine the global optimum. However, the SKF can only operate in the numerical search space. Numerous approaches and modifications have been used in the literature to enable numerical meta-heuristic algorithms to operate in a discrete search space. This paper presents modifications to measurement and estimation in the SKF by utilizing mutation and Hamming distance technique to accommodate the discrete search space. The modified algorithm is called Discrete Simulated Kalman Filter Optimizer (DSKFO). Additionally, the DSKFO algorithm incorporates the swap operator as an extension to improve the solution in solving the travelling salesman problem (TSP). The DSKFO algorithm was compared against four other combinatorial SKF algorithms and outperformed them all

Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

Simulated Kalman Filter (SKF) solves optimization problems by finding the estimate of the optimum solution. As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. This paper presented an overview of the research progress in SKF from the day it was introduced until the present day, discussing the progress, improvements, modifications, and applications of SKF. The fundamental and standard algorithm were first introduced. Then, the work on the algorithm improvements was surveyed. Finally, the remaining unresolved problems and some directions of SKF research were discussed. We reviewed 57 SKF papers. 16 of them on fundamental improvements, 9 on extension of the algorithm to discrete problems and 25 on their applications. Researchers have worked on ideas to improve exploration capability to prevent premature convergence by trying prediction operators, opposition-based learning, and different iteration strategies. There were also attempts to hybridize SKF with other famous algorithms such as Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Sine Cosine Algorithm (SCA) to improve its performance. Lastly, a single-agent variant of SKF and a multi-objective SKF were introduced. SKF algorithms and its variants have been implemented in at least nine areas of applications: drill path optimization, airport gate allocation problem (AGAP), assembly sequence planning (ASP), system identification, feature selection, image template matching, controller tuning, wireless sensor network, and engineering design problem. The literature reviewed solely depended on the keyword search that contained the terms simulated Kalman filter from December 2015 to the present date. This is the first review paper on SKF. It is hoped that this survey would be beneficial for the researchers of this area and attracting interest towards the algorithm

A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and 2-Opt Operator

The simulated Kalman filter (SKF) is an algorithm for population-based optimization based on the Kalman filter framework. Each agent in SKF is treated as a Kalman filter. To find the global optimum, the SKF employs a Kalman filter mechanism that includes prediction, measurement, and estimate. However, the SKF is limited to operating in the numerical search space only. Numerous techniques and modifications have been made to numerical meta-heuristic algorithms in the literature in order to enable them to operate in a discrete search space. This paper presents modifications to measurement and estimation in SKF to accommodate the discrete search space. The modified algorithm is called Discrete Simulated Kalman Filter Optimizer (DSKFO). Additionally, the DSKFO algorithm incorporates the 2-opt operator to improve the solution in solving the travelling salesman problem (TSP). The DSKFO algorithm was compared against four other combinatorial SKF algorithms and outperformed them all