Search

The complexity of searching algorithms in classical computing is a classic problem and a research area. Quantum computers and quantum algorithms can efficiently compute some classically hard problems. In addition, quantum machine learning algorithms could be an important avenue to boost existing and new quantum-based technology, reducing the supercomputing requirements for executing such problems. This paper reviews and explores topics such as variational quantum algorithms, kernel methods, and Grover's algorithm (GA). GA is a quantum search algorithm that achieves a quadratic speed improvement as a quantum classifier. We exploit GA or amplitude amplification to simulate rudimentary classical logical gates into quantum circuits considering AND, XOR, and OR gates. Our experiments in our review suggest that the algorithms discussed can be implemented and verified with relative ease, suggesting that researchers can investigate problems in the areas discussed related to quantum machine learning and more. [ABSTRACT FROM AUTHOR]

Learning using privileged information (LUPI) paradigm, which pioneered teacher–student interaction mechanism, makes the learning models use additional information in the training stage. This paper is the first to propose an incremental learning algorithm with LUPI paradigm for random vector functional-link (RVFL) networks, named IRVFL+. This novel algorithm can leverage privileged information into incremental RVFL (IRVFL) networks in the training stage, which provides a new constructive method to train IRVFL networks. In order to solve two scenarios that require fast speed of modeling but low-accuracy requirements and high accuracy but slow speed of modeling requirements, two algorithmic implementations of IRVFL+ , respectively, based on local update and global update strategies are presented for data classification and regression problems in this paper. Specifically, the first algorithm, named IRVFL-I+ , calculates the output weights of the newly added hidden nodes, while the input and output parameters of all the existing hidden nodes are fixed. In contrast to IRVFL-I+ , the second one named IRVFL-II + can update all the parameters of all the existing hidden nodes and newly added hidden nodes. Moreover, the convergences of two implementations have been studied in this paper. Finally, experimental results indicate that IRVFL+ indeed performs favorably. [ABSTRACT FROM AUTHOR]

Disease risk prediction is a rising challenge in the medical domain. Researchers have widely used machine learning algorithms to solve this challenge. The k-nearest neighbour (KNN) algorithm is the most frequently used among the wide range of machine learning algorithms. This paper presents a study on different KNN variants (Classic one, Adaptive, Locally adaptive, k-means clustering, Fuzzy, Mutual, Ensemble, Hassanat and Generalised mean distance) and their performance comparison for disease prediction. This study analysed these variants in-depth through implementations and experimentations using eight machine learning benchmark datasets obtained from Kaggle, UCI Machine learning repository and OpenML. The datasets were related to different disease contexts. We considered the performance measures of accuracy, precision and recall for comparative analysis. The average accuracy values of these variants ranged from 64.22% to 83.62%. The Hassanaat KNN showed the highest average accuracy (83.62%), followed by the ensemble approach KNN (82.34%). A relative performance index is also proposed based on each performance measure to assess each variant and compare the results. This study identified Hassanat KNN as the best performing variant based on the accuracy-based version of this index, followed by the ensemble approach KNN. This study also provided a relative comparison among KNN variants based on precision and recall measures. Finally, this paper summarises which KNN variant is the most promising candidate to follow under the consideration of three performance measures (accuracy, precision and recall) for disease prediction. Healthcare researchers and stakeholders could use the findings of this study to select the appropriate KNN variant for predictive disease risk analytics. [ABSTRACT FROM AUTHOR]

Because of the low accuracy in intrusion detection, a model of extreme learning machine based on the optimization of quantum beetle swarm algorithm is proposed. First of all, this paper proposes a quantum beetle swarm optimization algorithm, which introduces quantum mechanics and combines the advantages of beetle antennae search and particle swarm optimization. In this way, the individual can learn both their own experience and group experience, which enables the beetle to move purposefully and instructively, and improves the convergence performance of the algorithm. In extreme learning machine, it is more difficult to solve the problem in high-dimensional data. This paper proposed an improved extreme learning machine that uses the least squares QR algorithm to decompose the matrix, which can reduce the computational complexity of the traditional extreme learning machine. The improved extreme learning machine model optimized by quantum beetle swarm optimization algorithm is applied to intrusion detection, and the simulation results show that the model proposed in this paper can significantly improve detection accuracy and increase convergence rate. [ABSTRACT FROM AUTHOR]

There are several public cloud service providers (CSPs) across the globe supplying a variety of application, platform, middleware, database, and infrastructure services. The brewing challenge before any cloud user is how to be sure about the trustworthiness of a service being offered by various CSPs. With the overwhelming usage of cloud services by individuals and organizations, this problem has acquired a lot of attention these days. Precisely arriving and articulating that this particular service from a specific cloud CSP is trustworthy is becoming complicated because of many moving variables in this whole phenomenon. There are varying parameters and indicators for decisively proving that a particular service is trustworthy or not. In order to meet up this crucial challenge and concern being widely expressed by cloud customers, researchers and cloud professionals across the world have unearthed a few viable mechanisms. There are fresh algorithms, techniques, and tools to enable cloud users towards easily and quickly selecting trustworthy services. This paper digs deeper and dwells at length about the intrinsic challenges being associated with the provenance of the trustworthiness factor. The paper also presents a machine learning approach to compute the trust factor of CSPs and it is found that the methodology gains advantage when compared to similar works. [ABSTRACT FROM AUTHOR]

Compressive data gathering (CDG) is an adequate method to reduce the amount of data transmission, thereby decreasing energy expenditure for wireless sensor networks (WSNs). Sleep scheduling integrated with CDG can further promote energy efficiency. Most of existing sleep scheduling methods for CDG were formulated as centralized optimization problems which introduced many extra control message exchanges. Meanwhile, a few distributed methods usually adopted stochastic decision which could not adapt to variance in residual energy of nodes. A part of nodes were prone to prematurely run out of energy. In this paper, a reinforcement learning-based sleep scheduling algorithm for CDG (RLSSA-CDG) is proposed. Active nodes selection is modeled as a finite Markov decision process. The mode-free Q learning algorithm is used to search optimal decision strategies. Residual energy of nodes and sampling uniformity are considered into the reward function of the Q learning algorithm for load balance of energy consumption and accurate data reconstruction. It is a distributed algorithm that avoids large amounts of control message exchanges. Each node takes part in one step of the decision process. Thus, computation overhead for sensor nodes is affordable. Simulation experiments are carried out on the MATLAB platform to validate the effectiveness of the proposed RLSSA-CDG against the distributed random sleep scheduling algorithm for CDG (DSSA-CDG) and the original sparse-CDG algorithm without sleep scheduling. The simulation results indicate that the proposed RLSSA-CDG outperforms the two contrast algorithms in terms of energy consumption, network lifetime, and data recovery accuracy. The proposed RLSSA-CDG reduces energy consumption by 4.64% and 42.42%, respectively, compared to the DSSA-CDG and the original sparse-CDG, prolongs life span by 57.3%, and promotes data recovery accuracy by 84.7% compared to the DSSA-CDG. [ABSTRACT FROM AUTHOR]

