Breast cancer is a common cause of female mortality in developing countries. Early detection and treatment are crucial for successful outcomes. Breast cancer develops from breast cells and is considered a leading cause of death in women. This disease is classified into two subtypes: invasive ductal carcinoma (IDC) and ductal carcinoma in situ (DCIS). The advancements in artificial intelligence (AI) and machine learning (ML) techniques have made it possible to develop more accurate and reliable models for diagnosing and treating this disease. From the literature, it is evident that the incorporation of MRI and convolutional neural networks (CNNs) is helpful in breast cancer detection and prevention. In addition, the detection strategies have shown promise in identifying cancerous cells. The CNN Improvements for Breast Cancer Classification (CNNI-BCC) model helps doctors spot breast cancer using a trained deep learning neural network system to categorize breast cancer subtypes. However, they require significant computing power for imaging methods and preprocessing. Therefore, in this research, we proposed an efficient deep learning model that is capable of recognizing breast cancer in computerized mammograms of varying densities. Our research relied on three distinct modules for feature selection: the removal of low-variance features, univariate feature selection, and recursive feature elimination. The craniocaudally and medial-lateral views of mammograms are incorporated. We tested it with a large dataset of 3002 merged pictures gathered from 1501 individuals who had digital mammography performed between February 2007 and May 2015. In this paper, we applied six different categorization models for the diagnosis of breast cancer, including the random forest (RF), decision tree (DT), k-nearest neighbors (KNN), logistic regression (LR), support vector classifier (SVC), and linear support vector classifier (linear SVC). The simulation results prove that our proposed model is highly efficient, as it requires less computational power and is highly accurate.

In this research work, an effective Levenberg–Marquardt algorithm‐based artificial neural network (LMA‐BANN) model is presented to find an accurate series solution for micropolar flow in a porous channel with mass injection (MPFPCMI). The LMA is one of the fastest backpropagation methods used for solving least‐squares of nonlinear problems. We create a dataset to train, test, and validate the LMA‐BANN model regarding the solution obtained by optimal homotopy asymptotic (OHA) method. The proposed model is evaluated by conducting experiments on a dataset acquired from the OHA method. The experimental results are obtained by using mean square error (MSE) and absolute error (AE) metric functions. The learning process of the adjustable parameters is conducted with efficacy of the LMA‐BANN model. The performance of the developed LMA‐BANN for the modelled problem is confirmed by achieving the best promise numerical results of performance in the range of E‐05 to E‐08 and also assessed by error histogram plot (EHP) and regression plot (RP) measures.

Brain cancer is a bad disease and affects millions of people in worldwide. Approximately 70% of patients diagnosed with this disease do not survive. The Machine learning is a promising and recent development in this area. However, very limited research is performed in this direction. Therefore, in this research, we propose an evolutionary lightweight model aimed at detecting brain cancer and classification, starting from the analysis of magnetic resonance images. The proposed model named lightweight ensemble combines (weighted average and lightweight combines multiple XGBoost decision trees) is the modified version of the recent Multimodal Lightweight XGBoost. Herein, we provide prediction explain ability by considering the preprocessing of Magnetic Resonance Imaging (MRI) data and the feature extraction (Intensity, texture, and shape). The process in the evolutionary model involves a various step - first, prepare the data, extract important features, and finally, merge together using a special kind of classification called ensemble classification. We evaluate our proposed model using BraTS 2020 dataset. The dataset consists of 285 MRI scans of patients diagnosed with gliomas. The simulation results showed that our proposed model achieved 93.0% accuracy, 0.94 precision, 0.93 recall, 0.94 F1 score, and an area under Receiver Operating Characteristic Curve (AUC-ROC) value of 0.984. The efficient results demonstrate the effectiveness of our proposed model for brain tumor grading and classification using four grades. The efficient results show the potential of our proposed approach as a valuable tool for early diagnosis and effective treatment planning of brain tumors. Finally, the proposed model holds promise for aiding in early cancer diagnosis and treatment.

