Search

Diseases, natural disasters, and other emergencies force the economy and management system to confront nonlinear and random changes. In recent years, complexity science has attracted much attention. Complex economics believes that economic models are dynamic, stochastic, and unpredictable, and that equilibrium and stability are temporary. It is changing traditional economic theory. Based on complexity theory, bibliometric theory, nonlinear theory, and game theory, combined with knowledge graph methods, the article analyzed 200 papers from the Web of Science, covering the period 1998–2022. This research presents the research structure and theoretical evolution of complex economic games through visualization techniques. The clusters of keywords and the logical relationships between them are discussed. Then, the analysis of hot keywords and co-occurrence keywords is carried out. Finally, future research directions for complex economic games are given: (1) the market complexity that comes with intelligent expectations, (2) complex characteristics of the data trading market, and (3) complex risk control for emergencies. The innovation lies in the use of data analysis software combined with manual knowledge to overcome the shortcomings of inflexible software analysis, as well as weak manual storage and computation. This research builds a theoretical foundation for grasping the research direction and selecting advanced topics. [ABSTRACT FROM AUTHOR]

The field of edge computing has grown considerably over the past few years, with applications in artificial intelligence and big data processing, particularly due to its powerful accelerators offering a large amount of hardware parallelism. As the computing power of the latest edge systems increases, applications of edge computing are being expanded to areas that have traditionally required substantially high-performant computing resources such as scientific computing. In this paper, we review the latest literature and present the current status of research for implementing high-performance computing (HPC) on edge devices equipped with parallel accelerators, focusing on software environments including programming models and benchmark methods. We also examine the applicability of existing approaches and discuss possible improvements necessary towards realizing HPC on modern edge systems. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are one of the devices used to collect big data as part of the artificial intelligence of things (AIoT). To reduce total energy consumption, most researchers focus on optimizing the number and the location of UAVs, but ignore the distribution of UAVs in relation to the AIoT devices. Therefore, this paper proposes a memetic algorithm based on isomorphic transcoding space (MA-IT) to optimize the deployment of UAVs, solving, in particular, the distribution of UAVs in energy-efficient AIoT data collection. First, a simplified encoding method is designed to reduce the search space. This method only uses the distribution to represent a solution, and the number and the location of UAVs can be greedily deduced through the distribution. Afterwards, a pseudo-random initialization is proposed to initialize a population randomly and greedily. Then, an isomorphic transcoding (isoTcode) method is proposed to identify solutions with the isomorphic relations and to represent these solutions in a practical way in the UAV deployment problem. Finally, a crossover and a local search based on the isoTcode method are proposed to increase the solution diversity and improve the solution quality. Comparative experiments are conducted in the randomly generated instances with three problem scales. The results show that MA-IT performs better than other algorithms for solving the deployment optimization of UAVs. [ABSTRACT FROM AUTHOR]

The use of Artificial Intelligence (AI) and Big Data analysis algorithms is complementary to theory-driven analysis approaches and becoming more popular also in social sciences. This paper describes the use of Big Data and computational approaches in social sciences by bibliometric analyses of articles indexed between 2015 and 2020 in Social Sciences Citation Index (SSCI) of the Web of Science repository. We have analysed especially the recent research direction called Computational Social Sciences (CSS) that bridges computer analytical approaches with social science challenges, generating new methodologies of Big Data and AI analytics for social sciences. The results indicate that AI and Big Data practices are not confined to CSS only and are diffused in a wide variety of disciplines under Social Sciences and are made use of in many main research lines as well. Thus, the anticipated overlap between the Social Sciences & AI specialization and CSS has yet to be crystallised. Moreover, the impact of computational social science studies is not permeated to social science citation networks yet. Lastly, we demonstrate that the AI and Big Data publications that appear under the SSCI index are more oriented towards computational studies than addressing social science concepts, concerns, and challenges. [ABSTRACT FROM AUTHOR]

Recent technologies such as artificial intelligence, machine learning, and big data are essential for supporting healthcare monitoring systems, particularly for monitoring Monkeypox confirmed cases. Infected and uninfected cases around the world have contributed to a growing dataset, which is publicly available and can be used by artificial intelligence and machine learning to predict the confirmed cases of Monkeypox at an early stage. Motivated by this, we propose in this paper a new approach for accurate prediction of the Monkeypox confirmed cases based on an optimized Long Short-Term Memory (LSTM) deep network. To fine-tune the hyper-parameters of the LSTM-based deep network, we employed the Al-Biruni Earth Radius (BER) optimization algorithm; thus, the proposed approach is denoted by BER-LSTM. Experimental results show the effectiveness of the proposed approach when assessed using various evaluation criteria, such as Mean Bias Error, which is recorded as (0.06) using BER-LSTM. To prove the superiority of the proposed approach, six different machine learning models are included in the conducted experiments. In addition, four different optimization algorithms are considered for comparison purposes. The results of this comparison confirmed the superiority of the proposed approach. On the other hand, several statistical tests are applied to analyze the stability and significance of the proposed approach. These tests include one-way Analysis of Variance (ANOVA), Wilcoxon, and regression tests. The results of these tests emphasize the robustness, significance, and efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

