Search

Accurate traffic congestion estimation and prediction are critical building blocks for smart trip planning and rerouting decisions in transportation systems. Over the decades, there have been many studies focusing on traffic congestion estimation and prediction with different statistical approaches (e.g., Markov chain) and machine learning models (e.g., clustering, Bayesian networks, and artificial neural networks). However, there is a lack of a unified framework to address the mechanisms of different models and integrate the advantages of different methods through combinations. This paper introduces the FD-Markov-LSTM model, a hybrid interpretable approach that combines the fundamental diagram (FD), Markov chain, and long short-term memory (LSTM). The aim is to estimate and predict traffic states by integrating statistical data in both congested and uncongested scenarios. The FD-Markov-LSTM model leverages the FD to identify hierarchical traffic states and utilizes the Markov process to capture the probabilistic transitions between these states. We employ the LSTM model to further capture the residual time series produced by the Markov chain model (assuming a memoryless property) to enhance the estimation and prediction performance. The proposed model's accuracy in estimating and predicting traffic flow is evaluated using empirical data from three case studies conducted in Beijing and Los Angeles. The results highlight a significant improvement in accuracy compared to classical benchmark models such as the Markov model, ARIMA model, k-Nearest Neighbor model, Random Forest model, and LSTM. Specifically, the FD-Markov-LSTM model achieves reductions of over 39% in mean absolute error, 35% in root mean squared error, and 7.4% in mean absolute percentage error. These results clearly demonstrate that the FD-Markov-LSTM model outperforms the benchmark models, enabling more precise predictions of traffic flow. [ABSTRACT FROM AUTHOR]

The Internet has revolutionised the way information is retrieved, and the increase in the number of users has resulted in a surge in the volume and heterogeneity of available data. Recommender systems have become popular tools to help users retrieve relevant information quickly. Food Recommender Systems (FRS), in particular, have proven useful in overcoming the overload of information present in the food domain. However, the recommendation of food is a complex domain with specific characteristics causing many challenges. Additionally, very few systematic literature reviews have been conducted in the domain on FRS. This paper presents a systematic literature review that summarises the current state-of-the-art in FRS. Our systematic review examines the different methods and algorithms used for recommendation, the data and how it is processed, and evaluation methods. It also presents the advantages and disadvantages of FRS. To achieve this, a total of 67 high-quality studies were selected from a pool of 2,738 studies using strict quality criteria. The review reveals that the domain of food recommendation is very diverse, and most FRS are built using content-based filtering and ML approaches to provide non-personalised recommendations. The review provides valuable information to the research field, helping researchers in the domain to select a strategy to develop FRS. This review can help improve the efficiency of development, thus closing the gap between the development of FRS and other recommender systems. • Most recommender systems use content-based filtering and predict recommendations with various machine learning algorithms. • Graph-based systems that employ various machine learning algorithms for recommendation are prevalent recently. • Several studies ignore personal attributes of users when producing recommendations. • Most systems use one source for their data, which is most often Allrecipes. • Offline evaluation with accuracy-based metrics is widely-used for measuring the performance of the FRS. [ABSTRACT FROM AUTHOR]

Simulation-driven structural health monitoring (SHM) is crucial for enhancing the safety and reliability of structures. Its primary aim is to utilize numerical simulations to design efficient SHM systems, reducing costs while maintaining effectiveness. However, challenges arise due to disparities between simulations and physical measurements, stemming from uncertainties, noise, and simplifications. These challenges also extend to SHM methods using machine learning, particularly deep neural networks (DNNs). This paper bridges the gap between DNNs trained on simulated data and real-world experiments by investigating three transfer learning (TL) techniques: feature augmentation, direct fine-tuning, and boosting-based fine-tuning. The focus is on guided wave damage interaction coefficients (WDICs) as damage-sensitive features, modeled by DNNs for damage identification in thin plates, commonly found in aerospace structures like aircraft fuselages. This classification task compares measured and predicted WDICs in a common guided wave SHM configuration with one actuator and three sensors. Training and extensive testing datasets are generated using advanced finite element simulations and laser Doppler vibrometer experiments. The study demonstrates that TL techniques significantly enhance DNN prediction accuracy and improve damage identification performance for untrained scenarios compared to purely simulation-based DNNs. Among the TL approaches explored, feature augmentation with appropriate activation functions and boosting-based fine-tuning yield the most promising results. Using four out of twelve TL datasets, feature augmentation reduces the simulation-based mean absolute percentage error from 46.80% to 35.98% and increases coefficient of determination R 2 values from 0.02 to 0.72. With six TL datasets and a boosting-based fine tuning, the mean absolute percentage error decreases from 47.42% to 35.20%, maintaining similar R 2 values. While TL substantially enhances prediction accuracy, its impact on damage identification is slightly less pronounced, with improvements in relative classification accuracy by approximately 5% compared to simulation-based DNNs. These findings highlight the efficacy of TL techniques for damage identification in thin plates using WDICs and DNNs, emphasizing the influence of TL training and DNN model variations. Furthermore, they showcase the potential of TL methods to enhance DNN performance in future SHM applications, particularly emphasizing the promise of feature augmentation and boosting. • Novel simulation-driven structural health monitoring technique using guided waves. • Deep neural network modeling to predict wave damage interaction coefficients. • Bridging disparity between simulations and experiments through transfer learning. • Study of transfer learning techniques based on feature augmentation and fine tuning. • Demonstrated significant enhancement in simulation-based neural network performance. [ABSTRACT FROM AUTHOR]

Due to the operation of modern industrial equipment under high pressure, high speed and high load conditions, cracks inevitably appear on the surfaces of metal components. Crack detection on metal surfaces is increasingly becoming a focal point in the field of non-destructive testing. In order to locate and quantitatively analyze surface cracks on metallic materials as early as possible to reduce the cost in industrial production, this paper achieves rapid localization of surface cracks by establishing a line laser thermography scanning system. An unsupervised edge detection algorithm of principal component analysis combined with K-means (PK) is proposed to achieve accurate crack edge detection by combining with a point-pulse laser thermography system. The accuracy of the PK algorithm is confirmed by comparison with other edge detection algorithms. After that, accurate identification of crack depth is achieved by selecting temperature features through particle swarm optimization algorithm and optimizing hyper-parameters of support vector machine and k-nearest neighbor through Bayesian search method. The experiments show that the best recall and accuracy of PK for crack detection are 82.9% and 86.2%, respectively; Combining the particle swarm optimization algorithm with the BS method, the mean square error of SVR and KNN for crack depth recognition is 0.092 and 0.089, respectively. [ABSTRACT FROM AUTHOR]

Due to the increasing use of Machine Learning models in high stakes decision making settings, it has become increasingly important to have tools to understand how models arrive at decisions. Assuming an already trained Supervised Classification model, post-hoc explanations can be obtained via so-called counterfactual analysis: a counterfactual explanation of an instance indicates how this instance should be minimally modified so that the perturbed instance is classified in the desired class by the given Machine Learning classification model. Most of the Counterfactual Analysis literature focuses on the single-instance single-counterfactual setting, in which the analysis is done for one single instance to provide one single counterfactual explanation. Taking a stakeholder's perspective, in this paper we introduce the so-called collective counterfactual explanations. By means of novel Mathematical Optimization models, we provide a counterfactual explanation for each instance in a group of interest, so that the total cost of the perturbations is minimized under some linking constraints. Making the process of constructing counterfactuals collective instead of individual enables us to detect the features that are critical to the entire dataset to have the individuals classified in the desired class. Our methodology allows for some instances to be treated individually, as in the single-instance single-counterfactual case, performing the collective counterfactual analysis for a fraction of records of the group of interest. This way, outliers are identified and handled appropriately. Under some assumptions on the classifier and the space in which counterfactuals are sought, finding collective counterfactual explanations is reduced to solving a convex quadratic linearly constrained mixed integer optimization problem, which, for datasets of moderate size, can be solved to optimality using existing solvers. The performance of our approach is illustrated on real-world datasets, demonstrating its usefulness. • A new model for Explainable Artificial Intelligence is proposed. • Counterfactual Explanations for a full group of individuals are sought. • Sparsity both at individual and group level is achieved. [ABSTRACT FROM AUTHOR]