Since the number of features of the dataset is much higher than the number of patterns, the higher the dimension of the data, the greater the impact on the learning algorithm. Dimension disaster has become an important problem. Feature selection can effectively reduce the dimension of the dataset and improve the performance of the algorithm. Thus, in this paper, A feature selection algorithm based on P systems (P-FS) is proposed to exploit the parallel ability of cell-like P systems and the advantage of evolutionary algorithms in search space to select features and remove redundant information in the data. The proposed P-FS algorithm is tested on five UCI datasets and an edible oil dataset from practical applications. At the same time, the P-FS algorithm and genetic algorithm feature selection (GAFS) are compared and tested on six datasets. The experimental results show that the P-FS algorithm has good performance in classification accuracy, stability, and convergence. Thus, the P-FS algorithm is feasible in feature selection. [ABSTRACT FROM AUTHOR]

Projection-free optimization via different variants of the Frank–Wolfe method has become one of the cornerstones of large scale optimization for machine learning and computational statistics. Numerous applications within these fields involve the minimization of functions with self-concordance like properties. Such generalized self-concordant functions do not necessarily feature a Lipschitz continuous gradient, nor are they strongly convex, making them a challenging class of functions for first-order methods. Indeed, in a number of applications, such as inverse covariance estimation or distance-weighted discrimination problems in binary classification, the loss is given by a generalized self-concordant function having potentially unbounded curvature. For such problems projection-free minimization methods have no theoretical convergence guarantee. This paper closes this apparent gap in the literature by developing provably convergent Frank–Wolfe algorithms with standard O (1 / k) convergence rate guarantees. Based on these new insights, we show how these sublinearly convergent methods can be accelerated to yield linearly convergent projection-free methods, by either relying on the availability of a local liner minimization oracle, or a suitable modification of the away-step Frank–Wolfe method. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel indoor localization system in a multi-indoor environment using cloud computing. Prior studies show that there are always concerns about how to avoid signal occlusion and interference in the single indoor environment. However, we find some general rules to support our system being immune to interference generated by occlusion in the multi-indoor environment. A convenient way is measured to deploy Bluetooth low energy devices, which mainly collect large information to assist localization. A neural network-based classification is proposed to improve localization accuracy, compared with several algorithms and their performance comparison is discussed. We also design a distributed data storage structure and establish a platform considering the storage load with Redis. Our real experimental validation shows that our system will meet the four aspects of performance requirements, which are higher accuracy, less power consumption, and increased levels of system magnitude and deployment efficiency. [ABSTRACT FROM AUTHOR]

Traditional video surveillance, temperature-based or smoke-based fire source location methods are difficult to timely and accurately locate the fire source in warehouses with the characteristics of burning intensely, smoke spreading quickly, and being sheltered by shelves and goods. To overcome the drawbacks, a deep-learning-based fire source localization algorithm with temperature and smoke sensor data fusion according to the different stages of the combustion process is proposed in this paper. The temperature and smoke concentration information are collected from sensors distributed in different spatial locations of a warehouse. A convolutional neural network is used to exact the fusion data feature. The deep learning algorithm is adopted to construct the fire source localization model where the fusion data feature of temperature and smoke concentrations are the inputs and the fire source coordinates are the outputs. By using Fire Dynamics Simulator, a warehouse that meets the practical application is constructed and kinds of fire scenes are simulated. The experimental results show that the RMSE of the model localization reaches 0.63, 0.08, and 0.17 in three stages respectively, which verifies the effectiveness of the proposed fire source localization algorithm. [ABSTRACT FROM AUTHOR]

