Real-world Datasets Research Articles

A novel particle swarm optimization-based intelligence link prediction algorithm in real world networks

Link prediction in social network is an important topic due to its applications like finding collaborations and recommending friends. Among existing link prediction methods, similarity-based approaches are found to be most effective since they examine the number of common neighbours (CN). Current work presents a novel link prediction algorithm based on particle swarm optimization (PSO) and implemented on four real world datasets namely, Zachary’s karate club (ZKC), bottlenose dolphin network (BDN), college football network (CFN) and Krebs’ books on American politics (KBAP). It consists of three experiments: i) to find the measures on existing methods and compare them with our proposed algorithm; ii) to find the measured values of the existing methods along with our proposed one to determine future links among nodes that have no CN; and iii) to find the measures of the methods to determine future links among nodes having same number of CN. In experiment 1, our proposed approach achieved 75.88%, 78.34%, 82.63% and 78.36% accuracy for ZKC, BDN, CFN, and KBAP respectively. These results beat the performances of traditional algorithms. In experiment 2, the accuracies are found as 75.53%, 74.25%, 81.63% and 78.34% respectively. In experiment 3, accuracies are detected as 72.75%, 81.53%, 78.35% and 75.13% respectively.

Face mask classification using convolutional neural networks with facial image regions and super resolution

<p>Face mask classification is relevant to public health and safety, so an approach for face mask classification using Multi-Task Cascaded Convolutional Networks (MTCNN) for face detection on image data, ResNet152 architecture for feature extraction, and super-resolution method, BSRGAN, for enhanced image quality was proposed. The classification model was trained by a fully connected layer of neural networks. The goal is to classify each facial image into three classes: the image with a mask, without a mask, or with an incorrectly worn mask. The performance of each classification model on two real-world datasets was evaluated by Accuracy, Precision, Recall, and F1 score for different sets of input patterns which were features extracted from the facial image regions including their combinations. Using multiple image regions, i.e. face, nose, and mouth, as resources for preparing input features showed the improved classification performance compared to using single image regions. In addition, the super-resolution technique applied to medium or large-sized images can improve the performance of the face mask classification model. Our findings may further guide the development for greater effective models and techniques on face mask classification contributing to practical scenarios.</p>

Exploratory data analysis for electric vehicle driving range prediction: insights and evaluation

One of the biggest challenges of electric vehicle (EV) users has been predicting the amount of driving time their vehicles will have on one battery charge. Planning a trip and reducing range anxiety depends on an accurate range estimate. This study aims to anticipate the EV driving range using machine learning methods. In this research, several regression models for predicting EV driving range will be developed and compared. A real-world dataset comprising various factors affecting EV range, such as power, trip distance, energy consumption, driving style, and environmental factors, is used for analysis. The dataset is preprocessed using exploratory data analysis methods to manage missing values, outliers, and categorical variables. The findings of this study contribute to the expanding area of EV range prediction and provide EV buyers, producers, and regulators with insightful information. The user experience can be improved, EV adoption can be boosted, and effective charging infrastructure design is made possible with accurate range prediction. The study also highlights the importance of model selection and data pretreatment in making accurate predictions.

Development of a new exponential generalized family of distribution with its properties and application

In the field of reliability analysis, the selection of an appropriate lifespan model is critical. With a multitude of lifetime distributions accessible, the hunt for a more suited distribution remains essential. In this paper, we offer a unique class of distributions derived from the notion of exponential generalization, improved with changes to boost flexibility. Our suggested distribution incorporates multiple hazard rate profiles, giving enhanced flexibility. Analytical characteristics including the rth moment, moment generating function, quantile function, distribution of order statistics, and Rényi entropy are obtained. Employing maximum likelihood estimation, we estimate the unknown parameters. Through simulation tests and analysis of real-world datasets, we exhibit the model's usefulness compared to five existing lifespan distributions, emphasising the better performance of the GAYUF distribution. This research underlines the GAYUF distribution as a better model in the field of lifespan analysis

Multi-Label Feature Selection with Graph-based Ant Colony Optimization and Generalized Jaccard Similarity