Optimal path planning is a fundamental problem in artificial intelligence (AI) and has wide applications in areas such as robotics, transportation, and logistics. In this paper, we propose a novel approach for ordering algorithms in pathfinding problems using the concept of shell layers. Our approach aims to improve the computational efficiency and distance cost of ordering algorithms. To evaluate the effectiveness of our approach, we compare it with five state-of-the-art techniques commonly used in the field of ordering algorithms on eight different scenarios with varying configurations. Our results show that our proposed approach outperformed the state-of-the-art techniques in terms of time-computational complexity and distance cost in most of the scenarios, demonstrating its potential as a new state-of-the-art technique for ordering algorithms. Specifically, our approach outperformed the nearest neighbor, A*, branch and bound, Christofides, and genetics ordering algorithms. However, we also identified two specific situations where our approach was outperformed by two state-of-the-art algorithms due to the specific distribution of the goal nodes. These findings highlight the importance of evaluating and comparing ordering algorithms in various scenarios. Our approach has significant implications for AI research and development, as it has the potential to improve the performance of pathfinding algorithms in various applications. We also discuss the limitations of our approach and potential areas for further research, such as investigating the effectiveness of our approach in different types of graphs and exploring the potential use of machine learning techniques to optimize the shell layer construction. The code for this study is available at https://github.com/abdullah1aloush1/MuGONA. • Equally-spaced nodes formed over workspace with obstacles, optimizing search process. • Efficient neighboring graph built for equally-spaced nodes, reducing complexity. • Path optimization for navigation by ordering goal nodes, reducing time and distance. • Path smoothing for navigation via interpolation to yield a trajectory on path nodes. [ABSTRACT FROM AUTHOR]

Due to the enormous amount of user-generated content being generated on the web, labeling such data is a time-consuming and expensive endeavor. As a result, we have limited annotated data and the vast majority of data are unlabeled. Analysis reveals that extracting (external) knowledge from unlabeled data and integrating it with knowledge extracted from labeled data is a beneficial task for text information processing, in particular text classification. In this paper, we present a hybrid approach for classifying sentiments that employs external knowledge, which is categorized as either general-purpose sentiment knowledge or domain-related knowledge. General-purpose sentiment knowledge is extracted from sentiment lexicons, whereas domain-related knowledge is extracted from unlabeled data from the same or related domains. Similar domains for a given domain are identified based on their similarity score in terms of overlapping features. The proposed approach utilizes both forms of external knowledge and combines them with logistic regression to train an improved classification model. The classification model uses the conventional gradient descent algorithm for optimization, and its convergence analysis indicates that it is convex and converges to the global optimum. The proposed approach is empirically evaluated and compared to three baselines and one state-of-the-art method using standard performance evaluation metrics on a multi-domain sentiment dataset. The experiment results are encouraging, demonstrating that the proposed approach considerably outperforms the baseline approaches and outperforms the state-of-the-art approach by up to 2% in terms of both f-score and accuracy. • A hybrid approach for document-level sentiment classification that makes use of external knowledge. • A domain-specific knowledge extraction approach from unlabeled text documents. • A detailed convergence analysis of the proposed optimization model used in the proposed approach. [ABSTRACT FROM AUTHOR]

To improve the classification accuracy of hand movements from sEMG signals, this paper puts forward a unified hand gesture classification framework which exploits the potentials of variational mode decomposition (VMD) and multi-class support vector machine (SVM). Acquiring the sEMG signals from 25 intact subjects for ten functional activities in real-time, we implement a non-recursive adaptive decomposition technique to sEMG signals and perform power spectral analysis to identify the dominant narrow-band intrinsic mode functions (IMFs) that contain prominent biomarkers. Subsequently, to compute the optimal feature vectors from a set of entropy measures, this work investigates the performance of two techniques namely minimum redundancy and maximum relevance (MRMR) technique and kernel principal component analysis (kPCA). After extracting the optimal set of entropy features, the proposed approach implements a multi-class SVM based on one-vs-one (OVO) strategy to classify the hand gestures. The performance of the multi-class SVM compared with those of the K-nearest neighbor (KNN) and naïve bayes (NB) classifiers highlight that multi-class SVM offers superior performance with an average classification accuracy of 99.98%. Moreover, for statistical analysis of the experimental results, this work performs Friedman test to analyze the significance of the SVM, KNN and NB classifier performances. Finally, the performance comparison of the proposed approach with those of the state-of-the-art techniques highlights the superiority of the proposed framework to improve the hand gesture classification accuracy. • VMD augmented multi-class SVM framework is presented for gesture recognition. • Optimal entropy measures from decomposed IMFs are extracted through kPCA technique. • A maximum classification accuracy of 99.98% is achieved using multi-class SVM. • Statistical analysis of ML classifier models is performed using Friedman test. [ABSTRACT FROM AUTHOR]

Stochastic optimization (SO) algorithms based on the Powerball function, namely powered stochastic optimization (PoweredSO) algorithms, have been confirmed, effectively, and demonstrated great potential in the context of large-scale optimization and machine learning tasks. Nevertheless, the issue of how to determine the learning rate for PoweredSO is a challenge and still unsolved problem. In this paper, we propose a class of adaptive PoweredSO approaches that are efficient, scalable and robust. It takes advantage of the hypergradient descent (HD) technique to automatically acquire an online learning rate for PoweredSO-like methods. In the first part, we study the behavior of the canonical PoweredSO algorithm, the Powerball stochastic gradient descent (pbSGD) method, with HD. The existing PoweredSO algorithms also suffer from the high variance because they take the similar algorithmic framework to SO algorithms, arising from sampling tactics. Therefore, the second portion develops an adaptive powered variance-reduced optimization method via utilizing both variance-reduced technique and HD. Moreover, we present the convergence analysis of the proposed algorithms and explore their iteration complexity on non-convex cases. Numerical experiments are conducted on machine learning tasks, verifying the superior performance over modern SO algorithms. • We propose a type of adaptive powered stochastic optimization algorithms. • The theoretical analysis of the resulting algorithms is established. • Experiments on machine learning tasks verify the efficacy of the algorithms. [ABSTRACT FROM AUTHOR]

At present, the serious challenge of human-robot collaboration is how to establish an interaction interface with multi-directional interactivity and robustness. This paper applies surface electromyography (sEMG) signals as the interface medium, and proposes a robust 3D arm strength estimation model based on hybrid deep learning networks (R3DNet) to build a stable interaction interface and achieve reliable human-robot collaboration performance in 3D operation scenarios. R3DNet adopts the modular design idea and includes a feature extraction module, a regression estimation module, and a robust enhancement module. In the feature extraction module, an autoencoder structure-based network and a new loss function are proposed to extract the fusion features of multi-channel sEMG signals. In the regression estimation module, an arm strength model based on transfer learning algorithms is proposed. This model considers the similarity of arm strength estimation in each direction and realizes the arm strength estimation from one to three dimensions through the fine-tune strategy. The robust enhancement module adopts a residual structure and aims to address the problem of poor model robustness due to non-ideal conditions such as electrode displacement, muscle fatigue, muscle time-varying characteristics and differences in muscle characteristics among subjects. Further, an improved adaptive admittance control method is proposed to help the robot to adjust collaborative behavior according to the changing arm strength of the human tutor. The results of comparison experiments and multi-point flexible assembly experiments verify the validity and engineering realizability of R3DNet for human-robot collaboration. [ABSTRACT FROM AUTHOR]

• AER system utilizes kinematic data for enhanced human–computer interaction. • Diverse algorithms achieve >99% success (small windows), >88% (larger). • Innovative analysis: joint neighborhood, window size, axis combination efficiency. • Practical CNN algorithms enable real-time emotion recognition. • Insights from transparent datasets lead to emotion recognition advancements. This study introduces an automatic emotion recognition system (AER) focusing on skeletal-based kinematic datasets for enhanced human–computer interaction. Departing from conventional approaches, it achieves real-time emotion recognition in real-life situations. The dataset covers seven emotions and undergoes assessment by eight diverse machine and deep learning algorithms. A thorough investigation is undertaken by varying window sizes and data states, including raw positions and feature-extracted data. The findings imply that incorporating advanced techniques like joint-related feature extraction and robust classifier models yields promising outcomes. Dataset augmentation via varying window sizes enriches insights into real-world scenarios. Evaluations exhibit classification accuracy surpassing 99% for small windows, 94% for medium, and exceeding 88% for larger windows, thereby confirming the robust nature of the approach. Furthermore, we highlight window size's impact on emotion detection and the benefits of combining coordinate axes for efficiency and accuracy. The analysis intricately examines the contributions of features at both the joint and axis levels, assisting in making well-informed selections. The study's contributions include carefully curated datasets, transparent code, and models, all of which ensure the possibility of replication. The paper establishes a benchmark that bridges theory and practicality, solidifying the proposed approach's effectiveness in balancing accuracy and efficiency. By pioneering advanced AER through kinematic data, it sets a new standard for efficacy while driving seamless human–computer interaction through rigorous analysis and strategic design. [ABSTRACT FROM AUTHOR]

