BACKGROUND: Identifying the Non-Alcoholic Steatohepatitis (NASH) that can cause liver failure-based morbidity remains a challenging research problem since there is no confirmed and effective approach for its early and accurate diagnosis yet. A large amount of medical data is collected to diagnose the NASH where the majority of them are redundant. METHODS: This paper initially focuses on selecting the most informative blood test data among the collected big data with the Pearson correlation statistical approach and modified Particle Swarm Optimization with Artificial Neural Networks (PSO-ANN) machine learning algorithm. Then, a gradient based Batch Least Squares (BLS) and a search-based Artificial Bee Colony (ABC) machine learning algorithms are implemented to optimize the NASH prediction models. Confirmed operational NASH diagnosis supervise the statistical and machine learning algorithms to develop accurate prediction models. RESULTS: Two machine learning algorithms were trained and also validated with the varying number of selected input features. The results yielded that the trained BLS machine learning model is able to diagnose benign and malignant cases with 100% and 98% accuracies, respectively. The trained ABC machine learning algorithm diagnoses the benign and malignant cases with 90.5% and 94.3% accuracies, respectively.

With the rapid advancement of technology, assistive robotic entities have arisen as indispensable instruments within diverse Human-Robot Interaction (HRI)-based health-care applications. By integrating Artificial Intelligence (AI) into these assistive robotic entities, they gain the capacity to autonomously perceive, engage in sophisticated reasoning, and execute actions within highly dynamic and complex environments. In light of these impressive achievements, this paper highlights a three-stage exploratory overview of the literature on the remarkable advancement of assistive robotics in HRI-based health-care applications. The first stage initiates an assessment of assistive robotics spanning historical epochs from ancient to modern times. Following this, the second stage comprehensively explores assistive robotics investigations in the realm of HRI-based health-care with its four sub-fields including rehabilitation, geriatric-care, pediatric-care, and nursing. Finally, the third stage entails a thorough analysis of the common challenges encountered in these pertinent investigations and provides a set of recommendations. This comprehensive paper not only provides an abundance of studies for each concept, method, and application in HRI, but it also presents their theoretical foundations, strengths, gaps, critical challenges, and recommendations. The results of the conducted exploratory overview shed light on the noteworthy prominence of assistive robotic entities within the HRI-based health-care field. The acquired findings emphasize the positive impact of such entities on human health, affirming their pivotal role in contributing to the advancement and effectiveness of health-care interventions. Furthermore, this paper provides an opportunity for scholars and researchers actively engaged in the pertinent field to obtain comprehensive additional insights, serving as a guiding resource for their academic endeavors.

Abstract The current difficulties faced by evolutionary smart grids, as well as the widespread electric vehicles (EVs) into the modernised electric power system, highlight the crucial balance between electricity generation and consumption. Focusing on renewable energy sources instead of fossil fuels can provide an enduring environment for future generations by mitigating the impacts of global warming. At this time, the popularity of EVs has been ascending day by day due to the fact that they have several advantages such as being environmentally friendly and having better mileage performance in city driving over conventional vehicles. Despite the merits of the EVs, there are also a few disadvantages consisting of the integration of the EVs into the existing infrastructure and their expensiveness by means of initial investment cost. In addition to those, machine learning (ML)-based techniques are usually employed in the EVs for battery management systems, drive performance, and passenger safety. This paper aims to implement an EV monthly charging demand prediction by using a novel technique based on an ensemble of Pearson correlation (PC) and analysis of variance (ANOVA) along with statistical and ML-based algorithms including seasonal auto-regressive integrated moving average with exogenous variables (SARIMAX), convolutional neural networks (CNNs), extreme gradient boosting (XGBoost) decision trees, gated recurrent unit (GRU) networks, long short-term memory (LSTM) networks, bidirectional LSTM (Bi-LSTM) and GRU (Bi-GRU) networks for the Eastern Mediterranean Region of Türkiye. The performance and error metrics, including determination coefficient ( R $$^2$$ 2 ), mean absolute percentage error (MAPE), mean absolute error (MAE), and mean absolute scaled error (MASE), are evaluated in a benchmarking manner. According to the obtained results, in Scenario 1, a hybrid of PC and XGBoost decision trees model achieved an R $$^2$$ 2 of 96.21%, MAPE of 5.52%, MAE of 6.5, and MASE of 0.195 with a training time of 2.08 s and a testing time of 0.016 s. In Scenario 2, a combination of ANOVA and XGBoost decision trees model demonstrated an R $$^2$$ 2 of 96.83%, a MAPE of 5.29%, a MAE of 6.0, and a MASE of 0.180 with a training time of 1.62 s and a testing time of 0.012 s. These findings highlight the superior accuracy and computational efficiency of the XGBoost models for both scenarios compared to others and reveal XGBoost's suitability for EV charging demand prediction.

Thyroid cancer incidences endure to increase even though a large number of inspection tools have been developed recently. Since there is no standard and certain procedure to follow for the thyroid cancer diagnoses, clinicians require conducting various tests. This scrutiny process yields multi-dimensional big data and lack of a common approach leads to randomly distributed missing (sparse) data, which are both formidable challenges for the machine learning algorithms. This paper aims to develop an accurate and computationally efficient deep learning algorithm to diagnose the thyroid cancer. In this respect, randomly distributed missing data stemmed singularity in learning problems is treated and dimensionality reduction with inner and target similarity approaches are developed to select the most informative input datasets. In addition, size reduction with the hierarchical clustering algorithm is performed to eliminate the considerably similar data samples. Four machine learning algorithms are trained and also tested with the unseen data to validate their generalization and robustness abilities. The results yield 100% training and 83% testing preciseness for the unseen data. Computational time efficiencies of the algorithms are also examined under the equal conditions.

