Aboul Ella Hassanien (Abo)

In this paper, a system for feature selection based on firefly algorithm (FFA) optimization is proposed. Data sets ordinarily includes a huge number of attributes, with irrelevant and redundant attributes. Redundant and irrelevant attributes might reduce the classification accuracy because of the large search space. The main goal of attribute reduction is to choose a subset of relevant attributes from a huge number of available attributes to obtain comparable or even better classification accuracy from using all attributes. A system for feature selection is proposed in this paper using a modified version of the firefly algorithm (FFA) optimization. The modified FFA algorithm adaptively balance the exploration and exploitation to quickly find the optimal solution. FFA is a new evolutionary computation technique, inspired by the flash lighting process of fireflies. The FFA can quickly search the feature space for optimal or near-optimal feature subset minimizing a given fitness function. The proposed fitness function used incorporate both classification accuracy and feature reduction size. The proposed system was tested on eighteen data sets and proves advance over other search methods as particle swarm optimization (PSO) and genetic algorithm (GA) optimizers commonly used in this context using different evaluation indicators

Fish detection and identication are important steps towards
monitoring sh behavior. The importance of such monitoring step comes
from the need for better understanding of the sh ecology and issuing
conservative actions for keeping the safety of this vital food resource.
The recent advances in machine learning approaches allow many appli-
cations to easily analyze and detect a number of sh species. The main
competence between these approaches is based on two main detection
parameters: the time and the accuracy measurements. Therefore, this
paper proposes a sh detection approach based on BAT optimization
algorithm (BA). This approach aims to reduce the classication time
within the sh detection process. The performance of this system was
evaluated by a number of well-known machine learning classiers, KNN,
ANN, and SVM. The approach was tested with 151 images to detect the
Nile Tilapia sh species and the results showed that k-NN can achieve
high accuracy 90%, with feature reduction ratio

Fish image segmentation can be considered an essential process in developing a system for fish recognition. This task is challenging as different specimens, rotations, positions, illuminations, and backgrounds exist in fish images. In this research, a segmentation model is proposed for fish images using Salp Swarm Algorithm (SSA). The segmentation is formulated using Simple Linear Iterative Clustering (SLIC) method with initial parameters optimized by the SSA. The SLIC method is used to cluster image pixels to generate compact and nearly uniform superpixels. Finally, a thresholding using Otsu’s method helped to produce satisfactory results of extracted fishes from the original images under different conditions. A fish dataset consisting of real-world images was tested. In experiments, the proposed model shows robustness for different cases compared to conventional work.

Accurate forecasting for future events constitutes a fascinating challenge for theoretical and for applied researches. Foreign Exchange market (FOREX) is selected in this research to represent an example of financial systems with a complex behavior. Forecasting a financial time series can be a very hard task due to the inherent uncertainty nature of these systems. It seems very difficult to tell whether a series is stochastic or deterministic chaotic or some combination of these states. More generally, the extent to which a non-linear deterministic process retains its properties when corrupted by noise is also unclear. The noise can affect a system in different ways even though the equations of the system remain deterministic. Since a single reliable statistical test for chaoticity is not available, combining multiple tests is a crucial aspect, especially when one is dealing with limited and noisy data sets like in economic and financial time series. In this research, the authors propose an improved model for forecasting exchange rates based on chaos theory that involves phase space reconstruction from the observed time series and the use of support vector regression (SVR) for forecasting.Given the exchange rates of a currency pair as scalar observations, observed time series is first analyzed to verify the existence of underlying nonlinear dynamics governing its evolution over time. Then, the time series is embedded into a higher dimensional phase space using embedding parameters.In the selection process to find the optimal embedding parameters,a novel method based on the Differential Evolution (DE) geneticalgorithm(as a global optimization technique) was applied. The authors have compared forecasting accuracy of the proposed model against the ordinary use of support vector regression. The experimental results demonstrate that the proposed method, which is based on chaos theory and genetic algorithm,is comparable with the existing approaches.

The main purpose of this paper is to show the use of formal concept analysis (FCA) as data mining approach for mining the common hypermethylated genes between breast cancer subtypes, by extracting formal concepts which representing sets of significant hypermethylated genes for each breast cancer subtypes, then the formal context is built which leading to construct a concept lattice which is composed of formal concepts. This lattice can be used as knowledge discovery and knowledge representation therefore, becoming more interesting for the biologists.

Learning methods and approximation algorithms are fundamental tools that deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems have a large number of applications arising from a variety of fields, such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, scheduling problems and so on. The past years have witnessed a large number of interesting applications using various techniques of Computational Intelligence such as rough sets, connectionist learning; fuzzy logic; evolutionary computing; artificial immune systems; swarm intelligence; reinforcement learning, intelligent multimedia processing etc.. In spite of numerous successful applications of Computational Intelligence in business and industry, it is sometimes difficult to explain the performance of these techniques and algorithms from a theoretical perspective. Therefore, we encouraged authors to present original ideas dealing with the incorporation of different mechanisms of Computational Intelligent dealing with Learning and Approximation algorithms and underlying processes.

Human reasoning usually is very approximate and involves various types of uncertainties. Approximate reasoning is the computational modelling of any part of the process used by humans to reason about natural phenomena or to solve real world problems. The scope of this book includes fuzzy sets, Dempster-Shafer theory, multi-valued logic, probability, random sets, and rough set, near set and hybrid intelligent systems. Besides research articles and expository papers on theory and algorithms of approximation reasoning, papers on numerical experiments and real world applications were also encouraged. This Volume comprises of 12 chapters including an overview chapter providing an up-to-date and state-of-the research on the applications of Computational Intelligence techniques for approximation reasoning. The Volume is divided into 2 parts: Part-I: Approximate Reasoning – Theoretical Foundations and Part-II: Approximate Reasoning – Success Stories and Real World Applications

Global optimization is a branch of applied mathematics and numerical analysis that deals with the task of finding the absolutely best set of admissible conditions to satisfy certain criteria / objective function(s), formulated in mathematical terms. Global optimization includes nonlinear, stochastic and combinatorial programming, multiobjective programming, control, games, geometry, approximation, algorithms for parallel architectures and so on. Due to its wide usage and applications, it has gained the attention of researchers and practitioners from a plethora of scientific domains. Typical practical examples of global optimization applications include: Traveling salesman problem and electrical circuit design (minimize the path length); safety engineering (building and mechanical structures); mathematical problems (Kepler conjecture); Protein structure prediction (minimize the energy function) etc.

Computational tools or solutions based on intelligent systems are being used with great success in Data Mining applications. Nature has been very successful in providing clever and efficient solutions to different sorts of challenges and problems posed to organisms by ever-changing and unpredictable environments. It is easy to observe that strong scientific advances have been made when issues from different research areas are integrated. A particularly fertile integration combines biology and computing. Computational tools inspired on biological process can be found in a large number of applications. One of these applications is Data Mining, where computing techniques inspired on nervous systems; swarms, genetics, natural selection, immune systems and molecular biology have provided new efficient alternatives to obtain new, valid, meaningful and useful patterns in large datasets.

Approximation theory is that area of analysis which is concerned with the ability to approximate functions by simpler and more easily calculated functions. It is an area which, like many other fields of analysis, has its primary roots in the mathematics.The need for function approximation and classification arises in many branches of applied mathematics, computer science and data mining in particular.