This paper introduces new flexible loss functions for binary classification in Gradient-Boosted Decision Trees (GBDT) that combine Dice-based and cross-entropy-based losses and offer link functions from either a generalized extreme value (GEV) or exponentiated exponential logistic (EEL) distribution. Testing 27 different GBDT models using XGBoost on a Freddie Mac mortgage loan database showed that the choice of the loss function is useful. Specifically, when the class imbalance ratio (IR) is less than 99, using a skewed GEV distribution-based link function in XGBoost enhances discriminatory power and classification accuracy while retaining a simple model structure, which is particularly important in credit scoring applications. In cases where class imbalances are severe, typically between IRs of 99 and 200, we found that an advanced loss function, which is composed of a symmetric hybrid loss function and a link derived from a positively skewed EEL distribution, outperforms other XGBoost variants. Based on our findings, the accuracy improvements of these proposed extensions result in lower misclassification costs, which are especially evident when IR is below 99, which results in higher profitability for the business. Furthermore, the study highlights the transparency associated with GBDT, which is also an integral component of financial applications. Researchers and practitioners can use these insights to create more accurate and discriminative machine learning models, with possible extensions to other GBDT implementations and machine learning techniques that take into account loss functions. The source code for the proposed approach is publicly available at https://github.com/jm-ml/flexible-losses-for-binary-classification-with-GBDT. [ABSTRACT FROM AUTHOR]

In this paper, we propose a physics-informed neural network-based scheme to solve time-varying impulsive fractional differential equations without any labeled data. At first, the existence and uniqueness of the solution of the impulsive fractional system are proved theoretically using the Bourdin state transition matrix-based solution representation and the Banach fixed point theorem. The proposed method uses the physics-informed neural network, extreme learning machines, and the theory of functional connections. A neural network is employed as the free function to construct the constrained expression. Based on the constrained expression, the linear system is trained using the extreme learning machine algorithm, and the nonlinear system is trained using the iterative least squares method, as the only trainable parameters are the output weights. The convergence and error analysis for the algorithm is derived. The neural network training is graphically demonstrated for the nonlinear system using the loss obtained in each iteration. For the linear case, the results are validated with the original solution, while for the nonlinear case, it is verified with the original solution and other classical methods. The primary use of the theory of functional connections is it helps the solution satisfy the physical constraint. • Existence of solution of time-varying IFDE is proved by Banach theory and STM. • PINN-XTFC approach for time-varying IFDE is developed. • The convergence and error analysis are derived in detail. • Error for certain examples is compared with the classical PINN-based solution. [ABSTRACT FROM AUTHOR]

Deep machine learning models including Convolutional Neural Networks (CNN) have been successful in the detection of Mild Cognitive Impairment (MCI) using medical images, questionnaires, and videos. This paper proposes a novel Multi-branch Classifier-Video Vision Transformer (MC-ViViT) model to distinguish MCI from those with normal cognition by analyzing facial features. The data comes from the I-CONECT, a behavioral intervention trial aimed at improving cognitive function by providing frequent video chats. MC-ViViT extracts spatiotemporal features of videos in one branch and augments representations by the MC module. The I-CONECT dataset is challenging as the dataset is imbalanced containing Hard-Easy and Positive–Negative samples, which impedes the performance of MC-ViViT. We propose a loss function for Hard-Easy and Positive–Negative Samples (HP Loss) by combining Focal loss and AD-CORRE loss to address the imbalanced problem. Our experimental results on the I-CONECT dataset show the great potential of MC-ViViT in predicting MCI with a high accuracy of 90.63% accuracy on some of the interview videos. • We propose MC-ViViT to detect MCI from facial videos in the I-CONECT Study. • We design the MC module to enrich the extracted spatio-temporal features. • We develop HP loss to address the inter-and intra-class imbalanced data. [ABSTRACT FROM AUTHOR]

Multi-instance learning (MIL), as a special version of classification, focuses on labeled sets (bags) consisting of unlabeled instances and has drawn accumulative attention due to its significant importance in practical applications. However, most existing MIL methods just utilize partial information (bags or instances) of MIL data to construct the kernel function, resulting in deteriorated classification performance of MIL. In this paper, we propose a Double Similarities weighted Multi-Instance Learning (DSMIL) kernel framework, which utilizes the similarities of Bag-to-Bag (B2B) and Instance-to-Bag (I2B). In the proposed kernel framework, the similarities of B2B and I2B could be derived from the prototypes distance of inter-bag and similarity matrix of intra-bag, respectively, based on the affinity propagation (AP) clustering of the bag. Meanwhile, we give theoretical proof of the validity of the designed kernel function. Experimental results on benchmark and semi-synthetic datasets show that our proposed method obtains competitive classification performance and achieves robustness to parameters and noise. • A double similarities weighted MIL kernel is proposed and proved as a valid kernel. • The DSMIL integrates the similarities of B2B and I2B into the kernel function. • The DSMIL obtains competitive results on benchmark datasets and newsgroups dataset. [ABSTRACT FROM AUTHOR]

Learning convolutional networks on graphs have been a popular topic for machine learning on graph-structured data and achieved state-of-the-art results on various practical tasks. However, most existing works ignore the impact of per-class distribution, therefore their performance may be limited due to the diversity of various categories. In this paper, we propose a novel class-aware progressive self-training (CPS) algorithm for training graph convolutional networks (GCNs). Compared to other self-training algorithms for GCNs' learning, the proposed CPS algorithm leverages the class distribution to update the original graph structure in each self-training loop, including: (a) find these high-confident unlabeled nodes in the graph for each category to add pseudo labels, in order to enlarge the current set of labeled nodes; (b) delete these noisy edges between different classes for graph sparsification. Then, the optimized graph is used for next self-training loops in hopes of enhancing the classification performance. We evaluate the proposed CPS on several datasets commonly used for GCNs' learning, and the experimental results show that the proposed CPS algorithm outperforms other baselines. [ABSTRACT FROM AUTHOR]

Predicting the difficulty of playing a musical score is essential for structuring and exploring score collections. Despite its importance for music education, the automatic difficulty classification of piano scores is not yet solved, mainly due to the lack of annotated data and the subjectiveness of the annotations. This paper aims to advance the state-of-the-art in score difficulty classification with two major contributions. To address the lack of data, we present Can I Play It? (CIPI) dataset, a machine-readable piano score dataset with difficulty annotations obtained from the renowned classical music publisher Henle Verlag. The dataset is created by matching public domain scores with difficulty labels from Henle Verlag, then reviewed and corrected by an expert pianist. As a second contribution, we explore various input representations from score information to pre-trained ML models for piano fingering and expressiveness inspired by the musicology definition of performance. We show that combining the outputs of multiple classifiers performs better than the classifiers on their own, pointing to the fact that the representations capture different aspects of difficulty. In addition, we conduct numerous experiments that lay a foundation for score difficulty classification and create a basis for future research. Our best-performing model reports a 39.5% balanced accuracy and 1.1 median square error across the nine difficulty levels proposed in this study. Code, dataset, and models are made available for reproducibility. • Introducing CIPI, the most comprehensive piano difficulty dataset, with 652 pieces across 9 levels. • We design models using various music performance aspects, guided by musicology insights. • Using multi-view music performance model predictions boosts accuracy. • Choosing the right loss function is vital for ordinal regression tasks as difficulty prediction. • We carry out extensive experiments helpful for further research. [ABSTRACT FROM AUTHOR]

Optimizing drug dosages is essential for effective treatment. Clinical protocols may not suit all types of patients evenly, due to many drug trials not being designed to account for all comorbities or clinically relevant outcomes. Methodologies to optimize drug policies with observational data exist, but struggle due to limited data completeness in clinical settings. Computational methods can help overcome these challenges by leveraging field knowledge. This paper proposes an Individualized Doser (IDoser), a core dosing model that links drug dose to relevant covariates via a set of coefficients and includes a loss function to code needed assumptions and requirements. Coordinate descent is used to obtain a fitted model with minimal loss. The loss function also measures performance when validating the model with unseen data. We validated the proposed approach using the case of follicle-stimulating hormone (FSH) dosing for controlled ovarian stimulation (COS). When compared to clinical practice, IDoser achieved a net improvement of up to 31.97% in the validation cases. We present a simple but effective method to bridge the gap between current clinical dosing policies and gold policies based on the true underlying and often unknown dose–response functions. [Display omitted] • IDoser allows to incorporate domain knowledge in the dosing model. • The search for policy solutions is customizable depending on the dosing problem. • For FSH dosing, up to 31.97% improvement was observed against a clinical practice. • Its flexible capabilities indicate potential applicability for similar problems. [ABSTRACT FROM AUTHOR]