BACKGROUND: Blood test is extensively performed for screening, diagnoses and surveillance purposes. Although it is possible to automatically evaluate the raw blood test data with the advanced deep self-supervised machine learning approaches, it has not been profoundly investigated and implemented yet. RESULTS: This paper proposes deep machine learning algorithms with multi-dimensional adaptive feature elimination, self-feature weighting and novel feature selection approaches. To classify the health risks based on the processed data with the deep layers, four machine learning algorithms having various properties from being utterly model free to gradient driven are modified. CONCLUSIONS: The results show that the proposed deep machine learning algorithms can remove the unnecessary features, assign self-importance weights, selects their most informative ones and classify the health risks automatically from the worst-case low to worst-case high values.

Unmanned air vehicles operate in highly dynamic and unknown environments where they can encounter unexpected and unseen failures. In the presence of emergencies, autonomous unmanned air vehicles should be able to land at a minimum distance or minimum time. Impaired unmanned air vehicles define actuator failures and this impairment changes their unstable and uncertain dynamics; henceforth, path planning algorithms must be adaptive and model-free. In addition, path planning optimization problems must consider the unavoidable actuator saturations, kinematic and dynamic constraints for successful real-time applications. Therefore, this paper develops 3D path planning algorithms for quadrotors with parametric uncertainties and various constraints. In this respect, this paper constructs a multi-dimensional particle swarm optimization and a multi-dimensional genetic algorithm to plan paths for translational, rotational, and Euler angles and generates the corresponding control signals. The algorithms are assessed and compared both in the simulation and experimental environments. Results show that the multi-dimensional genetic algorithm produces shorter minimum distance and minimum time paths under the constraints. The real-time experiments prove that the quadrotor exactly follows the produced path utilizing the available maximum rotor speeds.

Multi-dimensional prediction models of the pandemic diseases should be constructed in a way to reflect their peculiar epidemiological characters. In this paper, a graph theory-based constrained multi-dimensional (CM) mathematical and meta-heuristic algorithms (MA) are formed to learn the unknown parameters of a large-scale epidemiological model. The specified parameter signs and the coupling parameters of the sub-models constitute the constraints of the optimization problem. In addition, magnitude constraints on the unknown parameters are imposed to proportionally weight the input-output data importance. To learn these parameters, a gradient-based CM recursive least square (CM-RLS) algorithm, and three search-based MAs; namely, the CM particle swarm optimization (CM-PSO), the CM success history-based adaptive differential evolution (CM-SHADE), and the CM-SHADEWO enriched with the whale optimization (WO) algorithms are constructed. The traditional SHADE algorithm was the winner of the 2018 IEEE congress on evolutionary computation (CEC) and its versions in this paper are modified to create more certain parameter search spaces. The results obtained under the equal conditions show that the mathematical optimization algorithm CM-RLS outperforms the MA algorithms, which is expected since it uses the available gradient information. However, the search-based CM-SHADEWO algorithm is able to capture the dominant character of the CM optimization solution and produce satisfactory estimates in the presence of the hard constraints, uncertainties and lack of gradient information.

Model-free control approaches require advanced exploration-exploitation policies to achieve practical tasks such as learning to bipedal robot walk in unstructured environments. In this article, we first construct a comprehensive exploration-exploitation policy that carries quality knowledge about the long-term predictor and the control policy, and the control signal of the model-free algorithms. Therefore, the developed model-free algorithm continues exploration by adjusting its unknown parameters until the desired learning and control are accomplished. Second, we provide an utterly model-free adaptive law enriched with the exploration-exploitation policy and derived step-by-step using the exact analogy of the model-based solution. The obtained adaptive control law considers the control signal saturation and the control signal (input) delay. Performed Lyapunov stability analysis ensures the convergence of the adaptive law that can also be used for intelligent control approaches. Third, we implement the adaptive algorithm in real time on a challenging benchmark system: a fourth-order, coupled dynamics, input saturated, and time-delayed underactuated manipulator. The results show that the proposed adaptive algorithm explores larger state-action spaces and treats the vanishing gradient problem in both learning and control. Also, we notice from the results that the learning and control properties of the adaptive algorithm are optimized as required.

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates.

Reinforcement learning (RL) algorithms attempt to learn optimal control actions by iteratively estimating a long-term measure of system performance, the so-called value function. For example, RL algorithms have been applied to walking robots to examine the connection between robot motion and the brain, which is known as embodied cognition. In this paper, RL algorithms are analysed using an exemplar test problem. A closed form solution for the value function is calculated and this is represented in terms of a set of basis functions and parameters, which is used to investigate parameter convergence. The value function expression is shown to have a polynomial form where the polynomial terms depend on the plant's parameters and the value function's discount factor. It is shown that the temporal difference error introduces a null space for the differenced higher order basis associated with the effects of controller switching (saturated to linear control or terminating an experiment) apart from the time of the switch. This leads to slow convergence in the relevant subspace. It is also shown that badly conditioned learning problems can occur, and this is a function of the value function discount factor and the controller switching points. Finally, a comparison is performed between the residual gradient and TD(0) learning algorithms, and it is shown that the former has a faster rate of convergence for this test problem.