Multi-label learning is a technique that assigns multiple class labels to each data instance. The growth of digital technology resulted in the development of high-dimensional applications in real-world scenarios. Feature selection approaches are extensively used to reduce dimensionality in multi-label learning. The main problems of the recommender system are determining the best match of futures among users but have not engaged with previously. This paper proposes a strategy for selecting features using ant colony optimization (ACO) that incorporates mutual knowledge. The proposed method utilizes ACO to rank features based on their significance. Thus, the search space is mapped to a graph, and each ant traverses the graph, selecting a predetermined number of features. A new information-theoretical metric is introduced to evaluate the features chosen by each ant. Jaccard generalized similarity coefficient is used to select the most suitable communication target for efficient learning outcomes. Mutual information is employed to assess each features relevance to a set of labels and identify redundant features. Pheromones are assigned values based on the effectiveness of the ants in solving the problem. Finally, the features are ranked based on their pheromone values, and the top-ranked features are selected as the final set of attributes. The proposed method is evaluated using real-world datasets. The findings demonstrate that the proposed method outperforms most of existing and advanced approaches. This paper presents a novel feature selection approach for multi-label learning based on ACO. The experimental results confirm the effectiveness of the proposed method compared to existing techniques.

MASMDDI: multi-layer adaptive soft-mask graph neural network for drug-drug interaction prediction

Accurately predicting Drug-Drug Interaction (DDI) is a critical and challenging aspect of the drug discovery process, particularly in preventing adverse reactions in patients undergoing combination therapy. However, current DDI prediction methods often overlook the interaction information between chemical substructures of drugs, focusing solely on the interaction information between drugs and failing to capture sufficient chemical substructure details. To address this limitation, we introduce a novel DDI prediction method: Multi-layer Adaptive Soft Mask Graph Neural Network (MASMDDI). Specifically, we first design a multi-layer adaptive soft mask graph neural network to extract substructures from molecular graphs. Second, we employ an attention mechanism to mine substructure feature information and update latent features. In this process, to optimize the final feature representation, we decompose drug-drug interactions into pairwise interaction correlations between the core substructures of each drug. Third, we use these features to predict the interaction probabilities of DDI tuples and evaluate the model using real-world datasets. Experimental results demonstrate that the proposed model outperforms state-of-the-art methods in DDI prediction. Furthermore, MASMDDI exhibits excellent performance in predicting DDIs of unknown drugs in two tasks that are more aligned with real-world scenarios. In particular, in the transductive scenario using the DrugBank dataset, the ACC and AUROC and AUPRC scores of MASMDDI are 0.9596, 0.9903, and 0.9894, which are 2% higher than the best performing baseline.

Sparse deep encoded features with enhanced sinogramic red deer optimization for fault inspection in wafer maps

AbstractDue to the complexity and dynamics of the semiconductor manufacturing processes, wafer bin maps (WBM) present various defect patterns caused by various process faults. The defect type detection on wafer maps provides information about the process and equipment in which the defect occurred. Recently, automatic inspection has played a vital role in meeting the high-throughput demand, especially with deep convolutional neural networks (DCNN) which shows promising efficiency. At the same time, the need for a large amount of labeled and balanced datasets limits the performance of such approaches. In addition, complex DCNN in recognition tasks can provide redundant features that cause overfitting and reduce interpretability. In this paper, a new hybrid deep model for wafer map fault detection to get over these challenges is proposed. Firstly, a new convolutional autoencoder (CAE) is employed as a synthetization model to fix the high imbalance problem of the dataset. Secondly, for efficient dimensionality reduction, an embedding procedure is applied to the synthesized maps to get sparse encoded wafer maps by reinforcing a sparsity regularization in an encoder-decoder network to form a sparsity-boosted autoencoder (SBAE). The sparse embedding of wafer maps guarantees more discriminative features with 50% reduction in spatial size compared to the original wafer maps. Then, the 2D encoded sparse maps are converted to 1D sinograms to be fed later into another aggressive feature reduction stage using a new modified red deer algorithm with a new tinkering strategy. The resultant feature pool is reduced to ~ 25 1D feature bases, i.e., ~ 1.5% of the initial size of the 2D wafer maps. Finally, for the prediction stage, a simple 1DCNN model is introduced. The proposed inspection model is tested via different experiments on real-world wafer map dataset (WM-811K). Compared to state-of-the-art techniques, the proposed model outperforms their performance even with small-sized 1D feature pool. The average testing accuracy are 98.77% and 98.8% for 9 and 8 types of faults, respectively.

