CA : A Cancer Journal for Clinicians

Beginning with Emlen (1966) and MacArthur and Pianka (1966) and extending through the last ten years, several authors have sought to predict the foraging behavior of animals by means of mathematical models. These models are very similar,in that they all assume that the fitness of a foraging animal is a function of the efficiency of foraging measured in terms of some "currency" (Schoener, 1971) -usually energy- and that natural selection has resulted in animals that forage so as to maximize this fitness. As a result of these similarities, the models have become known as "optimal foraging models"; and the theory that embodies them, "optimal foraging theory." The situations to which optimal foraging theory has been applied, with the exception of a few recent studies, can be divided into the following four categories: (1) choice by an animal of which food types to eat (i.e., optimal diet); (2) choice of which patch type to feed in (i.e., optimal patch choice); (3) optimal allocation of time to different patches; and (4) optimal patterns and speed of movements. In this review we discuss each of these categories separately, dealing with both the theoretical developments and the data that permit tests of the predictions. The review is selective in the sense that we emphasize studies that either develop testable predictions or that attempt to test predictions in a precise quantitative manner. We also discuss what we see to be some of the future developments in the area of optimal foraging theory and how this theory can be related to other areas of biology. Our general conclusion is that the simple models so far formulated are supported are supported reasonably well by available data and that we are optimistic about the value both now and in the future of optimal foraging theory. We argue, however, that these simple models will requre much modification, espicially to deal with situations that either cannot easily be put into one or another of the above four categories or entail currencies more complicated that just energy.

Citation classic - optimal foraging - a selective review of theory and tests

Slime mould algorithm: A new method for stochastic optimization

We propose an independence criterion based on the eigen-spectrum of covariance operators in reproducing kernel Hilbert spaces (RKHSs), consisting of an empirical estimate of the Hilbert-Schmidt norm of the cross-covariance operator (we term this a Hilbert-Schmidt Independence Criterion, or HSIC). This approach has several advantages, compared with previous kernel-based independence criteria. First, the empirical estimate is simpler than any other kernel dependence test, and requires no user-defined regularisation. Second, there is a clearly defined population quantity which the empirical estimate approaches in the large sample limit, with exponential convergence guaranteed between the two: this ensures that independence tests based on HSIC do not suffer from slow learning rates. Finally, we show in the context of independent component analysis (ICA) that the performance of HSIC is competitive with that of previously published kernel-based criteria, and of other recently published ICA methods.

Measuring statistical dependence with Hilbert-Schmidt norms

Aquila Optimizer: A novel meta-heuristic optimization algorithm

Crow search algorithm (CSA) is a new natural inspired algorithm proposed by Askarzadeh in 2016. The main inspiration of CSA came from crow search mechanism for hiding their food. Like most of the optimization algorithms, CSA suffers from low convergence rate and entrapment in local optima. In this paper, a novel meta-heuristic optimizer, namely chaotic crow search algorithm (CCSA), is proposed to overcome these problems. The proposed CCSA is applied to optimize feature selection problem for 20 benchmark datasets. Ten chaotic maps are employed during the optimization process of CSA. The performance of CCSA is compared with other well-known and recent optimization algorithms. Experimental results reveal the capability of CCSA to find an optimal feature subset which maximizes the classification performance and minimizes the number of selected features. Moreover, the results show that CCSA is superior compared to CSA and the other algorithms. In addition, the experiments show that sine chaotic map is the appropriate map to significantly boost the performance of CSA.

Feature selection via a novel chaotic crow search algorithm

Salp Swarm Algorithm (SSA) is one of the most recently proposed algorithms driven by the simulation behavior of salps. However, similar to most of the meta-heuristic algorithms, it suffered from stagnation in local optima and low convergence rate. Recently, chaos theory has been successfully applied to solve these problems. In this paper, a novel hybrid solution based on SSA and chaos theory is proposed. The proposed Chaotic Salp Swarm Algorithm (CSSA) is applied on 14 unimodal and multimodal benchmark optimization problems and 20 benchmark datasets. Ten different chaotic maps are employed to enhance the convergence rate and resulting precision. Simulation results showed that the proposed CSSA is a promising algorithm. Also, the results reveal the capability of CSSA in finding an optimal feature subset, which maximizes the classification accuracy, while minimizing the number of selected features. Moreover, the results showed that logistic chaotic map is the optimal map of the used ten, which can significantly boost the performance of original SSA.