Automated Essay Scoring (AES) is a challenging topic in Natural Language Processing. Recently, deep learning models have achieved remarkable performance for the AES task. However, applying deep learning models to the AES system in practice is expensive when both data collection and model training are taken into consideration. This paper aims to tackle this problem by proposing the Crowdsourcing-based Automated Essay Scoring (CAES) framework. The proposed framework gradually collects data through crowdsourcing and incrementally trains the AES models. In particular, we propose the Incremental Learning with Dynamic Exemplar Herding (ILDEH) approach to simultaneously tackle catastrophic forgetting and concept drift. The proposed approach dynamically updates the exemplar set by the Dynamic Exemplar Herding algorithm to obtain the best approximation of the overall data distribution and selectively apply knowledge distillation on the model outputs by Linear Outlier Suppression loss to retain the learned knowledge. Moreover, we use a lightweight AES model for effective and efficient essay scoring. The experimental results show that our proposed ILDEH approach outperforms other strong baseline approaches for the AES task. Moreover, the CAES framework is able to steadily improve the AES performance in the crowdsourcing environment with only 10.6% training time of the conventional approach. Further analysis shows that one single CPU server can support daily updates of more than 300 AES models, which is sufficient for most practical AES systems. • We proposed the Crowdsourcing-based Automated Essay Scoring (CAES) framework. • We proposed an incremental learning approach to efficiently train AES models. • Our proposed approach outperforms strong baseline approaches. • The CAES framework requires only 10.6% of the conventional training time. • The CAES framework supports daily update of 300 AES models on a single CPU server. [ABSTRACT FROM AUTHOR]

Animation drama and movies are important entertainment sources for children and young people. However, many of these entertainment videos introduce ideas such as violence, fighting, abuse, and car accidents, which are not suitable for children and young people. In order to prevent children from viewing these videos, different countries' government bodies put restrictions on age on these videos. Violence detection is mostly done using manual inspection, which is time and resource consuming and cannot achieve a very good result. Therefore, artificial technologies such as deep learning and machine learning can detect violence in a video. Bleeding is one of the distinct characteristics of violent actions presented in such videos. This paper aims to propose a system that can detect a given video's blood in real-time. Researchers have proposed different image processing-based techniques to detect violence, but their proposed systems lack precision and real-time detection. To this end, a deep learning-based approach is proposed to detect violence in a given video and images. A Faster R-CNN model is modified due to the sophisticated characteristics of the violence in the cartoon and animation images to achieve the highest performance. The backbone of the proposed violence detection model is changed to a modified RegNet model to extract the features from the frame. The standard inner lateral connection is replaced with the modulated deformable convolutional (MDC) layer to extract deformable feature maps. A novel distributed attention module (DAM) is proposed on the feature pyramid network to improve the performance of the feature extraction. The multiscale Region of interest (ROI) Align is adapted to improve the detection performance of violence in a different scenario. Moreover, the classification approach is integrated with the detection model to classify the different levels of violence in a given frame. We have explored state-of-the-art object detection methods such as Faster R-CNN, Cascade R-CNN, yolov3-spp, SSD, FCOS, and yolov5 to detect violence in a particular frame of a video. We compared the different models' performances and found out that the modified Faster R-CNN is appropriate for real-time blood detection in a given video or image with high accuracy. This study makes a significant contribution to detecting violence in animation videos which will help different platforms and government bodies to regulate entertainment content. [ABSTRACT FROM AUTHOR]

• Exploring the effect of locally weighted learning with machine learning model. • Gain ratio are used to select the most important environmental factor. • LWL-RS-ADT appears as an accurate model in assessing landslide susceptibility. Assessing landslide susceptibility and predicting the possibility of landslide event is the foundation and prerequisite for emergency response and management of landslide disaster. The target of current paper is to propose five integration models based on integrating locally weighted learning (LWL) with a radial basis function classifier (RBF), Fisher's linear discriminant (FLDA), quadratic discriminant analysis (QDA), a Credal decision tree (CDT), an alternating decision tree (ADT) and random subspace (RS) and the performance of five integration models were compared for modeling landslide susceptibility. Yongxin County from China was employed as a study area, 364 landslide locations and fifteen environmental factors were applied. The results demonstrate that the proposed LWL-RS-ADT model is more reliable and stable than the other models. Among the fifteen environmental factors, NDVI, lithology, and altitude are the very significant factors in the six models. It is concluded that the proposed integration models provide an effective way to predict the susceptibility of landslides. [ABSTRACT FROM AUTHOR]

• Propose an improved random forest based on the improvement of decision trees. • Improve the evaluation mechanism for the classification effect of decision trees. • Propose a method for quantifying the diversity between decision trees. • Multiple tests verify the superiority of the proposed improved random forest. Random forest is one of the most widely used machine learning algorithms. Decision trees used to construct the random forest may have low classification accuracies or high correlations, which affects the comprehensive performance of the random forest. Aiming at these problems, the authors proposed an improved random forest based on the classification accuracy and correlation measurement of decision trees in this paper. Its main idea includes two parts, one is retaining the classification and regression trees (CARTs) with better classification effects, the other is reducing the correlations between the CARTs. Specifically, in the classification effect evaluation part, each CART was applied to make predictions on three reserved data sets, then the average classification accuracies were achieved, respectively. Thus, all the CARTs were sorted in descending order according to their achieved average classification accuracies. In the correlation measurement part, the improved dot product method was proposed to calculate the cosine similarity, i.e., the correlation, between CARTs in the feature space. By using the achieved average classification accuracy as reference, the grid search method was used to find the inner product threshold. On this basis, the CARTs with low average classification accuracy among CART pairs whose inner product values are higher than the inner product threshold were marked as deletable. The achieved average classification accuracies and correlations of CARTs were comprehensively considered, those with high correlation and weak classification effect were deleted, and those with better quality were retained to construct the random forest. Multiple experiments show that, the proposed improved random forest achieved higher average classification accuracy than the five random forests used for comparison, and the lead was stable. The G-means and out-of-bag data (OBD) score obtained by the proposed improved random forest were also higher than the five random forests, and the lead was more obvious. In addition, the test results of three non-parametric tests show that, there were significant diversities between the proposed improved random forest and the other five random forests. This effectively proves the superiority and practicability of the proposed improved random forest. [ABSTRACT FROM AUTHOR]

The human skin, the largest organ with multiple layered functionalities, houses melanocytes in the deeper strata of its epidermis. These cells can be adversely impacted by ultraviolet radiation, thereby instigating melanoma, the deadliest form of skin cancer. Failure to detect melanoma at an early stage can potentially lead to metastasis, forming complex tumors in other tissues. Despite substantial efforts, visual inspections can occasionally overlook melanoma cases due to inherent subjectivity. To surmount this challenge, an automated detection system is necessary. Recent attempts to establish such a system have predominantly employed "push-through" strategies involving deep (neural) networks and their ensembles, which however necessitate significant computational resources. This paper presents a novel approach, amalgamating a conventional machine learning technique, Bag of Visual Words, with a pretrained deep neural network for comprehensive deep feature extraction from enhanced input image patches. The proposed method, assessed on the ISIC Challenge 2017 dataset, surpassed all other entries on the challenge leader-board, registering an accuracy of 96.2% in the task of lesion classification. • Novel method for melanoma detection combining Bag of Visual Words with a deep network. • Patch-based feature extraction from lesion images integrated into BoVW with K-means. • Successful image enhancement technique for feature extraction from lesion images. • Efficient framework: modular architecture, easy updates, less training delay. [ABSTRACT FROM AUTHOR]