STFEformer: Spatial–Temporal Fusion Embedding Transformer for Traffic Flow Prediction

In the realm of Intelligent Transportation Systems (ITSs), traffic flow prediction is crucial for multiple applications. The primary challenge in traffic flow prediction lies in the handling and modeling of the intricate spatial–temporal correlations inherent in transport data. In recent years, many studies have focused on developing various Spatial–Temporal Graph Neural Networks (STGNNs), and researchers have also begun to explore the application of transformers to capture spatial–temporal correlations in traffic data. However, GNN-based methods mainly focus on modeling spatial correlations statically, which significantly limits their capacity to discover dynamic and long-range spatial patterns. Transformer-based methods have not sufficiently extracted the comprehensive representation of traffic data features. To explore dynamic spatial dependencies and comprehensively characterize traffic data, the Spatial–Temporal Fusion Embedding Transformer (STFEformer) is proposed for traffic flow prediction. Specifically, we propose a fusion embedding layer to capture and fuse both native information and spatial–temporal features, aiming to achieve a comprehensive representation of traffic data characteristics. Then, we introduce a spatial self-attention module designed to enhance detection of dynamic and long-range spatial correlations by focusing on interactions between similar nodes. Extensive experiments conducted on three real-world datasets demonstrate that STFEformer significantly outperforms various baseline models, notably achieving up to a 5.6% reduction in Mean Absolute Error (MAE) on the PeMS08 dataset compared to the next-best model. Furthermore, the results of ablation experiments and visualizations are employed to clarify and highlight our model’s performance. STFEformer represents a meaningful advancement in traffic flow prediction, potentially influencing future research and applications in ITSs by providing a more robust framework for managing and analyzing traffic data.

Online boxplot derived outlier detection

AbstractOutlier detection is a widely used technique for identifying anomalous or exceptional events across various contexts. It has proven to be valuable in applications like fault detection, fraud detection, and real-time monitoring systems. Detecting outliers in real time is crucial in several industries, such as financial fraud detection and quality control in manufacturing processes. In the context of big data, the amount of data generated is enormous, and traditional batch mode methods are not practical since the entire dataset is not available. The limited computational resources further compound this issue. Boxplot is a widely used batch mode algorithm for outlier detection that involves several derivations. However, the lack of an incremental closed form for statistical calculations during boxplot construction poses considerable challenges for its application within the realm of big data. We propose an incremental/online version of the boxplot algorithm to address these challenges. Our proposed algorithm is based on an approximation approach that involves numerical integration of the histogram and calculation of the cumulative distribution function. This approach is independent of the dataset’s distribution, making it effective for all types of distributions, whether skewed or not. To assess the efficacy of the proposed algorithm, we conducted tests using simulated datasets featuring varying degrees of skewness. Additionally, we applied the algorithm to a real-world dataset concerning software fault detection, which posed a considerable challenge. The experimental results underscored the robust performance of our proposed algorithm, highlighting its efficacy comparable to batch mode methods that access the entire dataset. Our online boxplot method, leveraging dataset distribution to define whiskers, consistently achieved exceptional outlier detection results. Notably, our algorithm demonstrated computational efficiency, maintaining constant memory usage with minimal hyperparameter tuning.

Spatio-temporal data fusion techniques for modeling digital twin City

ABSTRACT The digital twin city technique maps the massive city environmental and social data on a three-dimensional virtual model. It presents the operational status of physical world and supports intelligent city governance. However, the inefficient utilization of distributed data resources, and the lack of sharing and collaboration among multiple departments restrict the data formulation of digital twin city construction. This research proposes a new cross-domain spatio-temporal data fusion framework for supporting complex urban governance. It integrates the heterogeneous urban information generated and stored by different government departments using multiple-information techniques. A specified geographic base reflecting the real city status is established, using geographical entities with unified address as identifiers to encapsulate the urban elements information. We introduce a comprehensive urban spatio-temporal data center construction process, which has already supported multiple urban governance projects. The two distinct advantages in using this data fusion system are: 1) The proposed Bert+PtrNet+ESIM-based address mapping method associates the urban elements information to their corresponding geographic entities with 99.3% F1-Score on real-world dataset. 2) The Wuhan spatio-temporal data center operation illustrates the capability of our framework for complex urban governance, which significantly improves the efficiency of urban management and services. This integrated system engineering provides reference and inspiration for further spatio-temporal data management, which contributes to the future social governance in digital twin city platform.