An exploding demand for processing capabilities related to the emergence of the Internet of Things (IoT), Artificial Intelligence (AI), and big data, has led to the quest for increasingly efficient ways to expeditiously process the rapidly increasing amount of data. These ways include different approaches like improved devices capable of going further in the more Moore path but also new devices and architectures capable of going beyond Moore and getting more than Moore. Among the solutions being proposed, Stochastic Computing has positioned itself as a very reasonable alternative for low-power, low-area, low-speed, and adjustable precision calculations—four key-points beneficial to edge computing. On the other hand, chaotic circuits and systems appear to be an attractive solution for (low-power, green) secure data transmission in the frame of edge computing and IoT in general. Classical implementations of this class of circuits require intensive and precise calculations. This paper discusses the use of the Stochastic Computing (SC) framework for the implementation of nonlinear systems, showing that it can provide results comparable to those of classical integration, with much simpler hardware, paving the way for relevant applications. [ABSTRACT FROM AUTHOR]

This paper provides a comprehensive state-of-the-art investigation of the recent advances in data science in emerging economic applications. The analysis is performed on the novel data science methods in four individual classes of deep learning models, hybrid deep learning models, hybrid machine learning, and ensemble models. Application domains include a broad and diverse range of economics research from the stock market, marketing, and e-commerce to corporate banking and cryptocurrency. Prisma method, a systematic literature review methodology, is used to ensure the quality of the survey. The findings reveal that the trends follow the advancement of hybrid models, which outperform other learning algorithms. It is further expected that the trends will converge toward the evolution of sophisticated hybrid deep learning models. [ABSTRACT FROM AUTHOR]

The popularity of deep reinforcement learning (DRL) applications in economics has increased exponentially. DRL, through a wide range of capabilities from reinforcement learning (RL) to deep learning (DL), offers vast opportunities for handling sophisticated dynamic economics systems. DRL is characterized by scalability with the potential to be applied to high-dimensional problems in conjunction with noisy and nonlinear patterns of economic data. In this paper, we initially consider a brief review of DL, RL, and deep RL methods in diverse applications in economics, providing an in-depth insight into the state-of-the-art. Furthermore, the architecture of DRL applied to economic applications is investigated in order to highlight the complexity, robustness, accuracy, performance, computational tasks, risk constraints, and profitability. The survey results indicate that DRL can provide better performance and higher efficiency as compared to the traditional algorithms while facing real economic problems in the presence of risk parameters and the ever-increasing uncertainties. [ABSTRACT FROM AUTHOR]

The study was conducted by applying machine learning and data mining methods to treatment personalization. This allows individual patient characteristics to be investigated. The personalization method was built on the clustering method and associative rules. It was suggested to determine the average distance between instances in order to find the optimal performance metrics. The formalization of the medical data preprocessing stage was proposed in order to find personalized solutions based on current standards and pharmaceutical protocols. The patient data model was built using time-dependent and time-independent parameters. Personalized treatment is usually based on the decision tree method. This approach requires significant computation time and cannot be parallelized. Therefore, it was proposed to group people by conditions and to determine deviations of parameters from the normative parameters of the group, as well as the average parameters. The novelty of the paper is the new clustering method, which was built from an ensemble of cluster algorithms, and the usage of the new distance measure with Hopkins metrics, which were 0.13 less than for the k-means method. The Dunn index was 0.03 higher than for the BIRCH (balanced iterative reducing and clustering using hierarchies) algorithm. The next stage was the mining of associative rules provided separately for each cluster. This allows a personalized approach to treatment to be created for each patient based on long-term monitoring. The correctness level of the proposed medical decisions is 86%, which was approved by experts. [ABSTRACT FROM AUTHOR]

The K-nearest neighbors (KNN) machine learning algorithm is a well-known non-parametric classification method. However, like other traditional data mining methods, applying it on big data comes with computational challenges. Indeed, KNN determines the class of a new sample based on the class of its nearest neighbors; however, identifying the neighbors in a large amount of data imposes a large computational cost so that it is no longer applicable by a single computing machine. One of the proposed techniques to make classification methods applicable on large datasets is pruning. LC-KNN is an improved KNN method which first clusters the data into some smaller partitions using the K-means clustering method; and then applies the KNN for each new sample on the partition which its center is the nearest one. However, because the clusters have different shapes and densities, selection of the appropriate cluster is a challenge. In this paper, an approach has been proposed to improve the pruning phase of the LC-KNN method by taking into account these factors. The proposed approach helps to choose a more appropriate cluster of data for looking for the neighbors, thus, increasing the classification accuracy. The performance of the proposed approach is evaluated on different real datasets. The experimental results show the effectiveness of the proposed approach and its higher classification accuracy and lower time cost in comparison to other recent relevant methods. [ABSTRACT FROM AUTHOR]