A metaheuristic-based structural optimization method, whilst being popularly adopted due to its advantages in by-passing gradient function calculations, requires the use of time-consuming advanced analyses for constraint evaluation. To overcome this drawback, the present paper proposes a robust (machine learning-based) optimization method that combines the light gradient boosting machine (LightGBM) with the efficient p-best differential evolution (E p DE) method. In essence, the LightGBM classification model is constructed to assess the constraint (safety and integrity) satisfaction of structures. An efficient framework using a so-called safety parameter is proposed to prevent inaccurate predictions of the LightGBM model. The E p DE processes the optimization procedures on the constructed classification LightGBM model. This enables an enhanced machine learning-based optimization technique that not only maintains the sufficiently accurate optimal design of structures but also significantly reduces the required computing efforts, as compared to standard optimization schemes. Various examples of steel structure designs (i.e., two of which have been provided herein) have been successfully performed by the proposed approach. These illustrate the accuracy and robustness of the proposed method, where good comparisons with reference algorithms (including standard DE with "DE/rand/1" mutational strategy, Jaya, Rao-1 and CaDE) are evidenced. The statistical values collected present the accuracy and reliability of the proposed method in obtaining the minimum total weight designs with substantial (some 60%) reduction of computing efforts required to furnish optimal results. [ABSTRACT FROM AUTHOR]

Common objectives in machine learning research are to predict the output quality of manufacturing processes, to perform root cause analysis in case of reduced quality, and to propose intervention strategies. The cost of reduced quality must be weighed against the cost of the interventions, which depend on required downtime, personnel costs, and material costs. Furthermore, there is a risk of false negatives, i.e., failure to identify the true root causes, or false positives, i.e., adjustments that further reduce the quality. A policy for process adjustments describes when and where to perform interventions, and we say that a policy is worthwhile if it reduces the expected operational cost. In this paper, we describe a data-driven alarm and root cause analysis framework, that given a predictive and explanatory model trained on high-dimensional process and quality data, can be used to search for a worthwhile adjustment policy. The framework was evaluated on large-scale simulated process and quality data. We find that worthwhile adjustment policies can be derived also for problems with a large number of explanatory variables. Interestingly, the performance of the adjustment policies is almost exclusively driven by the quality of the model fits. Based on these results, we discuss key areas of future research, and how worthwhile adjustment policies can be implemented in real world applications. • Framework for finding a process adjustment policy for quality improvement. • Uses a pre-trained predictive and explanatory machine learning model. • Cost function defines compromise between quality and interventions. • Simulation experiments for finding an optimal policy and estimating its cost. • Benefits from research in time series forecasting and local explanation methods. [ABSTRACT FROM AUTHOR]

The presence of Beggiatoa Spp. indicates anoxic conditions or 'poor condition' in marine sediments beneath aquaculture pens, resulting from organic enrichment. Currently, the most efficient approach to estimate Beggiatoa Spp. coverage, and thus the extent of the issue, involves video surveys which are scored by human observers for presence of this bacteria. However, this approach is highly time-consuming and relies heavily on the expertise and experience of the individuals involved, thus affecting its accuracy. Machine learning-based computer vision techniques, such as Convolutional Neural Networks (CNNs), offer the potential for automated estimation of Beggiatoa Spp. coverage. However, most existing machine learning methods focus solely on the estimation of the coverage via presence, absence of a single type of Beggiatoa Spp.. These approaches typically rely on binary classification to distinguish the object from the background when estimating coverage. Nevertheless, the inclusion of subordinate categories within high-level classifications poses a great challenge for accurately estimating their coverage rates. In this paper, an adaptive ensemble learning approach was proposed to estimate Beggiatoa Spp. coverage. Unlike other approaches, the proposed approach is capable in adaptively extracting and fusing features from underwater images and accurately estimating the coverages of multiple types of Beggiatoa Spp. through ensemble learning. Experimental results demonstrated that our proposed approach outperforms other approaches in terms of both effectiveness and efficiency in estimating Beggiatoa Spp. coverage. • Adaptive feature extraction and fusion enhance relevant and informative features' identification. • Adaptive feature extraction and fusion enhance feature representation and reduce time cost. • Flexible ensemble learning framework improves accuracy, robustness, and efficiency. • Flexible ensemble learning framework can be extended to other models or applications. • Novel machine learning-based approach estimates subordinate categories of Beggiatoa Spp. coverage. [ABSTRACT FROM AUTHOR]

Deep learning (DL) has made its way into many disciplines ranging from health care to self-driving cars. In financial markets, we see a rich literature for DL applications. Particularly, investors require robust algorithms that can navigate and make sense of extremely noisy and volatile markets. In this work, we use deep learning to select a portfolio of stocks and use a genetic algorithm to optimize the hyperparameters of DL. The work analyzes the improvement in using genetic-based hyperparameter optimization over grid searches. The Genetic Algorithm brings 40% improvements in prediction when compared to a random-grid search. Novelty-wise, the work couples a genetic-based hyperparameter optimization with multiple Deep RankNet models to predict the behavior of financial assets. Our results show promising portfolio returns 20% better than the general market. In the highly volatile COVID 19 period, the models exceed market returns by more than double. Overall, this paper brings a comprehensive work that integrates hyperparameter optimization, Deep RankNet, LSTM, period size variations, input variable transformation, feature selection, training/evaluation ratio analysis, and multiple portfolio selection strategies. [ABSTRACT FROM AUTHOR]

Machine learning techniques have been widely used and are mostly performed by predicting point estimation. Nevertheless, there are various scenarios that require more information beyond only point estimation. Probabilistic prediction is a typical research topic that provides probability distribution while predicting, which addressed with much attention recently. Most of the previous works make an assumption on the probabilistic distribution to a certain extent, which may lead to potential errors in the subsequent decision-making procedure. In this paper, we propose a distribution-free method for regression problems on real-value response under the probabilistic prediction framework and present an effective boosting-based method to perform the training process. Moreover, we introduce a further improved method to accomplish an unbiased mean estimation of the target distribution. Thorough experiments on multiple benchmark data are conducted to demonstrate the effectiveness of the proposed method with regard to different measures. • A distribution-free framework for probabilistic forecasting. • Use a mixture of Gaussian distribution as the target distribution. • An effective boosting-based strategy. • Providing unbiased mean estimation. [ABSTRACT FROM AUTHOR]

With the advent of the era of big data, more and more complex networks and knowledge based systems require data visualization for analysis and presentation, where graphs have become a standard representation model. Graph drawing addresses the problems of constructing geometric representations of graphs to make them easy to analyze. In this paper we aim to reduce the edge crossing number in the context of the incremental graph drawing problem (IGDP), in which we want to preserve the layout of a graph over successive drawings to present complex networks or knowledge-based systems. Specifically, we propose a metaheuristic algorithm called multiple neighborhood solution-based tabu search (MNSB-TS) by combining a solution-based tabu strategy and a multiple neighborhood structure for solving the incremental graph drawing problem. Our MNSB-TS approach introduces four neighborhood operators to accompany the solution-based tabu strategy for determining the tabu status of each neighbor solution. Extensive computational experiments on public benchmark instances demonstrate that the proposed MNSB-TS is highly competitive in comparison with the state-of-the-art heuristics and the exact optimization solver Gurobi. Key components of the approach are analyzed to evaluate their impact on algorithm performance and learn which search mechanisms are better suited for incremental graph drawing. • A novel method combines a solution-based tabu search and multiple neighborhood search. • The corresponding fast neighborhood evaluation methods for intensification. • A dynamic diversification phase which varies the diversification intensity. • The conducted experiments show the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

As giant pandas (Ailuropoda melanoleuca) are difficult to conceive and prone to abortion, humans have turned to artificial captive breeding to increase their population. Therefore, it is crucial for their reproduction to analyze their pregnancy status accurately and promptly in artificial captive breeding. To determine whether a giant panda is pregnant, with the current methods, experts must keep a close eye on them and frequently collect their urine or blood, which requires significant resources with a high misdiagnosis rate, and will adversely affect giant pandas' daily lives. Consequently, it is essential to rapidly advance the development of automated, precise methods that will not disrupt the pandas' lives to analyze giant pandas' behaviors and determine whether or not they are pregnant. In this paper, we propose an end-to-end intelligent system for predicting the pregnancy status of giant pandas and their Expected Date of Delivery (EDD). We first introduce expert knowledge to machine learning methods to solve this problem, which can significantly improve the accuracy of prediction. Experimental results show that this system achieves an accuracy of 91.5% for the pregnancy diagnosis and 0.579 days of mean average error for EDD prediction when the observation period is 5 days. Our automated system significantly reduces the need for human intervention, thus minimizing disruptions to the pandas' daily lives. It has the potential to contribute to the health and genetic diversity of the giant pandas, as well as aid in the panda's artificial reproduction and population growth. • An intelligent system automatically analyzes the pregnancy status of giant pandas. • Hierarchical behavior definition for acquiring comprehensive behavior description. • Effective pregnancy analysis model based on efficient channel attention mechanism. • Scalable sliding window mechanism to deal with insufficient data. [ABSTRACT FROM AUTHOR]