The Lomax-Exponentiated Odds Ratio–G Distribution and Its Applications

This paper introduces the Lomax-exponentiated odds ratio–G (L-EOR–G) distribution, a novel framework designed to adeptly navigate the complexities of modern datasets. It blends theoretical rigor with practical application to surpass the limitations of traditional models in capturing complex data attributes such as heavy tails, shaped curves, and multimodality. Through a comprehensive examination of its theoretical foundations and empirical data analysis, this study lays down a systematic theoretical framework by detailing its statistical properties and validates the distribution’s efficacy and robustness in parameter estimation via Monte Carlo simulations. Empirical evidence from real-world datasets further demonstrates the distribution’s superior modeling capabilities, supported by compelling various goodness-of-fit tests. The convergence of theoretical precision and practical utility heralds the L-EOR–G distribution as a groundbreaking advancement in statistical modeling, significantly enhancing precision and adaptability. The new model not only addresses a critical need within statistical modeling but also opens avenues for future research, including the development of more sophisticated estimation methods and the adaptation of the model for various data types, thereby promising to refine statistical analysis and interpretation across a wide array of disciplines.

Respiratory Condition Detection Using Audio Analysis and Convolutional Neural Networks Optimized by Modified Metaheuristics

Respiratory conditions have been a focal point in recent medical studies. Early detection and timely treatment are crucial factors in improving patient outcomes for any medical condition. Traditionally, doctors diagnose respiratory conditions through an investigation process that involves listening to the patient’s lungs. This study explores the potential of combining audio analysis with convolutional neural networks to detect respiratory conditions in patients. Given the significant impact of proper hyperparameter selection on network performance, contemporary optimizers are employed to enhance efficiency. Moreover, a modified algorithm is introduced that is tailored to the specific demands of this study. The proposed approach is validated using a real-world medical dataset and has demonstrated promising results. Two experiments are conducted: the first tasked models with respiratory condition detection when observing mel spectrograms of patients’ breathing patterns, while the second experiment considered the same data format for multiclass classification. Contemporary optimizers are employed to optimize the architecture selection and training parameters of models in both cases. Under identical test conditions, the best models are optimized by the introduced modified metaheuristic, with an accuracy of 0.93 demonstrated for condition detection, and a slightly reduced accuracy of 0.75 for specific condition identification.

Asymmetric influence-based superposed random walk link prediction algorithm in complex networks

Random walk-based link prediction algorithms have achieved desirable results for complex network mining, but in these algorithms, the transition probability of particles usually only considers node degrees, resulting in particles being able to randomly select adjacent nodes for random walks in an equal probability manner, to solve this problem, the asymmetric influence-based superposed random walk link prediction algorithm is proposed in this paper. This algorithm encourages particles to choose the next node at each step of the random walk process based on the asymmetric influence between nodes. To this end, we fully consider the topological information around each node and propose the asymmetric influence between nodes. Then, an adjustable parameter is applied to normalize the degree of nodes and the asymmetric influence between nodes into transition probability. Based on this, the proposed new transition probability is applied to superposed random walk process to measure the similarity between all nodes in the network. Empirical experiments are conducted on 16 real-world network datasets such as social network, ecology network, and animal network. The experimental results show that the proposed algorithm has high prediction accuracy in most network, compared with 10 benchmark indices.

OffRoadSynth Open Dataset for Semantic Segmentation using Synthetic-Data-Based Weight Initialization for Autonomous UGV in Off-Road Environments

This article concerns the issue of image semantic segmentation for the machine vision system of an autonomous Unmanned Ground Vehicle (UGV) moving in an off-road environment. Determining the meaning (semantics) of the areas visible in the recorded image provides a complete understanding of the scene surrounding the autonomous vehicle. It is crucial for the correct determination of a passable route. Nowadays, semantic segmentation is generally solved using convolutional neural networks (CNN), which can take an image as input and output the segmented image. However, proper training of the neural network requires the use of large amounts of data, which becomes problematic in the situation of low availability of large, dedicated image data sets that consider various off-road situations - driving on various types of roads, surrounded by diverse vegetation and in various weather and light conditions. This study introduces a synthetic image dataset called “OffRoadSynth” to address the training data scarcity for off-road scenarios. It has been shown that pre-training the neural network on this synthetic dataset improves image segmentation accuracy compared to other methods, such as random network weight initialization or using larger, generic datasets. Results suggest that using a smaller but domain-dedicated set of synthetic images to initialize network weights for training on the target real-world dataset may be an effective approach to improving semantic segmentation results of images, including those from off-road environments.