Scattering transform has many advantages and has been widely used in various fields since proposed. An algorithm using machine learning was proposed by some developers of Kymatio to reconstruct the signal based on the Scattering transform of the signal on the internet (Reconstruct a synthetic signal from its scattering transform (DB/OL) https://www.kymat.io/gallery%5f1d/reconstruct%5ftorch.html#sphx-glr-gallery-1d-reconstruct-torch-py and Andreux et al. https://arxiv.org/1812.11214, 2019). In this paper, I improve this reconstruction algorithm to an efficiency-based algorithm. However, the coefficient in the original formula for the input signal is defined and followed by original gradient descent algorithm with the learning rate multiplied by an accelerator or braker for every iteration. Once the error is spotted out then the system is discarded. By introducing an efficiency parameter, the calculation time and the eliminated error are linked, so that coefficient can be determined to improve the efficiency and eliminated most errors in a short time. Also, the experimenter can adjust the importance parameter in the efficiency parameter to determine the importance of speed and accuracy, which provides the experimenter with more choices. [ABSTRACT FROM AUTHOR]

It is hard to come up with a strong learning algorithm with high cross-media retrieval accuracy, but finding a weak learning algorithm with slightly higher accuracy than random prediction is simple. This paper proposes an innovative Bagging-based cross-media retrieval algorithm (called BCMR) based on this concept. First, we use bootstrap sampling to take a random sample from the original set. The amount of sample abstracted by bootstrapping is set to be the same as the amount of sample abstracted by the original dataset. Secondly, 50 bootstrap replicates are used to train 50 weak classifiers. In our experiments, we used homogeneous individual classifiers and eight different baseline methods. Last but not least, we generate the final strong classifier from 50 weak classifiers using the sample voting integration strategy. Using collective wisdom, we can get rid of bad decisions, giving the integrated model a much better generalization ability. Extensive experiments on three datasets show that BCMR can significantly improve cross-media retrieval accuracy. [ABSTRACT FROM AUTHOR]

Functional operation of integrated network during circumstances like disturbance and improper operation has to be addressed properly to improve the integrated network performance and safety. One of the situations is a island state and requires to secure human beings and device components that are working in integrated network. This paper presents a k-means clustering machine learning (kmc-ML) to obtain upper limit (UL) and lower limit (LL) parameters for continuous change in fuzzy variable. Machine learning (ML) will support to change the position of fuzzy set towards universe of discourse (UoD) either in LL or UL, and hence, mismatch observation can make for better estimation of integrated network state. Identification of state at every abnormal mode (AbM) operation will depend on UoD set to achieve effective outcome. ML-based soft fuzzy set control vector (S-FSCV) decides the integrated network state, i.e. island state or not. [ABSTRACT FROM AUTHOR]

Containerization technology utilizes operating system level virtualization to package applications to run with required libraries and are isolated from other processes on the same host. Lightweight and quick deployment make containers popular in many data centers. Running distributed applications in data centers usually involves multiple clusters of machines. Docker Swarm is a container orchestration tool for managing a cluster of Docker containers and their hosts. However, Docker Swarm's scheduler does not consider resource utilization when placing containers in a cluster. This paper first investigated performance interference in container clusters. Our experimental study showed that distributed applications' performance can be degraded when co-located with other containers which aggressively consume resources. A new scheduler is proposed to improve performance while keeping high resource utilization. The experimental results demonstrated that the proposed prototype with machine learning based clustering algorithms could effectively improve distributed applications' performance by up to 14.5% with an average at around 12%. This work also provides theoretical bounds for the container placement problem. [ABSTRACT FROM AUTHOR]

In this paper, an online optimization approach of a fractional-order PID controller based on a fractional-order actor-critic algorithm (FOPID-FOAC) is proposed. The proposed FOPID-FOAC scheme exploits the advantages of the FOPID controller and FOAC approaches to improve the performance of nonlinear systems. The proposed FOAC is built by developing a FO-based learning approach for the actor-critic neural network with adaptive learning rates. Moreover, a FO rectified linear unit (RLU) is introduced to enable the AC neural network to define and optimize its own activation function. By the means of the Lyapunov theorem, the convergence and the stability analysis of the proposed algorithm are investigated. The FO operators for the FOAC learning algorithm are obtained using the gray wolf optimization (GWO) algorithm. The effectiveness of the proposed approach is proven by extensive simulations based on the tracking problem of the two degrees of freedom (2-DOF) helicopter system and the stabilization issue of the inverted pendulum (IP) system. Moreover, the performance of the proposed algorithm is compared against optimized FOPID control approaches in different system conditions, namely when the system is subjected to parameter uncertainties and external disturbances. The performance comparison is conducted in terms of two types of performance indices, the error performance indices, and the time response performance indices. The first one includes the integral absolute error (IAE), and the integral squared error (ISE), whereas the second type involves the rising time, the maximum overshoot (Max. OS), and the settling time. The simulation results explicitly indicate the high effectiveness of the proposed FOPID-FOAC controller in terms of the two types of performance measurements under different scenarios compared with the other control algorithms. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have evolved as a beneficial machine learning method that has been successfully used in various applications. Currently, DNN is a superior technique of extracting information from massive sets of data in a self-organized method. DNNs have different structures and parameters, which are usually produced for particular applications. Nevertheless, the training procedures of DNNs can be protracted depending on the given application and the size of the training set. Further, determining the most precise and practical structure of a deep learning method in a reasonable time is a possible problem related to this procedure. Meta-heuristics techniques, such as swarm intelligence (SI) and evolutionary computing (EC), represent optimization frames with specific theories and objective functions. These methods are adjustable and have been demonstrated their effectiveness in various applications; hence, they can optimize the DNNs models. This paper presents a comprehensive survey of the recent optimization methods (i.e., SI and EC) employed to enhance DNNs performance on various tasks. This paper also analyzes the importance of optimization methods in generating the optimal hyper-parameters and structures of DNNs in taking into consideration massive-scale data. Finally, several potential directions that still need improvements and open problems in evolutionary DNNs are identified. [ABSTRACT FROM AUTHOR]

This paper is proposing an machine learning based expert system for preliminary prediction of the insulation fire resisting performance of shallow floor systems when subject to exposure to the ISO 834 Standard Fire Curve. The proposed system is a digital tool which incorporates a machine learning algorithm trained on the outcomes of pre-run two-dimensional finite element heat transfer analyses of shallow floor system details. The algorithm predicts the insulation performance of similar details with a measurable accuracy of 96% (i.e the insulation rating band was predicted correctly in 96% of the cases) without the requirement for an explicit deterministic analysis. The paper presents the challenges and prerequisites to build such an expert system and acts as a proof of concept for the use of machine learning for the assessment of the insulation performance of shallow floor system under the guidance of BS EN 1363-1:2012. A Support Vector Machine machine learning algorithm is adopted in this work. The required processes that were needed for the development of the expert system include the stages of data acquisition, exploratory data analysis, choice of machine learning algorithm, model training, tuning, and validation. This expert system is useful for practitioners to rapidly assess the feasibility of different construction details at early stages of the design process. [ABSTRACT FROM AUTHOR]

Clustering and classification-based pattern recognition techniques are widely used in various domains. While many approaches exist to perform these tasks, it remains a difficult process to perform clustering and classification simultaneously for particular datasets. In this paper, a method based on k-nearest neighbor (KNN) is presented to classify the dataset with PSO optimized k-medoids clustering. Initial clustering with k-medoids algorithm divides the dataset into smaller and disjoint clusters featuring similarity within clusters and dissimilarity with members of other clusters. Particle swarm optimization (PSO) is an evolutionary algorithm mainly used to optimize the issues in several research areas including data analytics. The fitness function of the PSO approach mentioned in this paper is based on inertia weights that identify the particles with the best positions and velocities for optimization. Additionally, PSO uses a novel elitism concept that allows massive searching capability between the swarm of particles to achieve a better convergence rate. Because of this property, it can be applied throughout different machine learning fields. Moreover, the KNN classifier outperforms the classification task in terms of classifying the optimized particles with high accuracy. The performance of the proposed technique is evaluated by experimenting with datasets taken from open sources. The simulation results revealed that the performance of the proposed method is better than the existing methods in terms of effective clustering as well as accurate classification. [ABSTRACT FROM AUTHOR]

The simulation-random statistics (SRS) method is one of the effective approaches to solving groundwater contamination source identification (GCSI) challenges. In this paper, we applied a heuristic search iterative process (HSIP) based on SRS to provide interval estimation and probability distribution for an unknown variable to enhance our understanding of the unknown variable. Posterior distribution has been a subject of interest in HSIP; therefore, it is imperative to update prior distributions using final iterations obtained from posterior distributions, which has been seldom considered in previous research. This paper first proposed such updates and subsequently designed an updating HSIP (UHSIP). This paper first proposed a feedback correction step and incorporated it into UHSIP to achieve feedback improvements and simultaneous updates of an unknown variable and prior distribution. In UHSIP, a surrogate system such as extreme learning machine (ELM) is usually established for a numerical simulation model to reduce computational cost. The particle swarm optimization (PSO) algorithm has been demonstrated to optimize input weights and hidden layer biases in ELM. However, the PSO algorithm is prone to premature convergence and its calculation accuracy does not satisfy precision requirements when optimizing complex functions. To enhance accuracy, this paper first proposed a new adaptive chaotic PSO (ACPSO) algorithm to establish ACPSO–ELM surrogate system. The two newly proposed approaches were tested in two case studies based on groundwater inorganic and organic contaminations. Results reveal that UHSIP can effectively enhance identification accuracy, and ACPSO–ELM surrogate system has a higher approximation accuracy to the simulation model than PSO–ELM. Overall, the two main innovations in this paper (UHSIP and ACPSO–ELM surrogate system) present promising and effective solutions to GCSI challenge. [ABSTRACT FROM AUTHOR]

The density matrix least squares problem arises from the quantum state tomography problem in experimental physics and has many applications in signal processing and machine learning, mainly including the phase recovery problem and the matrix completion problem. In this paper, we first reformulate the density matrix least squares problem as an equivalent convex optimization problem and then design an efficient semismooth Newton-based augmented Lagrangian (Ssnal) algorithm to solve the dual of its equivalent form, in which an inexact semismooth Newton (Ssn) algorithm with superlinear or even quadratic convergence is applied to solve the inner subproblems. Theoretically, the global convergence and locally asymptotically superlinear convergence of the Ssnal algorithm are established under very mild conditions. Computationally, the costs of the Ssn algorithm for solving the subproblem are significantly reduced by making full use of low-rank or high-rank property of optimal solutions of the density matrix least squares problem. In order to verify the performance of our algorithm, numerical experiments conducted on randomly generated quantum state tomography problems and density matrix least squares problems with real data demonstrate that the Ssnal algorithm is more effective and robust than the Qsdpnal solver and several state-of-the-art first-order algorithms. [ABSTRACT FROM AUTHOR]

Recently, phishing attacks have become one of the most prominent social engineering attacks faced by public internet users, governments, and businesses. In response to this threat, this paper proposes to give a complete vision to what Machine learning is, what phishers are using to trick gullible users with different types of phishing attacks techniques and based on our survey that phishing emails is the most effective on the targeted sectors and users which we are going to compare as well. Therefore, more effective phishing detection technology is needed to curb the threat of phishing emails that are growing at an alarming rate in recent years, thus will discuss the techniques of mitigation of phishing by Machine learning algorithms and technical solutions that have been proposed to mitigate the problem of phishing and valuable awareness knowledge users should be aware to detect and prevent from being duped by phishing scams. In this work, we proposed a detection model using machine learning techniques by splitting the dataset to train the detection model and validating the results using the test data , to capture inherent characteristics of the email text, and other features to be classified as phishing or non-phishing using three different data sets, After making a comparison between them, we obtained that the most number of features used the most accurate and efficient results achieved. the best ML algorithm accuracy were 0.88, 1.00, and 0.97 consecutively for boosted decision tree on the applied data sets. [ABSTRACT FROM AUTHOR]

Nowadays, cryptographic systems' designers are facing significant challenges in their designs. They have to constantly search for new ideas of fast unbreakable algorithms with a very powerful key generator. In this paper, we propose a novel hybrid neural-cryptography methodology. It depends on new rule of very fast Backpropagation (BP) instant machine learning (ML). This proposed Hybrid Cryptography system is constructed from Encryptor and Decryptor based on the asymmetric Autoencoder type. The Encryptor encrypts and compresses a set of data to be instant code (i-code) using public key. While the Decryptor recovers this i-code (ciphered-data) based on two keys together. The first is the private key and the other is called instant-key (i-key). This i-key is generated from 3 factors as well (the original data itself, the generated i-code and the private key). The i-key is changing periodically with every transformation of plain data set, so it is powerful unpredictable key against the brute force. [ABSTRACT FROM AUTHOR]

Reconstruction of cross-cut shredded text documents (RCCSTD) has important applications for information security and judicial evidence collection. The traditional method of manual construction is a very time-consuming task, so the use of computer-assisted efficient reconstruction is a crucial research topic. Fragment consensus information extraction and fragment pair compatibility measurement are two fundamental processes in RCCSTD. Due to the limitations of the existing classical methods of these two steps, only documents with specific structures or characteristics can be spliced, and pairing error is larger when the cutting is more fine-grained. In order to reconstruct the fragments more effectively, this paper improves the extraction method for consensus information and constructs a new global pairwise compatibility measurement model based on the extreme learning machine algorithm. The purpose of the algorithm's design is to exploit all available information and computationally suggest matches to increase the algorithm's ability to discriminate between data in various complex situations, then find the best neighbor of each fragment for splicing according to pairwise compatibility. The overall performance of our approach in several practical experiments is illustrated. The results indicate that the matching accuracy of the proposed algorithm is better than that of the previously published classical algorithms and still ensures a higher matching accuracy in the noisy datasets, which can provide a feasible method for RCCSTD intelligent systems in real scenarios. [ABSTRACT FROM AUTHOR]

Artificial intelligence research in health care has undergone tremendous growth in the last several years thanks to the explosion of digital health care data and systems that can leverage large amounts of data to learn patterns that can be applied to clinical tasks. In addition, given broad acceleration in machine learning across industries like transportation, media and commerce, there has been a significant growth in demand for machine-learning practitioners such as engineers and data scientists, who have skill sets that can be applied to health care use cases but who simultaneously lack important health care domain expertise. The purpose of this paper is to discuss the requirements of building an artificial-intelligence research enterprise including the research team, technical software/hardware, and procurement and curation of health care data. [ABSTRACT FROM AUTHOR]

A recognition model named the SVM-NP is proposed in this paper to address the multi-attribute overlap in radar working recognition. The model is based on the K-NN boundary preselection algorithm and SVM-BP algorithm. Traditional classifiers tend to neglect the overlap of samples' attributes in classification, which leads to the low accuracy of classifiers. The K-NN boundary preselection can quickly select boundary samples from the total ones and reduce the whole samples' attribute overlap. The SVM-BP algorithm is improved based on the SVM-RFE algorithm, and the boundary samples with high attribute overlap are divided into many planes for training and testing. Compared with traditional methods, the overlap of sample attributes can be reduced twice in this model. Theoretical analysis and experimental results verify that the model proposed in this paper displays better performance in classification when appropriate parameters are provided. [ABSTRACT FROM AUTHOR]

Label-specific features learning can effectively exploit the unique features of each label, which alleviates the high dimensionality and improves the classification performance of multi-label. However, most existing label-specific features learning algorithms assume that label space is complete, ignoring the effect of missing labels on the classification accuracy. Some methods try to recover the missing labels first and then learn the mapping between the completed label matrix and the feature matrix. However, early intervention in the recovery of missing labels may affect the distribution of original labels to a certain extent. In this paper, feature-label dual-mapping for missing label-specific features learning is proposed. According to the information that the label depends on the feature, the dual-mapping weight of the complete feature space and the missing label space is jointly learned. Therefore, the proposed algorithm is to conduct latent missing labels recovery by feature-label dual-mapping to directly obtain target weight in this paper, avoiding the negative influence of early label recovery intervention. Compared with several state-of-the-art methods in 10 benchmark multi-label data sets, the results show that the proposed algorithm is reasonable and effective. [ABSTRACT FROM AUTHOR]

Resource management is the process of task scheduling and resource provisioning to provide requirements of cloud users. Since cloud resources are often heterogeneous, task scheduling and resource provisioning are major challenges in this area. Various methods have been introduced to improve resource utilization and thus increase the efficiency of cloud computing. Existing methods can be divided into several categories, including mathematical and statistical methods, heuristic- and meta-heuristic-based methods, and machine-learning-based methods. Since the resource management problem is NP-complete, several optimization methods have been also exploited in this area. Coral reefs algorithm is an evolutionary method that has showed appropriate convergence and response time for some problems, and thus is used in this paper to combine with reinforcement learning to improve efficiency of resource management in cloud environments. The proposed method of this paper consists of two phases. The initial allocation of resources to ready-to-perform tasks is done using the coral reefs algorithm in the first phase. The tasks are considered as corals and the resources are considered reefs in this method. The second phase utilizes reinforcement learning to avoid falling into the local optima and to make optimal use of resources using a long-term approach. The proposed model of this paper, called MO-CRAML, introduces a new hybrid algorithm for improving utilization and load balancing of cloud resources using the combination of coral reefs optimization algorithm and reinforcement learning. The results of the experiments show that the proposed algorithm has better performance in cloud resource utilization and load balancing in comparison with some other important methods of the literature. [ABSTRACT FROM AUTHOR]

The psychological health of a person plays an important role in their daily life activities. The paper addresses depression issues with the machine learning model using facial expressions of the patient. Some research has already been done on visual based on depression detection methods, but those are illumination variant. The paper uses feature extraction using LBP (Local Binary Pattern) descriptor, which is illumination invariant. The Viola-Jones algorithm is used for face detection and SVM (support vector machine) is considered for classification along with the LBP descriptor to make a complete model for depression level detection. The proposed method captures frontal face from the videos of subjects and their facial features are extracted from each frame. Subsequently, the facial features are analyzed to detect depression levels with the post-processing model. The performance of the proposed system is evaluated using machine learning algorithms in MATLAB. For the real-time system design, it is necessary to test it on the hardware platform. The LBP descriptor has been implemented on FPGA using Xilinx VIVADO 16.4. The results of the proposed method show satisfactory performance and accuracy for depression detection comparison with similar previous work. [ABSTRACT FROM AUTHOR]

In order to solve the problems of low learning efficiency and slow convergence speed when mobile robot uses reinforcement learning method for path planning in complex environment, a reinforcement learning method based on each round path planning result is proposed. Firstly, the algorithm adds obstacle learning matrix to improve the success rate of path planning; and introduces heuristic reward to speed up the learning process by reducing the search space; then proposes a method of dynamically adjusting the exploration factor to balance the exploration and utilization in path planning, so as to further improve the performance of the algorithm. Finally, the simulation experiment in grid environment shows that compared with Q-learning algorithm, the improved algorithm not only shortens the average path length of the robot to reach the target position, but also speeds up the learning efficiency of the algorithm, so that the robot can find the optimal path more quickly. The code of EPRQL algorithm proposed in this paper has been published to GitHub: https://github.com/panpanpanguoguoqian/mypaper1.git. [ABSTRACT FROM AUTHOR]

In this paper, we study the Covid 19 disease profile in the Algerian territory since February 25, 2020 to February 13, 2021. The idea is to develop a decision support system allowing public health decision and policy-makers to have future statistics (the daily prediction of parameters) of the pandemic; and also encourage citizens for conducting health protocols. Many studies applied traditional epidemic models or machine learning models to forecast the evolution of coronavirus epidemic, but the use of such models alone to make the prediction will be less precise. For this purpose, we assume that the spread of the coronavirus is a moving target described by an epidemic model. On the basis of a SIRD model (Susceptible-Infection-Recovery- Death), we applied the EKF algorithm to predict daily all parameters. These predicted parameters will be much beneficial to hospital managers for updating the available means of hospitalization (beds, oxygen concentrator, etc.) in order to reduce the mortality rate and the infected. Simulations carried out reveal that the EKF seems to be more efficient according to the obtained results. [ABSTRACT FROM AUTHOR]

The problem of learning automata from example traces (but no equivalence or membership queries) is fundamental in automata learning theory and practice. In this paper, we study this problem for finite-state machines with inputs and outputs, and in particular for Moore machines. We develop three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of input–output traces into an incomplete Moore machine and then completes the machine with self-loops; (2) the PRPNI algorithm, which uses the well-known RPNI algorithm for automata learning to learn a product of automata encoding a Moore machine; and (3) the MooreMI algorithm, which directly learns a Moore machine using PTAP extended with state merging. We prove that MooreMI has the fundamental identification in the limit property. We compare the algorithms experimentally in terms of the size of the learned machine and several notions of accuracy, introduced in this paper. We also carry out a performance comparison against two existing tools (LearnLib and flexfringe). Finally, we compare with OSTIA, an algorithm that learns a more general class of transducers and find that OSTIA generally does not learn a Moore machine, even when fed with a characteristic sample. [ABSTRACT FROM AUTHOR]

Breast cancer (BC) is the leading cause of death among women worldwide. It affects in general women older than 40 years old. Medical images analysis is one of the most promising research areas since it provides facilities for diagnosis and decision-making of several diseases such as BC. This paper conducts a Structured Literature Review (SLR) of the use of Machine Learning (ML) and Image Processing (IP) techniques to deal with BC imaging. A set of 530 papers published between 2000 and August 2019 were selected and analyzed according to ten criteria: year and publication channel, empirical type, research type, medical task, machine learning techniques, datasets used, validation methods, performance measures and image processing techniques which include image pre-processing, segmentation, feature extraction and feature selection. Results showed that diagnosis was the most used medical task and that Deep Learning techniques (DL) were largely used to perform classification. Furthermore, we found out that classification was the most ML objective investigated followed by prediction and clustering. Most of the selected studies used Mammograms as imaging modalities rather than Ultrasound or Magnetic Resonance Imaging with the use of public or private datasets with MIAS as the most frequently investigated public dataset. As for image processing techniques, the majority of the selected studies pre-process their input images by reducing the noise and normalizing the colors, and some of them use segmentation to extract the region of interest with the thresholding method. For feature extraction, we note that researchers extracted the relevant features using classical feature extraction techniques (e.g. Texture features, Shape features, etc.) or DL techniques (e. g. VGG16, VGG19, ResNet, etc.), and finally few papers used feature selection techniques in particular the filter methods. [ABSTRACT FROM AUTHOR]

Policymakers seeking to target health policies efficiently towards specific population groups need to know which individuals stand to benefit the most from each of these policies. While traditional approaches for subgroup analyses are constrained to only consider a small number of pre-defined subgroups, recently proposed causal machine learning (CML) approaches help explore treatment-effect heterogeneity in a more flexible yet principled way. Causal forests use a generalisation of the random forest algorithm to estimate heterogenous treatment effects both at the individual and the subgroup level. Our paper aims to explore this approach in the setting of health policy evaluation with strong observed confounding, applied specifically to the context of mothers' health insurance enrolment in Indonesia. Comparing two health insurance schemes (subsidised and contributory) against no insurance, we find beneficial average impacts of enrolment in contributory health insurance on maternal health care utilisation and infant mortality, but no impact of subsidised health insurance. The causal forest algorithm identified significant heterogeneity in the impacts of contributory insurance, not just along socioeconomic variables that we pre-specified (indicating higher benefits for poorer, less educated, and rural women), but also according to some other characteristics not foreseen prior to the analysis, suggesting in particular important geographical impact heterogeneity. Our study demonstrates the power of CML approaches to uncover unexpected heterogeneity in policy impacts. The findings from our evaluation of past health insurance expansions can potentially guide the re-design of the eligibility criteria for subsidised health insurance in Indonesia. [ABSTRACT FROM AUTHOR]

Learning automata (LA), a powerful tool for reinforcement learning in the field of machine learning, could explore its optimal state by continuously interacting with an external environment. Generally, the traditional LA algorithms, especially estimator LA algorithms, can be ultimately abstracted out as P- or Q-models, which are simply located in the stationary environments. A more comprehensive consideration would be S-model operating in the non-stationary environment. For this specific LA, presently the most popular achievement belongs to stochastic estimator LA (SELA). However, synchronously handing four parameters involved in SELA is an intractable job, as these parameters may vary dramatically in values under different environments, making it essential to develop a strategy for parameter tuning. In this paper, we first propose a scheme to determine the parameter searching scope and subsequently present a series of parameter searching methods, including a four-dimensional method and a two-dimensional method, making SELA applicable for any environment with switching non-stationary characteristics. Furthermore, to decrease the tuning cost, a reduced parameter SELA supported by the new two-dimensional parameter searching method emerges. And to break the traditional limit that the environmental reward probability must be symmetrically distributed, the S-model is constructed from a new perspective, thus forming a novel reduced parameter S-model of SELA (rpS-SELA). A detailed mathematical proof theoretically reveals the absolute expediency of rpS-SELA. In addition, it is demonstrated by experimental simulations that rpS-SELA outperforms others with a reduced tuning cost, a minor time consumption, a higher accuracy rate, and above all, a stronger tracking ability to the environmental switches. [ABSTRACT FROM AUTHOR]

Convolutional neural networks also encountered some problems in the development of image recognition. The most prominent problem is that it is costly and time-consuming to collect data sets and train models. Limited data sets will cause the trained models to overfit. This paper proposes two methods to reduce overfitting based on the residual neural network architecture. The first type of method proposes a method of cross-combining waivers, reducing the size of the convolution kernel, and reducing the number of convolution kernels. The fitting method uses cross-combination to make the accuracy of Kaggle cat and dog data on the validation data set reach 95.37% and 90.31% on 30 types of engineering practice verification data set. The second method is based on the finetune residual neural network. A method of recurrent finetune residual neural network is proposed to improve the accuracy of the model. The accuracy of the finetune residual neural network on the Kaggle cat and dog validation dataset is 99.37%, and the accuracy of the dataset is verified in 30 types of engineering practice. The accuracy is 99.30%. The residual neural network method achieves 99.68% accuracy in the Kaggle cat and dog validation dataset and 99.61% in the validation dataset for 30 types of engineering practice. [ABSTRACT FROM AUTHOR]

Dragonfly algorithm (DA) is a novel swarm intelligence meta-heuristic optimization algorithm inspired by the dynamic and static swarming behaviors of artificial dragonflies in nature. It has proved its effectiveness and superiority compared to several well-known meta-heuristics available in the literature. This paper presents a comprehensive review of DA and its new variants classified into modified and hybrid versions. It also describes the main diverse applications of DA in several fields and areas such as machine learning, neural network, image processing, robotics, and engineering. Finally, the paper suggests some possible interesting research on the applications and hybridizations of DA for future works. [ABSTRACT FROM AUTHOR]

This paper submits a report on the effective adoption of machine learning algorithms for enhancing the reliability of rainfall-induced landslides. The challenges involved in the design of reliable landslide early warning systems (LEWS) and the data-driven context for overcoming these challenges have been presented. The operation of LEWS is explained using the chain of five major components (i) Data collection, (ii) Data transmission, (iii) Modelling, analysis and forecasting, (iv) Warning, and (v) Response. Failure of any of these major components of the LEWS will break the chain of operation of LEWS and the ensued consequences of each component failure are reviewed. Inferences drawn from the analysis of the reliability measures incorporated in 12 LEWS deployments across a dozen locations around the world are also presented. Based on the investigations from 12 LEWS and the real-world experience, we identified that an alternate solution is required for ensuring the reliability of LEWS, especially during disaster scenarios when warnings are crucial, but data availability is a constraint. We recognized that machine learning algorithms can provide an alternate solution and in this paper, we have discussed two machine learning approaches nowcasting and forecasting for enhancing the reliability. Both the algorithms employ historic data of the landslide monitoring parameters to learn the changes materializing in slope leading to landslide incidences. The learned knowledge is used to nowcast and forecast the real-time and future conditions of the slope from the real-time landslide monitoring parameters. In terms of ensuring reliability, (i) Nowcasting algorithm provides an alternate solution if either the Data collection component or Data transmission component of a LEWS fails. (ii) Forecasting algorithm provides extra lead-time for early warning and solves the problem of less lead-time during early warning process. The breakthrough is even when the real-time landslide monitoring parameters are not available for various reasons, these algorithms take the minimal input of rainfall forecast information for nowcasting and forecasting thus restoring the broken chain of operation of LEWS. [ABSTRACT FROM AUTHOR]

This review paper presents a comprehensive and full review of the so-called optimization algorithm, multi-verse optimizer algorithm (MOA), and reviews its main characteristics and procedures. This optimizer is a kind of the most recent powerful nature-inspired meta-heuristic algorithms, where it has been successfully implemented and utilized in several optimization problems in a variety of several fields, which are covered in this context, such as benchmark test functions, machine learning applications, engineering applications, network applications, parameters control, and other applications of MOA. This paper covers all the available publications that have been used MOA in its application, which are published in the literature including the variants of MOA such as binary, modifications, hybridizations, chaotic, and multi-objective. Followed by its applications, the assessment and evaluation, and finally the conclusions, which interested in the current works on the optimization algorithm, recommend potential future research directions. [ABSTRACT FROM AUTHOR]

This paper concentrates on a parallel acceleration method of optimizing Gaussian hyper-parameters with the maximum likelihood estimation. In the process of optimizing the hyper-parameters, many calculations of the kernel matrix inversion will be operated. With an increase of the kernel matrix scale, the high computation burden will be generated. In order to improve the calculating efficiency, we introduce a decomposing and iterative (DI) algorithm. This algorithm divides the large-scale kernel matrix into four blocks and solves the matrix inversion with constant iterations. Due to the independency of the calculations of the sub-matrix blocks, it is quite suitable to put the sub-matrix blocks computation in graphics processing unit. Hence, the parallel decomposing and iterative (DIP) algorithm is introduced. The inverted pendulum and ball-plate system experiments are carried out to confirm the effectiveness of the DI and DIP algorithms. Based on the simulation results, the proposed DI and DIP algorithms shed light on real engineering application in the future. This paper also provides a practical and feasible approach to accelerate the optimization of hyper-parameters with maximum likelihood estimation. [ABSTRACT FROM AUTHOR]

Coronaviruses (CoVs) are a large family of viruses that are common in many animal species, including camels, cattle, cats and bats. Animal CoVs, such as Middle East respiratory syndrome-CoV, severe acute respiratory syndrome (SARS)-CoV, and the new virus named SARS-CoV-2, rarely infect and spread among humans. On January 30, 2020, the International Health Regulations Emergency Committee of the World Health Organisation declared the outbreak of the resulting disease from this new CoV called 'COVID-19', as a 'public health emergency of international concern'. This global pandemic has affected almost the whole planet and caused the death of more than 315,131 patients as of the date of this article. In this context, publishers, journals and researchers are urged to research different domains and stop the spread of this deadly virus. The increasing interest in developing artificial intelligence (AI) applications has addressed several medical problems. However, such applications remain insufficient given the high potential threat posed by this virus to global public health. This systematic review addresses automated AI applications based on data mining and machine learning (ML) algorithms for detecting and diagnosing COVID-19. We aimed to obtain an overview of this critical virus, address the limitations of utilising data mining and ML algorithms, and provide the health sector with the benefits of this technique. We used five databases, namely, IEEE Xplore, Web of Science, PubMed, ScienceDirect and Scopus and performed three sequences of search queries between 2010 and 2020. Accurate exclusion criteria and selection strategy were applied to screen the obtained 1305 articles. Only eight articles were fully evaluated and included in this review, and this number only emphasised the insufficiency of research in this important area. After analysing all included studies, the results were distributed following the year of publication and the commonly used data mining and ML algorithms. The results found in all papers were discussed to find the gaps in all reviewed papers. Characteristics, such as motivations, challenges, limitations, recommendations, case studies, and features and classes used, were analysed in detail. This study reviewed the state-of-the-art techniques for CoV prediction algorithms based on data mining and ML assessment. The reliability and acceptability of extracted information and datasets from implemented technologies in the literature were considered. Findings showed that researchers must proceed with insights they gain, focus on identifying solutions for CoV problems, and introduce new improvements. The growing emphasis on data mining and ML techniques in medical fields can provide the right environment for change and improvement. [ABSTRACT FROM AUTHOR]

Heart disease is the most life-threatening disease globally, affecting human life very critically. On-time and precise diagnosis of heart disease is vital for the prevention and treatment of heart failure. In the earlier stage, several detection techniques were developed to detect heart disease using machine learning techniques. But the heart problems have not been detected accurately with the minimum required time. This paper presented an effective heart disease prediction system that accurately diagnoses abnormality within a short duration. The feature selection process is carried with stochastic gradient boosting with a recursive feature elimination approach. For classification, the features are clustered by using the adaptive Harris hawk optimization clustering approach. Based on clustered features, the classification is processed with an enhanced deep genetic algorithm. This method improves the performance of the deep neural network by augmenting its initial weights with an enhanced genetic algorithm, which recommends better weights for the neural network. The demonstration of the proposed work is simulated in the MATLAB platform and the dataset used in UCI machine learning repository. The experimental outcome shows that the developed feature selection and classification approach attain 98.36% and 97.3% accuracy compared with the state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

In this paper, we present the concept and the prototype implementation of our novel "Smart Observatory of Involuntary Medical Seizures (SOIMS)". SOIMS merges Wireless Body Area Networks (WBAN), Internet of Things (IoT) and Machine Learning (ML) as an intelligent platform for the prediction and modelling of involuntary seizures. The prediction process is elaborated with our proposed algorithms, namely, Qualifying Linear Regression Algorithm (QuLRA), Selective Clustering Algorithm (SeCA) and Real Time Clusters Correlation Algorithm (RT2CA). The assessment of the proposed system is validated based on the Physionet ECG patients' dataset. The implementation of the prototype involves an IoT/WEB proxy security embedded for translation between nodes CoAP/DTLS protocol and Hospital Information System (HIS) HTTP/TLS protocol. Our proposed solution outperforms existing schemes in the literature at different levels, namely: a) it uses a hierarchical combination of machine learning and prediction algorithms; b) it is open-source, interoperable and user friendly; c) it is a secured prototype implementation; and d) it reaches a higher rate of accuracy according to the correlation criterion. [ABSTRACT FROM AUTHOR]

In this paper, we propose an algorithm for constructing variable-valued logical functions in the case of adding new production rules. The algorithm proposed serves as the basis for the method of constructive learning for logical neural networks based on variable-valued predicates. [ABSTRACT FROM AUTHOR]

This paper utilizes the cognitive radio (CR) spectrum to the fullest extent for extended applications requiring discretion. The CR technology provides various supports for cognitive radio networks (CRNs). The latter has CR nodes that sense free channels. Then, the CRN allocates the unused channels to secondary users (SUs) or unlicensed users. This allocation is termed the spectrum handoff. In this paper, by considering the identical channels in CR networks, a novel machine learning algorithm (the support vector machine—SVM) is employed. In addition, the queuing model of the preemptive resume priority M/M/1 is used. The proposed spectrum handoff algorithm selects the best possible CR network channel. The spectrum handoff algorithm uses the stated SVM algorithm scheme, which covers the transmitted and received power, the minimum service time, the data rate and the maximum vacancy time for the SU, to attain the maximum throughput. However, in multi-user greedy channel selection (GCS), only two parameters are considered. The proposed spectrum handoff algorithm based on the SVM scheme enhances the performance, and the SU throughput is improved to 68.7%. This approach is better than the GCS channel selection scheme. Additionally, this approach decreases the number of spectrum handoffs. As a result, the training accuracy of the SVM method is 97.6%, and it outperforms conventional methods. [ABSTRACT FROM AUTHOR]

With the development of artificial intelligence, big data classification technology provides the advantageous help for the medicine auxiliary diagnosis research. While due to the different conditions in the different sample collection, the medical big data is often imbalanced. The class-imbalance problem has been reported as a serious obstacle to the classification performance of many standard learning algorithms. SMOTE algorithm could be used to generate sample points randomly to improve imbalance rate, but its application is affected by the marginalization generation and blindness of parameter selection. Focusing on this problem, an improved SMOTE algorithm based on Normal distribution is proposed in this paper, so that the new sample points are distributed closer to the center of the minority sample with a higher probability to avoid the marginalization of the expanded data. Experiments show that the classification effect is better when use proposed algorithm to expand the imbalanced dataset of Pima, WDBC, WPBC, Ionosphere and Breast-cancer-wisconsin than the original SMOTE algorithm. In addition, the parameter selection of the proposed algorithm is analyzed and it is found that the classification effect is the best when the distribution characteristics of the original data was maintained best by selecting appropriate parameters in our designed experiments. [ABSTRACT FROM AUTHOR]

In this paper, we provide an overview of effective EM-like learning algorithms for latent Dirichlet allocation (LDA) models and additively regularized topic models (ARTMs). First, we review 11 techniques for efficient topic modeling based on synchronous and asynchronous parallel computing, distributed data storage, streaming, batch processing, RAM optimization, and fault tolerance improvement. Second, we review 14 effective implementations of topic modeling algorithms proposed in the literature over the past 10 years that use different combinations of the techniques mentioned above. Their comparative analysis is carried out. [ABSTRACT FROM AUTHOR]

Autonomous driving approaches today are mainly based on perception-planning-action modular pipelines and the End2End paradigm respectively. The End2End paradigm is a strategy that directly maps raw sensor data to vehicle control actions. This strategy is very promising and appealing because complex module design and cumbersome data labeling are avoided. Since this approach lacks a degree of interpretability, safety and practicability. we propose an autonomous driving approach based on trajectory learning using deep neural networks in this paper. In comparison to End2End algorithm, it is found that the trajectory learning algorithm performs better in autonomous driving. As for trajectory learning algorithm, the CNN_Raw-RNN network structure is established, which is verified to be more effective than the original CNN_LSTM network structure. Besides, we propose an autonomous driving architecture of a pilot and copilot combination. The pilot is responsible for trajectory prediction via imitation learning with labeled driving trajectories, while the copilot is a safety module that is employed to verify the effectiveness of the vehicle trajectory by the results of the semantic segmentation auxiliary task. The proposed autonomous driving architecture is verified with a real car on urban roads without manual intervention within 40 km. [ABSTRACT FROM AUTHOR]

Algorithmic vision, the computational process of making meaning from digital images or visual information, has changed the relationship between the image and the human subject. In this paper, I explicate on the role of algorithmic vision as a technique of algorithmic governance, the organization of a population by algorithmic means. With its roots in the United States post-war cybernetic sciences, the ontological status of the computational image undergoes a shift, giving way to the hegemonic use of automated facial recognition technologies towards predatory policing and profiling practices. By way of example, I argue that algorithmic vision reconfigures the philosophical links between vision, image, and truth, paradigmatically changing the way a human subject is represented through imagistic data. With algorithmic vision, the relationship between subject and representation challenges the humanistic discourse around images, calling for a critical displacement of the human subject from the center of an analysis of how computational images make meaning. I will explore the relationship between the operative image, the image that acts but is not seen by human eyes, and what Louise Amoore calls an "emergent subject," a subject that is made visible through algorithmic techniques (2013). Algorithmic vision reveals subjects to power in a mode that requires a new approach towards analyzing the entanglement and invisiblization of the human in automated decision-making systems. [ABSTRACT FROM AUTHOR]

During 2018, as part of a research project funded by the Deviant Practice Grant, artist Bruno Moreschi and digital media researcher Gabriel Pereira worked with the Van Abbemuseum collection (Eindhoven, NL), reading their artworks through commercial image-recognition (computer vision) artificial intelligences from leading tech companies. The main takeaways were: somewhat as expected, AI is constructed through a capitalist and product-focused reading of the world (values that are embedded in this sociotechnical system); and that this process of using AI is an innovative way for doing institutional critique, as AI offers an untrained eye that reveals the inner workings of the art system through its glitches. This paper aims to regard these glitches as potentially revealing of the art system, and even poetic at times. We also look at them as a way of revealing the inherent fallibility of the commercial use of AI and machine learning to catalogue the world: it cannot comprehend other ways of knowing about the world, outside the logic of the algorithm. But, at the same time, due to their "glitchy" capacity to level and reimagine, these faulty readings can also serve as a new way of reading art; a new way for thinking critically about the art image in a moment when visual culture has changed form to hybrids of human–machine cognition and "machine-to-machine seeing". [ABSTRACT FROM AUTHOR]

Introduction: Pain is the unpleasant sensation and emotional experience that leads to poor quality of life for millions of people worldwide. Considering the complexity in understanding the principles of pain and its significant impact on individuals and society, research focuses to deliver innovative pain relief methods and techniques. This review explores the clinical uses of machine learning (ML) for the diagnosis, classification, and management of pain. Methods: A systematic review of the current literature was conducted using the PubMed database library. Results: Twenty-six papers related to pain and ML research were included. Most of the studies used ML for effectively classifying the patients' level of pain, followed by use of ML for the prediction of manifestation of pain and for pain management. A less common reason for performing ML analysis was for the diagnosis of pain. The different approaches are thoroughly discussed. Conclusion: ML is increasingly used in pain medicine and appears to be more effective compared to traditional statistical approaches in the diagnosis, classification, and management of pain. [ABSTRACT FROM AUTHOR]