A novel chaotic salp swarm algorithm for global optimization and feature selection

Selecting the most discriminative features is a challenging problem in many applications. Bio-inspired optimization algorithms have been widely applied to solve many optimization problems including the feature selection problem. In this paper, the most discriminating features were selected by a new Chaotic Dragonfly Algorithm (CDA) where chaotic maps embedded with searching iterations of the Dragonfly Algorithm (DA). Ten chaotic maps were employed to adjust the main parameters of dragonflies’ movements through the optimization process to accelerate the convergence rate and improve the efficiency of DA. The proposed algorithm is employed for selecting features from the dataset that were extracted from the Drug bank database, which contained 6712 drugs. In this paper, 553 drugs that were bio-transformed into liver are used. This data have four toxic effects, namely, irritant, mutagenic, reproductive, and tumorigenic effect, where each drug is represented by 31 chemical descriptors. The proposed model is mainly comprised of three phases; data pre-processing, features selection, and the classification phase. In the data pre-processing phase, Synthetic Minority Over-sampling Technique (SMOTE) was used to solve the problem of the imbalanced dataset. At the features selection phase, the most discriminating features were selected using CDA. Finally, the selected features from CDA were used to feed Support Vector Machine (SVM) classifier at the classification phase. Experimental results proved the capability of CDA to find the optimal feature subset, which maximizing the classification performance and minimizing the number of selected features compared with DA and the other meta-heuristic optimization algorithms. Moreover, the experiments showed that Gauss chaotic map was the appropriate map to significantly boost the performance of DA. Additionally, the high obtained value of accuracy (81.82–96.08%), recall (80.84–96.11%), precision (81.45–96.08%) and F-Score (81.14–96.1%) for all toxic effects proved the robustness of the proposed model.

Chaotic dragonfly algorithm: an improved metaheuristic algorithm for feature selection

The whale optimization algorithm (WOA) is a novel evolutionary algorithm inspired by the behavior of whales. Similar to other evolutionary algorithms, entrapment in local optima and slow convergence speed are two probable problems it encounters in solving challenging real applications. This paper presents a novel chaotic whale optimization algorithm (CWOA) to overcome these problems where chaotic search is embedded in the searching iterations of WOA. Ten chaotic maps are considered to improve the performance of WOA. Experiments on ten benchmark datasets show the novel CWOA is effective for selecting relevant features with a high classification performance and a small number of features. Additionally the performance of CWOA is compared with WOA and ten other optimization algorithms. The experimental results show that circle chaotic map is the best chaotic map to significantly boost the performance of WOA. Moreover, chaotic with modifications of exploration operators outperform the highest performance.

A New Chaotic Whale Optimization Algorithm for Features Selection

This paper presents a hybrid algorithm based on using moth-flame optimization (MFO) algorithm with simulated annealing (SA), namely (SA-MFO). The proposed SA-MFO algorithm takes the advantages of both algorithms. It takes the ability to escape from local optima mechanism of SA and fast searching and learning mechanism for guiding the generation of candidate solutions of MFO. The proposed SA-MFO algorithm is applied on 23 unconstrained benchmark functions and four well-known constrained engineering problems. The experimental results show the superiority of the proposed algorithm. Moreover, the performance of SA-MFO is compared with well-known and recent meta-heuristic algorithms. The results show competitive results of SA-MFO concerning MFO and other meta-heuristic algorithms.

/pdf/a-hybrid-sa-mfo-algorithm-for-function-optimization-and-25f0n28cwb.pdf

Gehad Ismail Sayed

Papers

Feature selection via a novel chaotic crow search algorithm

A novel chaotic salp swarm algorithm for global optimization and feature selection

Chaotic dragonfly algorithm: an improved metaheuristic algorithm for feature selection

A New Chaotic Whale Optimization Algorithm for Features Selection

A hybrid SA-MFO algorithm for function optimization and engineering design problems