Blind Super-Resolution Via Meta-Learning and Markov Chain Monte Carlo Simulation.

Learning based approaches have witnessed great successes in blind single image super-resolution (SISR) tasks, however, handcrafted kernel priors and learning based kernel priors are typically required. In this paper, we propose a Meta-learning and Markov Chain Monte Carlo based SISR approach to learn kernel priors from organized randomness. In concrete, a lightweight network is adopted as kernel generator, and is optimized via learning from the MCMC simulation on random Gaussian distributions. This procedure provides an approximation for the rational blur kernel, and introduces a network-level Langevin dynamics into SISR optimization processes, which contributes to preventing bad local optimal solutions for kernel estimation. Meanwhile, a meta-learning based alternating optimization procedure is proposed to optimize the kernel generator and image restorer, respectively. In contrast to the conventional alternating minimization strategy, a meta-learning based framework is applied to learn an adaptive optimization strategy, which is less-greedy and results in better convergence performance. These two procedures are iteratively processed in a plug-and-play fashion, for the first time, realizing a learning-based but plug-and-play blind SISR solution in unsupervised inference. Extensive simulations demonstrate the superior performance and generalization ability of the proposed approach when comparing with state-of-the-arts on synthesis and real-world datasets.

Mining Multimorbidity Trajectories and Co-Medication Effects from Patient Data to Predict Post–Hip Fracture Outcomes

Hip fractures have profound impacts on patients’ conditions and quality of life, even when they receive therapeutic treatments. Many patients face the risk of poor prognosis, physical impairment, and even mortality, especially older patients. Accurate patient outcome estimates after an initial fracture are critical to physicians’ decision-making and patient management. Effective predictions might benefit from analyses of patients’ multimorbidity trajectories and medication usages. If adequately modeled and analyzed, they could help identify patients at higher risk of recurrent fractures or mortality. Most analytics methods overlook the onset, co-occurrence, and temporal sequence of distinct chronic diseases in the trajectory, and they also seldom consider the combined effects of different medications. To support effective predictions, we develop a novel deep learning–based method that uses a cross-attention mechanism to model patient progression by obtaining “contextual information” from multimorbidity trajectories. This method also incorporates a nested self-attention network that captures the combined effects of distinct medications by learning the interactions among medications and how dosages might influence post-fracture outcomes. A real-world patient data set is used to evaluate the proposed method, relative to six benchmark methods. The comparative results indicate that our method consistently outperforms all the benchmarks in precision, recall, F-measures, and area under the curve. The proposed method is generalizable and can be implemented as a decision support system to identify patients at greater risk of recurrent hip fractures or mortality, which should help clinical decision-making and patient management.

Semi-quantitative group testing for efficient and accurate qPCR screening of pathogens with a wide range of loads

BackgroundPathogenic infections pose a significant threat to global health, affecting millions of people every year and presenting substantial challenges to healthcare systems worldwide. Efficient and timely testing plays a critical role in disease control and transmission prevention. Group testing is a well-established method for reducing the number of tests needed to screen large populations when the disease prevalence is low. However, it does not fully utilize the quantitative information provided by qPCR methods, nor is it able to accommodate a wide range of pathogen loads.ResultsTo address these issues, we introduce a novel adaptive semi-quantitative group testing (SQGT) scheme to efficiently screen populations via two-stage qPCR testing. The SQGT method quantizes cycle threshold (Ct) values into multiple bins, leveraging the information from the first stage of screening to improve the detection sensitivity. Dynamic Ct threshold adjustments mitigate dilution effects and enhance test accuracy. Comparisons with traditional binary outcome GT methods show that SQGT reduces the number of tests by 24% on the only complete real-world qPCR group testing dataset from Israel, while maintaining a negligible false negative rate.ConclusionIn conclusion, our adaptive SQGT approach, utilizing qPCR data and dynamic threshold adjustments, offers a promising solution for efficient population screening. With a reduction in the number of tests and minimal false negatives, SQGT holds potential to enhance disease control and testing strategies on a global scale.