Although some machine learning (ML) models have successfully developed for ultra-high-performance concrete (UHPC), they do not provide insights and explicit relations between all input variables and its compressive strength. This paper will address these ambiguities and provide a tool to predict the compressive strength by explainable and interpretable equations and plots. Explicit semi-empirical formulas are derived from a multivariate polynomial regression (Lasso) and automated feature engineering and selection (Autofeat) using a 810 dataset of UHPC with 15 input variables, which are collected from literature. Coefficient of determination R 2 = 0.8223 is the same for the first-order degree (linear regression) of both models, however, the Autofeat achieves a better result than Lasso for the third-order degree with R 2 = 0.9616 vs. R 2 = 0.9503. A comprehensive parametric study is carried out via relative feature importance and partial dependence plots to explain and gain profound insights into the effects of some important input variables on the compressive strength of UHPC. Some details discussions related to these effects with previous studies are also presented. The proposed models not only show better performance with those from reference in terms of R 2 , especially for Autofeat model but also have explicit relations of compressive strength with 15 input variables. Hence, they can be used as a reliable tool in mixture design optimization of the UHPC. • Explicit formulas are derived to predict the compressive strength of UHPC. • Multivariate polynomial regression and automated feature engineering are used. • Relative feature importance and partial dependence plots are used to explain mechanism. • The proposed models show better performance with explicit relations of strength. [ABSTRACT FROM AUTHOR]

With a recently defined AutoGCOP framework, the design of local search algorithms has been defined as the composition of elementary algorithmic components. The effective compositions of the best algorithms thus retain useful knowledge of effective algorithm design. This paper investigates machine learning to learn and extract useful knowledge in effective algorithmic compositions. The process of forecasting algorithmic components in the design of effective local search algorithms is defined as a sequence classification task, and solved by a long short-term memory (LSTM) neural network to systematically analyse algorithmic compositions. Compared with other learning models, the results reveal the superior prediction performance of the proposed LSTM. Further analysis identifies some key features of algorithmic compositions and confirms their effectiveness for improving the prediction, thus supporting effective automated algorithm design. • The design of local search algorithms is defined as a sequence classification task. • LSTM is applied to forecast algorithmic components for automated composition. • LSTM has a better classification performance as compared with other classifiers. • Key features for sequence classification are identified to support algorithm design. [ABSTRACT FROM AUTHOR]

The Computational Fluid Dynamics (CFD) simulations at different fidelity levels are a common tool for predicting the aerodynamic performance in many engineering applications such as; automotive and aerospace to cite a few. However, the associated computational costs with these simulations are not trivial, and using the CFD simulations might easily become unpractical specially at the early design stages. The number of the required CFD simulations could be reduced immensely by using Artificial Intelligence (AI) methods which can predict, for example, the aerodynamic coefficients based on previous and limited CFD simulations. Having discussed the AI potential to minimize the CFD usage, the objective of this work is to investigate and compare the ability of different AI methods to predict the aerodynamic coefficients using the same CFD database from the literature. In this study, three different AI methods, namely; machine learning (e.g. Extreme Gradient Boosting (XGB), CatBoost, Bagging, Light Gradient Boosting Machine (Light-GBM), Random Forest (RFR), Gradient Boosting), deep learning (e.g. One Dimensional Convolutional Neural Network (Conv1D)) and surrogate models (e.g. Gaussian Process Regression (GPR)) have been utilized to estimate a sample CFD database (e.g. NACA0012, RAE2822) from the existing literature, and the prediction performance of these methods have been compared. The results show that, the aerodynamic coefficients predicted using CatBoost, XGB and Bagging are in good agreement with the reference CFD results. Furthermore, the proposed Conv1D method with LeakyReLU activation function showed a promising results in the development of aerodynamic models which can be used in the early stages of the air vehicles design. The obtained results from this work indicate that the CatBoost and the XGB models required much smaller training time compared to the Conv1D method, moreover, the proposed regression trees; CatBoost, Bagging and XGB can reduce the required number of CFD simulations significantly. • Various artificial intelligence methods were studied to predict aerodynamic data. • Regression tree models such as XGB, Catboost and LightGBM were used. • Surrogate models and deep learning models (i.e. Conv1D) also were used. • Detailed comparison were presented between the aforementioned models. • The paper suggests the suitability of XGB and Catboost for aerodynamics cases. [ABSTRACT FROM AUTHOR]

• A multi-objective robust parameter optimization for additive manufacturing process. • Modified k-means simultaneously optimize the mean and variance of multiple responses. • Modified k-means-based optimization with higher performances than conventional method. Metal additive manufacturing (AM) technology, especially laser powder bed fusion (LPBF), has received abundant interest from industries and the research community. Process optimization methods have thus multiplied to improve the overall quality of the final parts. However, little attention has been given to the quality repeatability issue. This paper proposes a novel multi-objective robust parameter optimization framework to explore optimal process parameters with respect to relative density and dimensional accuracy of LPBF-fabricated parts. Specifically, a modified k-means clustering, named the Extended and Weighted K-means (EWK-means), was constructed to simultaneously optimize the mean and the variance of the multiple responses. Experiments were conducted to verify the effectiveness of the proposed optimization framework. In addition, the effects of the process parameters, environment-related parameters, and physical properties on the hardness of the parts were analyzed using several machine learning models. The results showed that the proposed method achieved a set of optimal process parameters with better quality and satisfactory variability in the printed parts compared with other robust parameter optimization methods. [ABSTRACT FROM AUTHOR]

Joint inference is a fundamental issue in the field of artificial intelligence. The greatest advantage of the joint inference is demonstrated by its capability of avoiding errors from cascading and accumulating on a pipeline of multiple chained sub-tasks. Markov Logic Network(MLN) is the most common joint inference model that provides a flexible representation and handles uncertainty. It has been applied successfully to joint inference on many natural language processing tasks to avoid error propagation. However, due to the great expressiveness of first-order logic, the representation for it in MLN generates rather complicated graph structures, which makes the learning and inference on large scale data intractably. In this paper, we present an ensemble learning approach to deal with the challenges in MLNs. Firstly, we give a proof within the probably approximately correct (PAC) framework. The proof points out what conditions are necessary for successful applying the ensemble learning approach to MLN. Secondly, the paper explains how to combine the learners. Finally, in order to illustrate the working mechanism of the ensemble joint inference model, we present an Ensemble Markov Logic Networks (EMLNs) method and use it to extract knowledge from a large scale corpus published by Google. 1 1 code.google.com/p/relation-extraction-corpus/. Experiments suggest that significant speedup can be gained by the EMLNs. Meanwhile, it show that this approach leads to a higher precision and recall than that of those pipeline approaches. [ABSTRACT FROM AUTHOR]

Contrast patterns, which lie in the core of most understandable classifiers, are frequently evaluated by quality measures. Since many different quality measures are available, they should be compared to select the most appropriate for each applications. This paper introduces a method to compare quality measures, using a set of mined patterns and a collection of objects not used for mining. The comparison is performed by correlating quality values with a quality estimation of the patterns. Additionally, a meta-learning study is performed to show that combining quality measures could be better than using the best single measures in isolation. The results of this paper can help researchers to create new quality measures or to find new combinations of quality measures to create better understandable classification systems. [ABSTRACT FROM AUTHOR]

Recently, fingerprint crowdsourcing from pedestrian movement trajectories has been promoted to alleviate the site survey burden for radio map construction in fingerprinting-based indoor localization. Indoor corners, as one of the most common indoor landmarks, play an important role in movement trajectory analysis. This paper studies the problem of indoor corner recognition in crowdsourced movement trajectories. In a movement trajectory, smartphone internal sensor measurements experience some signal changes when passing by a corner. However, the state-of-the-art solutions based on signal change detection cannot well deal with the fake corner problem and pose diversity problem in most practical movement trajectories. In this paper, we study the corner recognition problem from an expert system viewpoint by applying machine learning techniques. In particular, we extract recognition features from both the time and frequency domain and propose a hierarchical corner recognition scheme consisting of three classifiers. The first pose classifier is to classify various poses into only two groups according to whether or not a smartphone is kept in a fixed position relative to a user upper body when collecting sensor measurements. Feature selection is then applied to train two corner classifiers each for one pose group. Field experiments are conducted to compare our proposed scheme with three state-of-the-art algorithms. In all cases, our scheme outperforms the best of these algorithms in terms of much higher F1-measure and precision for corner recognition. The results also provide insights on the potentials of using more advanced techniques from expert systems in indoor localization. [ABSTRACT FROM AUTHOR]

