Search

Gross Domestic Product (GDP) is significant for measuring the strength of national and global economies in urban profiling areas. GDP is significant because it provides information on the size and performance of an economy. The real GDP growth rate is frequently used to indicate the economy's health. This paper proposes a new model called Pearson Correlation-Long Short-Term Memory-Recurrent Neural Network (PC-LSTM-RNN) for predicting GDP in urban profiling areas. Pearson correlation is used to select the important features strongly correlated with the target feature. This study employs two separate datasets, denoted as Dataset A and Dataset B. Dataset A comprises 227 instances and 20 features, with 70% utilized for training and 30% for testing purposes. On the other hand, Dataset B consists of 61 instances and 4 features, encompassing historical GDP growth data for India from 1961 to 2021. To enhance GDP prediction performance, we implement a parameter transfer approach, fine-tuning the parameters learned from Dataset A on Dataset B. Moreover, in this study, a preprocessing stage that includes median imputation and data normalization is performed. Mean Square Error, Mean Absolute Error, Root Mean Square Error, Mean Absolute Percentage Error, Median Absolute Error, and determination coefficient (R2) evaluation metrics are utilized in this study to demonstrate the performance of the proposed model. The experimental results demonstrated that the proposed model gave better results than other regression models used in this study. Also, the results show that the proposed model achieved the highest results for R2, with 99.99%. This paper addresses a critical research gap in the domain of GDP prediction through artificial intelligence (AI) algorithms. While acknowledging the widespread application of such algorithms in forecasting GDP, the proposed model introduces distinctive advantages over existing approaches. Using PC-LSTM-RNN which achieves high R2 with minimum error rates. [ABSTRACT FROM AUTHOR]

Context and Background: This paper addresses the challenge of encoding and decoding numerical data by introducing innovative algorithms utilizing Neutrosophic ASCII codes and ASCII Neutrosophic codes. These codes serve to represent uncertain or imprecise character values through the incorporation of neutrosophic numbers, encompassing degrees of truth, falsity, and indeterminacy. Motivation: The study stems from the necessity to effectively represent uncertain or imprecise character values in numerical data. This is crucial in diverse applications where handling uncertain or ambiguous data is a prevalent concern. Hypothesis: We hypothesize that employing Neutrosophic ASCII codes and ASCII Neutrosophic codes in encoding and decoding numerical data can provide a robust solution for representing uncertain or imprecise character values. Methods: The encoding algorithm in this study transforms each character in the ASCII string into its corresponding ASCII code, utilizing either 7 or 8 bits based on the code type. This algorithm calculates the degree of truth, falsity, and indeterminacy for each bit, considering the uncertainty or ambiguity associated with the character. The resulting neutrosophic numbers are appended to create the Neutrosophic ASCII code or ASCII Neutrosophic code. The decoding algorithm partitions the code into groups of neutrosophic numbers, calculates the associated degrees of truth, falsity, and indeterminacy for each ASCII bit, and converts the neutrosophic numbers back to ASCII codes, reconstructing the original ASCII character string. Results: Our study yields a novel and effective approach for encoding and decoding numerical data, demonstrating the potential of Neutrosophic ASCII codes and ASCII Neutrosophic codes in representing uncertain or imprecise character values. Conclusions: The proposed algorithms offer a promising solution for handling uncertain or ambiguous data in numerical encoding and decoding. The specific and quantitative results highlight the efficacy of Neutrosophic ASCII codes and ASCII Neutrosophic codes, showcasing their potential applicability in various domains requiring robust solutions for uncertain or imprecise character representation in numerical data. [ABSTRACT FROM AUTHOR]

Vehicular adhoc network (VANET) plays a vital role in smart transportation. VANET includes a set of vehicles that communicate with one another via wireless links. The vehicular communication in VANET necessitates an intelligent clustering protocol to maximize energy efficiency. Since energy acts as an essential factor in the design of VANET, energy-aware clustering protocols depending upon metaheuristic optimization algorithms are required to be developed. This study introduces an intelligent energy-aware oppositional chaos game optimization-based clustering (IEAOCGO-C) protocol for VANET. The presented IEAOCGO-C technique aims to select cluster heads (CHs) in the network proficiently. The proposed IEAOCGO-C model constructs clusters based on oppositional-based learning (OBL) with the chaos game optimization (CGO) algorithm to improve efficiency. Besides, it computes a fitness function involving five parameters, namely throughput (THRPT), packet delivery ratio (PDR), network lifetime (NLT), end to end delay (ETED) and energy consumption (ECM). The experimental validation of the proposed model is accomplished, and the outcomes are studied in numerous aspects with existing models under several vehicles and measures. The simulation outcomes reported the enhanced performance of the proposed approach over the recent technologies. As a result, it has resulted in maximal NLT (4480), minimal ECM (65.6), maximal THRPT (81.6), maximal PDR (84.5), and minimal ETED (6.7) as average values over the other methods under all vehicle numbers. [ABSTRACT FROM AUTHOR]