In the domains of computational and applied mathematics, soft computing, fuzzy logic, and machine learning (ML) are well-known research areas. ML is one of the computational intelligence aspects that may address diverse difficulties in a wide range of applications and systems when it comes to exploitation of historical data. Predicting medical insurance costs using ML approaches is still a problem in the healthcare industry that requires investigation and improvement. Using a series of machine learning algorithms, this study provides a computational intelligence approach for predicting healthcare insurance costs. The proposed research approach uses Linear Regression, Support Vector Regression, Ridge Regressor, Stochastic Gradient Boosting, XGBoost, Decision Tree, Random Forest Regressor, Multiple Linear Regression, and k-Nearest Neighbors A medical insurance cost dataset is acquired from the KAGGLE repository for this purpose, and machine learning methods are used to show how different regression models can forecast insurance costs and to compare the models’ accuracy. The results shows that the Stochastic Gradient Boosting (SGB) model outperforms the others with a cross-validation value of 0.0.858 and RMSE value of 0.340 and gives 86% accuracy.

This paper presents an adaptation of the flying ant colony optimization (FACO) algorithm to solve the traveling salesman problem (TSP). This new modification is called dynamic flying ant colony optimization (DFACO). FACO was originally proposed to solve the quality of service (QoS)-aware web service selection problem. Many researchers have addressed the TSP, but most solutions could not avoid the stagnation problem. In FACO, a flying ant deposits a pheromone by injecting it from a distance; therefore, not only the nodes on the path but also the neighboring nodes receive the pheromone. The amount of pheromone a neighboring node receives is inversely proportional to the distance between it and the node on the path. In this work, we modified the FACO algorithm to make it suitable for TSP in several ways. For example, the number of neighboring nodes that received pheromones varied depending on the quality of the solution compared to the rest of the solutions. This helped to balance the exploration and exploitation strategies. We also embedded the 3-Opt algorithm to improve the solution by mitigating the effect of the stagnation problem. Moreover, the colony contained a combination of regular and flying ants. These modifications aim to help the DFACO algorithm obtain better solutions in less processing time and avoid getting stuck in local minima. This work compared DFACO with (1) ACO and five different methods using 24 TSP datasets and (2) parallel ACO (PACO)-3Opt using 22 TSP datasets. The empirical results showed that DFACO achieved the best results compared with ACO and the five different methods for most of the datasets (23 out of 24) in terms of the quality of the solutions. Further, it achieved better results compared with PACO-3Opt for most of the datasets (20 out of 21) in terms of solution quality and execution time.

The Internet of Medical Things (IoMT) has revolutionized healthcare by bringing real-time monitoring and data-driven treatments. Nevertheless, the security of communication between IoMT devices and servers remains a huge problem because of the inherent sensitivity of the health data and susceptibility to cyber threats. Current security solutions, including simple password-based authentication and standard Public Key Infrastructure (PKI) approaches, typically do not achieve an appropriate balance between security and low computational overhead, resulting in the possibility of performance bottlenecks and increased vulnerability to attacks. To overcome these limitations, we present an intelligent two-phase dual authentication framework that improves the security of sensor-to-server communication in IoMT environments. During the registration phase, our framework is based on Elliptic Curve Diffie-Hellman (ECDH) for rapid key exchange, and during real-time communication, our framework uses the Advanced Encryption Standard Galois Counter Mode (AES-GCM) to encrypt data securely. The efficiency of the proposed framework was rigorously tested through simulations that evaluated encryption-decryption time, computational cost, latency, and packet delivery ratio. The security resilience was also evaluated against man-in-the-middle, replay, and brute force attacks. The results show that encryption/decryption time is reduced by over 45%, overall computational cost by 45.38%, and latency by 28.42% over existing approaches. Furthermore, the framework achieved a high packet delivery ratio and strong defense against cyber threats for maintaining the confidentiality and integrity of the medical data across IoMT networks. However, the dual authentication approach doesn’t affect the functionality of medical IoT devices while enhancing IoMT security, which makes it an ideal integration option for existing healthcare systems.