The use of robots in our daily lives is increasing. As we rely more on robots, thus it becomes more important for us that the robots will continue on with their mission successfully. Unfortunately, these sophisticated, and sometimes very expensive, machines are susceptible to different kinds of faults. It becomes important to apply a Fault Detection (FD) mechanism which is suitable for the domain of robots. Two important requirements of such a mechanism are: high accuracy and low computational-load during operation (online). Supervised learning can potentially produce very accurate FD models, and if the learning takes place offline then the online computational-load can be reduced. Yet, the domain of robots is characterized with the absence of labeled data (e.g., “faulty”, “normal”) required by supervised approaches, and consequently, unsupervised approaches are being used. In this paper we propose a hybrid approach - an unsupervised approach can label a data set, with a low degree of inaccuracy, and then the labeled data set is used offline by a supervised approach to produce an online FD model. Now, we are faced with a choice – should we use the unsupervised or the hybrid fault detector? Seemingly, there is no way to validate the choice due to the absence of (a priori) labeled data. In this paper we give an insight to why, and a tool to predict when, the hybrid approach is more accurate. In particular, the main impacts of our work are (1) we theoretically analyze the conditions under which the hybrid approach is expected to be more accurate. (2) Our theoretical findings are backed with empirical analysis. We use data sets of three different robotic domains: a high fidelity flight simulator, a laboratory robot, and a commercial Unmanned Arial Vehicle (UAV). (3) We analyze how different unsupervised FD approaches are improved by the hybrid technique and (4) how well this improvement fits our prediction tool. The significance of the hybrid approach and the prediction tool is the potential benefit to expert and intelligent systems in which labeled data is absent or expensive to create. [ABSTRACT FROM AUTHOR]

• Construct a general incomplete data processing model for the same structure incomplete data set. • Newly define the concept of abnormal degree. • Apply the Bisection method to the division of the missing rate intervals. • Newly proposed two judgment rules to ensure the feasibility of the processing method. • Apply to incomplete data processing in similar fields or with similar structures. Aiming at the problem of incomplete data such as outliers and missing values in machine learning, an incomplete data processing method based on the measurement of missing rate and abnormal degree was proposed in this paper. In this method, the outlier problem that are easy to be ignored was fully considered, and the Bisection method in the data structure field was applied to reduce the interval length and find the data distribution law. And then, an incomplete data processing model for static-structure or fixed-structure data set in a certain field or research direction was constructed. In the model establishment stage, the rules of the outlier processing part were first explored, including the boundary condition for outlier processing, and the relative applicable condition of using the direct-discarding method for outliers. Then, the rules of the missing value processing part were later explored, including the boundary condition for missing value processing, the relative applicable condition of using the direct-discarding method for missing values, the division of different missing rate intervals and the corresponding applicable numerical filling methods. In this research, the loose particle localization data set was taken as the test object, and the applicable incomplete data processing model was established. Specifically, the model can process outliers with the boundary condition of 23%, and the relative applicable condition of using the direct-discarding method for outliers is 2%. While the boundary condition that can process missing values is 67%, and the relative applicable condition of using the direct-discarding method for missing values is 3%. In the range of 3% to 67%, the range of missing rate that processing by statistical-filling methods is 3% to 7%, and the range of missing rate that processing by kNN prediction model is 7% to 67%. The applicable incomplete data processing model was verified on multiple loose particle localization data sets. Test results show that the prediction accuracy achieved by the classification learner based on the parameter-optimized Random Forest has significantly improved on the data set before and after processing, and the average improvement is 5.04%, which effectively proves the feasibility and practicability of the method proposed in this paper. Theoretically, it can be extended and applied to the processing of incomplete data sets in similar fields or with same structures, and has important reference significance for the research on incomplete data processing in machine learning. In addition, it has important practical value for improving the data completeness and data regularity of feature data sets in specific application fields. [ABSTRACT FROM AUTHOR]

• Counterfactual example-based explanation. • Explainable bankruptcy prediction model. • Feature-weighted multi-objective counterfactuals. • GA-based counterfactual generation algorithm. In recent years, there have been many studies on the application and implementation of machine learning techniques in the financial domain. Implementation of such state-of-the-art models inevitably requires interpretability for users to understand the result and trust. However, as most of the machine learning methods are "black-box," explainable AI, which aims to provide explanations to users, has become an important research issue. This paper focuses on explanation by counterfactual example for a bankruptcy-prediction model. Counterfactual-based explanation offers an alternative case for users in order for them to have a desired output from the model. This paper proposes a genetic algorithm (GA)-based counterfactual generation algorithm using feature importance whilst taking other key factors into account. Feature importance was derived from a prediction model, and key factors for counterfactuals include closeness to the original dataset and sparsity. The proposed method presented advantages over the nearest contrastive sample and a simple counterfactual generation algorithm in the experiment. Also, it provides relevant and compact explanations to enhance the interpretability of the bankruptcy prediction model. [ABSTRACT FROM AUTHOR]

The least squares support vector machine (LSSVM) has achieved great success in various fields, but it still has certain limitations. Firstly, it treats all points equally and does not take into account the impact of different sample locations. Secondly, it is vulnerable to outliers and noise. Moreover, when class-imbalanced data are encountered, the decision boundary is biased toward the minority class. To address above problems, this paper introduces a bounded linear-exponential (BLINEX) loss function into LSSVM (LSKB), where the asymmetry and boundedness of the BLINEX loss function allow LSKB to assign distinct weights to each sample and be insensitive to noise and outliers. Further, this paper extends LSKB to a cost sensitive (CSLSKB) form to make it adapt to the class-imbalanced data. A fast optimization algorithm based on NESVM is developed to solve non-convex LSKB and CSLSKB (NEBLL). Numerous experiments demonstrate their effectiveness in dealing with class-balanced as well as class-imbalanced problems. • The paper complements the application of BLINEX loss function in machine learning. • LSKB inherits the benefits of both BLINEX and LSSVM. • CSLSKB empowers LSKB to cope with class-imbalanced problems. • A fast optimization algorithm is developed to solve LSKB and CSLSKB. • Numerous experiments demonstrate the effectiveness of LSKB and CSLSKB. [ABSTRACT FROM AUTHOR]

Deep learning techniques for Sentiment Analysis have become very popular. They provide automatic feature extraction and both richer representation capabilities and better performance than traditional feature based techniques (i.e., surface methods). Traditional surface approaches are based on complex manually extracted features, and this extraction process is a fundamental question in feature driven methods. These long-established approaches can yield strong baselines, and their predictive capabilities can be used in conjunction with the arising deep learning methods. In this paper we seek to improve the performance of deep learning techniques integrating them with traditional surface approaches based on manually extracted features. The contributions of this paper are sixfold. First, we develop a deep learning based sentiment classifier using a word embeddings model and a linear machine learning algorithm. This classifier serves as a baseline to compare to subsequent results. Second, we propose two ensemble techniques which aggregate our baseline classifier with other surface classifiers widely used in Sentiment Analysis. Third, we also propose two models for combining both surface and deep features to merge information from several sources. Fourth, we introduce a taxonomy for classifying the different models found in the literature, as well as the ones we propose. Fifth, we conduct several experiments to compare the performance of these models with the deep learning baseline. For this, we use seven public datasets that were extracted from the microblogging and movie reviews domain. Finally, as a result, a statistical study confirms that the performance of these proposed models surpasses that of our original baseline on F1-Score. [ABSTRACT FROM AUTHOR]

Automatic detection of brain tumors in single-spectral magnetic resonance images is a challenging task. Existing techniques suffer from inadequate performance, dependence on initial assumptions, and, sometimes, the need for manual interference. The research reported in this paper seeks to reduce some of these shortcomings, and to remove others, achieving satisfactory performance at reasonable computational costs. The success of the system described here is explained by the synergy of the following aspects: (1) a broad choice of high-level features to characterize the image’s texture, (2) an efficient mechanism to eliminate less useful features (3) a machine-learning technique to induce a classifier that signals the presence of a tumor-affected tissue, and (4) an improved version of the skippy greedy snake algorithm to outline the tumor’s contours. The paper describes the system and reports experiments with synthetic as well as real data. [ABSTRACT FROM AUTHOR]