GAP-LSTM: Graph-Based Autocorrelation Preserving Networks for Geo-Distributed Forecasting.

Forecasting methods are important decision support tools in geo-distributed sensor networks. However, challenges such as the multivariate nature of data, the existence of multiple nodes, and the presence of spatio-temporal autocorrelation increase the complexity of the task. Existing forecasting methods are unable to address these challenges in a combined manner, resulting in a suboptimal model accuracy. In this article, we propose, a novel geo-distributed forecasting method that leverages the synergic interaction of graph convolution, attention-based long short-term memory (LSTM), 2-D-convolution, and latent memory states to effectively exploit spatio-temporal autocorrelation in multivariate data generated by multiple nodes, resulting in improved modeling capabilities. Our extensive evaluation, involving real-world datasets on traffic, energy, and pollution domains, showcases the ability of our method to outperform state-of-the-art forecasting methods. An ablation study confirms that all method components provide a positive contribution to the accuracy of the extracted forecasts. The method also provides an interpretable visualization that complements forecasts with additional insights for domain experts.

Machine Learning Models for Pancreatic Cancer Risk Prediction Using Electronic Health Record Data - A Systematic Review and Assessment.

Accurate risk prediction can facilitate screening and early detection of pancreatic cancer (PC). We conducted a systematic review to critically evaluate effectiveness of machine learning (ML) and artificial intelligence (AI) techniques applied to Electronic Health Records (EHR) for PC risk prediction. Ovid MEDLINE(R), Ovid EMBASE, Ovid Cochrane Central Register of Controlled Trials, Ovid Cochrane Database of Systematic Reviews, Scopus, and Web of Science were searched for articles that utilized ML/AI techniques to predict PC, published between January 1st, 2012 to February 1st, 2024. Study selection and data extraction were conducted by two independent reviewers. Critical appraisal and data extraction was performed using CHARMS checklist. Risk of bias and applicability was examined using PROBAST. Thirty studies including 169,149 PC cases were identified. Logistic regression was the most frequent modeling method. Twenty studies utilized a curated set of known PC risk predictors or those identified by clinical experts. ML model discrimination performance (C-index) ranged from 0.57 to 1.0. Missing data was underreported, and most studies did not implement explainable-AI techniques or report exclusion time intervals. AI/ML models for PC risk prediction using known risk factors perform reasonably well and may have near-term applications in identifying cohorts for targeted PC screening if validated in real-world data sets. The combined use of structured and unstructured EHR data using emerging language models while incorporating explainable-AI techniques has the potential to identify novel PC risk factors and this approach merits further study.

A Multiple Controlled Toffoli Driven Adaptive Quantum Neural Network Model for Dynamic Workload Prediction in Cloud Environments.

The key challenges in cloud computing encompass dynamic resource scaling, load balancing, and power consumption. Accurate workload prediction is identified as a crucial strategy to address these challenges. Despite numerous methods proposed to tackle this issue, existing approaches fall short of capturing the high-variance nature of volatile and dynamic cloud workloads. Consequently, this paper introduces a novel model aimed at addressing this limitation. This paper presents a novel Multiple Controlled Toffoli-driven Adaptive Quantum Neural Network (MCT-AQNN) model to establish an empirical solution to complex, elastic as well as challenging workload prediction problems by optimizing the exploration, adaption, and exploitation proficiencies through quantum learning. The computational adaptability of quantum computing is ingrained with machine learning algorithms to derive more precise correlations from dynamic and complex workloads. The furnished input data point and hatched neural weights are refitted in the form of qubits while the controlling effects of Multiple Controlled Toffoli (MCT) gates are operated at the hidden and output layers of Quantum Neural Network (QNN) for enhancing learning capabilities. Complimentarily, a Uniformly Adaptive Quantum Machine Learning (UAQL) algorithm has evolved to functionally and effectually train the QNN. The extensive experiments are conducted and the comparisons are performed with state-of-the-art methods using four real-world benchmark datasets. Experimental results evince that MCT-AQNN has up to 32%-96% higher accuracy than the existing approaches.