The issue of privacy in clinical data restricts data sharing among various organizations because of legal and ethical concerns. Every medical organization (hospital, research center, testing lab, etc.) needs to protect personal and medical data privacy and confidentiality while also sharing data with efficient and accurate learning models for various diseases. This paper addresses a method that combines machine learning approaches on blockchain network for classification of patients with liver disease or not, while maintaining the privacy and enabling data sharing. The contribution of this paper is five-folds: (i) To deal with the liver disease dataset, data preprocessing phases are utilized (i.e., missing data treatment, data normalization, and data transformation). (ii) For feature reduction, two feature selection models are used: correlation feature selection (CFS) and wrapper metaheuristic (PSO+KNN). For training the proposed global model, the selected features (10, 4, 3) from the three models (all features, CFS, PSO+KNN) are distributed to the shared blockchain network. (iii) To detect liver disease in the preprocessed dataset, three machine learning methods are proposed: random forest, decision tree (J48), and Naïve Bayes. (iv) The distributed network (blockchain) will publish the results of the liver disease diagnosis on the network. (v) The smart contract shares the data and diagnosis between the medical organizations for future processing. An empirical study is executed to validate the relevance of our suggested framework for early diagnosis of liver disease using blockchain and machine learning models. The experimental results showed that feature selection using the wrapper metaheuristic (PSO+KNN) with a random forest model achieves the best performance with the minor features for detecting liver disease with an accuracy of 99.9 compared to 99.2, 89.2 for Naïve Bayes, and J48, respectively. [ABSTRACT FROM AUTHOR]

Forecasting is defined as the process of estimating the change in uncertain situations. One of the most vital aspects of many applications is temperature forecasting. Using the Daily Delhi Climate Dataset, we utilize time series forecasting techniques to examine the predictability of temperature. In this paper, a hybrid forecasting model based on the combination of Wavelet Decomposition (WD) and Seasonal Auto-Regressive Integrated Moving Average with Exogenous Variables (SARIMAX) was created to accomplish accurate forecasting for the temperature in Delhi, India. The range of the dataset is from 2013 to 2017. It consists of 1462 instances and four features, and 80% of the data is used for training and 20% for testing. First, the WD decomposes the non-stationary data time series into multi-dimensional components. That can reduce the original time series' volatility and increase its predictability and stability. After that, the multi-dimensional components are used as inputs for the SARIMAX model to forecast the temperature in Delhi City. The SARIMAX model employed in this work has the following order: (4, 0, 1). (4, 0, [1], 12). The experimental results demonstrated that WD-SARIMAX performs better than other recent models for forecasting the temperature in Delhi city. The Mean Square Error (MSE), Mean Absolute Error (MAE), Median Absolute Error (MedAE), Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE), and determination coefficient ( R 2 ) of the proposed WD-SARIMAX model are 2.8, 1.13, 0.76, 1.67, 4.9, and 0.91, respectively. Furthermore, the WD-SARIMAX model utilized the proposed to forecast the temperature in Delhi over the next eight years, from 2017 to 2025. [ABSTRACT FROM AUTHOR]

The need to evolve a novel feature selection (FS) approach was motivated by the persistence necessary for a robust FS system, the time‐consuming exhaustive search in traditional methods, and the favourable swarming manner in various optimization techniques. Most of the datasets have a high dimension in many issues since all features are not crucial to the problem, which reduces the algorithm's accuracy and efficiency. This article presents a hybrid feature selection approach to solve the low precision and tardy convergence of the butterfly optimization algorithm (BOA). The proposed method is dependent on combining the algorithm of BOA and the particle swarm optimization (PSO) as a search methodology using a wrapper framework. BOA is started with a one‐dimensional cubic map in the proposed approach, and a non‐linear parameter control technique is also implemented. To boost the basic BOA for global optimization, PSO algorithm is mixed with the butterfly optimization algorithm (BOAPSO). A 25 dataset evaluates the proposed BOAPSO to determine its efficiency with three metrics: classification precision, the selected features, and the computational time. A COVID‐19 dataset has been used to evaluate the proposed approach. Compared to the previous approaches, the findings show the supremacy of BOAPSO for enhancing performance precision and minimizing the number of chosen features. Concerning the accuracy, the experimental outcomes demonstrate that the proposed model converges rapidly and performs better than with the PSO, BOA, and GWO with improvement percentages: 91.07%, 87.2%, 87.8%, 87.3%, respectively. Moreover, the proposed model's average selected features are 5.7 compared to the PSO, BOA, and GWO, with average features 22.5, 18.05, and 23.1, respectively. [ABSTRACT FROM AUTHOR]