Rare events, especially those that could potentially negatively impact society, often require humans’ decision-making responses. Detecting rare events can be viewed as a prediction task in data mining and machine learning communities. As these events are rarely observed in daily life, the prediction task suffers from a lack of balanced data. In this paper, we provide an in depth review of rare event detection from an imbalanced learning perspective. Five hundred and seventeen related papers that have been published in the past decade were collected for the study. The initial statistics suggested that rare events detection and imbalanced learning are concerned across a wide range of research areas from management science to engineering. We reviewed all collected papers from both a technical and a practical point of view. Modeling methods discussed include techniques such as data preprocessing, classification algorithms and model evaluation. For applications, we first provide a comprehensive taxonomy of the existing application domains of imbalanced learning, and then we detail the applications for each category. Finally, some suggestions from the reviewed papers are incorporated with our experiences and judgments to offer further research directions for the imbalanced learning and rare event detection fields. [ABSTRACT FROM AUTHOR]

This paper considers the two-stage capacitated facility location problem (TSCFLP) in which products manufactured in plants are delivered to customers via storage depots. Customer demands are satisfied subject to limited plant production and limited depot storage capacity. The objective is to determine the locations of plants and depots in order to minimize the total cost including the fixed cost and transportation cost. However, the problem is known to be NP-hard. A practicable exact algorithm is impossible to be developed. In order to solve large-sized problems encountered in the practical decision process, an efficient alternative approximate method becomes more valuable. This paper aims to propose a hybrid evolutionary algorithm framework with machine learning fitness approximation for delivering better solutions in a reasonable amount of computational time. In our study, genetic operators are adopted to perform the search process and a local search strategy is used to refine the best solution found in the population. To avoid the expensive consumption of computational time during the fitness evaluating process, the framework uses extreme machine learning to approximate the fitness of most individuals. Moreover, two heuristics based on the characteristics of the problem is incorporated to generate a good initial population. Computational experiments are performed on two sets of test instances from the recent literature. The performance of the proposed algorithm is evaluated and analyzed. Compared with other algorithms in the literature, the proposed algorithm can find the optimal or near-optimal solutions in a reasonable amount of computational time. By employing the proposed algorithm, facilities can be positioned more efficiently, which means the fixed cost and the transportation cost can be decreased significantly, and organizations can enhance competitiveness by using the optimized facility location scheme. [ABSTRACT FROM AUTHOR]

Predictive modeling in medicine involves the development of computational models which are capable of analysing large amounts of data in order to predict healthcare outcomes for individual patients. Computational intelligence approaches are suitable when the data to be modelled are too complex for conventional statistical techniques to process quickly and efficiently. These advanced approaches are based on mathematical models that have been especially developed for dealing with the uncertainty and imprecision which is typically found in clinical and biological datasets. This paper provides a survey of recent work on computational intelligence approaches that have been applied to prostate cancer predictive modeling, and considers the challenges which need to be addressed. In particular, the paper considers a broad definition of computational intelligence which includes metaheuristic optimisation algorithms (also known as nature inspired algorithms), Artificial Neural Networks, Deep Learning, Fuzzy based approaches, and hybrids of these, as well as Bayesian based approaches, and Markov models. Metaheuristic optimisation approaches, such as the Ant Colony Optimisation, Particle Swarm Optimisation, and Artificial Immune Network have been utilised for optimising the performance of prostate cancer predictive models, and the suitability of these approaches are discussed. [ABSTRACT FROM AUTHOR]

Real-world optimization problems typically involve multiple objectives to be optimized simultaneously under multiple constraints and with respect to several variables. While multi-objective optimization itself can be a challenging task, equally difficult is the ability to make sense of the obtained solutions. In this two-part paper, we deal with data mining methods that can be applied to extract knowledge about multi-objective optimization problems from the solutions generated during optimization. This knowledge is expected to provide deeper insights about the problem to the decision maker, in addition to assisting the optimization process in future design iterations through an expert system. The current paper surveys several existing data mining methods and classifies them by methodology and type of knowledge discovered. Most of these methods come from the domain of exploratory data analysis and can be applied to any multivariate data. We specifically look at methods that can generate explicit knowledge in a machine-usable form. A framework for knowledge-driven optimization is proposed, which involves both online and offline elements of knowledge discovery. One of the conclusions of this survey is that while there are a number of data mining methods that can deal with data involving continuous variables, only a few ad hoc methods exist that can provide explicit knowledge when the variables involved are of a discrete nature. Part B of this paper proposes new techniques that can be used with such datasets and applies them to discrete variable multi-objective problems related to production systems. [ABSTRACT FROM AUTHOR]

As robots tend to establish their presence in every day human environments the necessity for them to attain socially acceptable behavior is a condition sine qua non. Consequently, robots need to learn and react appropriately, should they be able to share the same space with people and to reconcile their operation to man’s activity. This work proposes an integrated robot framework that allows navigation in a human populated environment. This is the first work that employs the performed actions of individuals so as to re-plan and design a collision-free and at the same time a socially acceptable trajectory. Expandability is another feature of the suggested mapping module since it is capable of incorporating an unconstrained number of actions and subsequently responses, according to the needs of the task in hand and the environment in which the robot operates. Moreover, the paper addresses the integration of the proposed mapping module with the rest of the robot framework in order to operate in a seamless fashion. The generic design of this architecture allows the replacement of modules with other similar ones, thus providing adaptability with respect to the environment and so on. The method utilizes off-line constructed 3D metric maps organized in terms of a topological graph. During its perambulation the robot is ample to detect humans while it exploits deep learning strategies to recognize their activities. The memorized actions are seamlessly associated with specific rules –deriving from the proxemics theory– and are organized in an efficient manner to be recalled during robot’s navigation. Moreover, the paper exhibits the differences of the robot navigation in inhabited and uninhabited environments and demonstrates the alteration of the robot’s trajectory with respect to the recognized actions and poses of the individuals. The system has been evaluated on a robot able to acquire RGB-D data in domestic environments. The human detection and the action recognition modules exhibited remarkable performance, the human detection one was flawless about its decision while the action recognition one confused actions regarding the number of individuals that participate in them. Last, the robot navigation component was proved capable of extracting safe trajectories in human populated environments. [ABSTRACT FROM AUTHOR]

The performance of classification algorithms is highly dependent on the quality of training data. Missing attribute values are quite common in many real world applications, thus, in such cases, a complementary method to improve the quality of the data and, consequently, promote enhancements of the classifier performance, is necessary. To deal with this problem, two strategies are commonly employed in practice, 1) multiple imputation , which often maintains the statistical properties of the original data and, usually, has good performance, at the expense of high computational costs; 2) single imputation , which, in general, provides a suitable solution for data sets with a few missing attribute values, but hardly achieve good results when the number of missing values is high. This paper proposes a new single imputation method which uses Attribute-based Decision Graphs (AbDG) to estimate the missing values. AbDGs are a new type of data graphs which embed the information contained in the training set into a graph structure, built over pre-defined intervals of values from different attributes. As a consequence, similar data instances induce similar subgraphs when projected onto the AbDG, resulting in distinct patterns of connections. The main contribution of the paper is the proposal of a well-defined procedure to perform imputation, by partially matching instances with missing values against the AbDG. The proposed imputation method can effectively deal with data sets having high rates of missing attribute values while presenting low computational cost; a significant result towards the development of robust expert and intelligent systems. The obtained results show evidences that the proposed method is sound and promote qualitative imputation for classification purposes. [ABSTRACT FROM AUTHOR]

• The paper is dedicated to proposed a cluster-based routing protocol for WBAN. • The paper utilizes the benefits of machine learning. • A novel approach, MGWOQL, is proposed for cluster head selection and updation. • The multi-objective function is designed to select the optimal cluster head node. • The result shows better network longevity, residual energy, and path loss. Recently, Wireless Body Area Networks (WBAN) have been developed to advance Internet-of-Things (IoT) that play an essential role in biomedical applications. While deploying these applications practically, there may arise associated issues. Among all the available problems, the primary concern is energy utilization among these resource-limited sensors during data communication. These sensors continuously sense the signal and send messages to other nodes. There is a need to optimize the energy utilization in WBAN. This paper proposes a cluster-based routing protocol for WBAN with the benefits of machine learning to predict energy wastage. A Modified Grey Wolf Optimization with Q-Learning (MGWOQL) is proposed for cluster head selection and updating. The proposed protocol used different objective functions to minimize the energy utilization of clusters by selecting the optimal cluster head (CH). The simulation was performed on the MATLAB platform under different conditions. The result analysis shows its efficiency in terms of energy for WBAN. [ABSTRACT FROM AUTHOR]