Reinforcing optimization enabled interactive approach for liver tumor extraction in computed tomography images

Detecting liver abnormalities is a difficult task in radiation planning and treatment. The modern development integrates medical imaging into computer techniques. This advancement has monumental effect on how medical images are interpreted and analyzed. In many circumstances, manual segmentation of liver from computerized tomography (CT) imaging is imperative, and cannot provide satisfactory results. However, there are some difficulties in segmenting the liver due to its uneven shape, fuzzy boundary and complicated structure. This leads to necessity of enabling optimization in interactive segmentation approach. The main objective of reinforcing optimization is to search the optimal threshold and reduce the chance of falling into local optimum with survival of the fittest (SOF) technique. The proposed methodology makes use of pre-processing stage and reinforcing meta heuristics optimization based fuzzy c-means (FCM) for obtaining detailed information about the image. This information gives the optimal threshold value that is used for segmenting the region of interest with minimum user input. Suspicious areas are recognized from the segmented output. Both public and simulated dataset have been taken for experimental purposes. To validate the effectiveness of the proposed strategy, performance criteria such as dice coefficient, mode and user interaction level are taken and compared with state-of-the-art algorithms

Neighborhood search methods with Moth Optimization algorithm as a wrapper method for feature selection problems

Feature selection methods are used to select a subset of features from data, therefore only the useful information can be mined from the samples to get better accuracy and improves the computational efficiency of the learning model. Moth-flam Optimization (MFO) algorithm is a population-based approach, that simulates the behavior of real moth in nature, one drawback of the MFO algorithm is that the solutions move toward the best solution, and it easily can be stuck in local optima as we investigated in this paper, therefore, we proposed a MFO Algorithm combined with a neighborhood search method for feature selection problems, in order to avoid the MFO algorithm getting trapped in a local optima, and helps in avoiding the premature convergence, the neighborhood search method is applied after a predefined number of unimproved iterations (the number of tries fail to improve the current solution). As a result, the proposed algorithm shows good performance when compared with the original MFO algorithm and with state-of-the-art approaches

Computational Optimizations for Machine Learning

The present book contains the 10 articles finally accepted for publication in the Special Issue “Computational Optimizations for Machine Learning” of the MDPI journal Mathematics, which cover a wide range of topics connected to the theory and applications of machine learning, neural networks and artificial intelligence. These topics include, among others, various types of machine learning classes, such as supervised, unsupervised and reinforcement learning, deep neural networks, convolutional neural networks, GANs, decision trees, linear regression, SVM, K-means clustering, Q-learning, temporal difference, deep adversarial networks and more. It is hoped that the book will be interesting and useful to those developing mathematical algorithms and applications in the domain of artificial intelligence and machine learning as well as for those having the appropriate mathematical background and willing to become familiar with recent advances of machine learning computational optimization mathematics, which has nowadays permeated into almost all sectors of human life and activity