Radio Signal Modulation Recognition Method Based on Hybrid Feature and Ensemble Learning: For Radar and Jamming Signals.

The detection performance of radar is significantly impaired by active jamming and mutual interference from other radars. This paper proposes a radio signal modulation recognition method to accurately recognize these signals, which helps in the jamming cancellation decisions. Based on the ensemble learning stacking algorithm improved by meta-feature enhancement, the proposed method adopts random forests, K-nearest neighbors, and Gaussian naive Bayes as the base-learners, with logistic regression serving as the meta-learner. It takes the multi-domain features of signals as input, which include time-domain features including fuzzy entropy, slope entropy, and Hjorth parameters; frequency-domain features, including spectral entropy; and fractal-domain features, including fractal dimension. The simulation experiment, including seven common signal types of radar and active jamming, was performed for the effectiveness validation and performance evaluation. Results proved the proposed method's performance superiority to other classification methods, as well as its ability to meet the requirements of low signal-to-noise ratio and few-shot learning.

Rolling Bearing Fault Diagnosis Based on SABO-VMD and WMH-KNN.

To improve the performance of roller bearing fault diagnosis, this paper proposes an algorithm based on subtraction average-based optimizer (SABO), variational mode decomposition (VMD), and weighted Manhattan-K nearest neighbor (WMH-KNN). Initially, the SABO algorithm uses a composite objective function, including permutation entropy and mutual information entropy, to optimize the input parameters of VMD. Subsequently, the optimized VMD is used to decompose the signal to obtain the optimal decomposition characteristics and the corresponding intrinsic mode function (IMF). Finally, the weighted Manhattan function (WMH) is used to enhance the classification distance of the KNN algorithm, and WMH-KNN is used for fault diagnosis based on the optimized IMF features. The performance of the SABO-VMD and WMH-KNN models is verified through two experimental cases and compared with traditional methods. The results show that the accuracy of motor-bearing fault diagnosis is significantly improved, reaching 97.22% in Dataset 1, 98.33% in Dataset 2, and 99.2% in Dataset 3. Compared with traditional methods, the proposed method significantly reduces the false positive rate.

K-nearest neighbor based on exploratory data analysis of curriculum models of Chinese early childhood education.

This research examines the unique Chinese approaches to implementing the Early Childhood Curriculum (ECC) in Shenzhen and Hong Kong, drawing on School-based Curriculum Development (SBCD) studies. A total of 200 administrators and teachers were interviewed in total, and transcripts from those interviews were examined, cross-checked, and assessed using document analysis and classroom observation. Through interviews that have been conducted by administrators and teachers analyzed by document analysis and classroom observation, the influence of Chinese culture on ECC implementation is explored using the Cultural-Historical Activity Theory (CHAT). An exploratory, inferential, and descriptive statistical approach evaluates the sociocultural mechanism of ECC in Chinese society. The proposed framework utilizes K-Nearest Neighbor (KNN) regression analysis to illustrate how social development leads to cultural fusion and conflicts. The overall sociocultural framework promotes cultural growth and inheritance in China's early childhood education settings.

Prediction of segmental motor outcomes in traumatic spinal cord injury: Advances beyond sum scores.

BACKGROUND AND OBJECTIVES: Neurological and functional recovery after traumatic spinal cord injury (SCI) is highly challenged by the level of the lesion and the high heterogeneity in severity (different degrees of in/complete SCI) and spinal cord syndromes (hemi-, ant-, central-, and posterior cord). So far outcome predictions in clinical trials are limited in targeting sum motor scores of the upper (UEMS) and lower limb (LEMS) while neglecting that the distribution of motor function is essential for functional outcomes. The development of data-driven prediction models of detailed segmental motor recovery for all spinal segments from the level of lesion towards the lowest motor segments will improve the design of rehabilitation programs and the sensitivity of clinical trials. METHODS: This study used acute-phase International Standards for Neurological Classification of SCI exams to forecast 6-month recovery of segmental motor scores as the primary evaluation endpoint. Secondary endpoints included severity grade improvement, independent walking, and self-care ability. Different similarity metrics were explored for k-nearest neighbor (kNN) matching within 1267 patients from the European Multicenter Study about Spinal Cord Injury before validation in 411 patients from the Sygen trial. The kNN performance was compared to linear and logistic regression models. RESULTS: We obtained a population-wide root-mean-squared error (RMSE) in motor score sequence of 0.76(0.14, 2.77) and competitive functional score predictions (AUCwalker = 0.92, AUCself-carer = 0.83) for the kNN algorithm, improving beyond the linear regression task (RMSElinear = 0.98(0.22, 2.57)). The validation cohort showed comparable results (RMSE = 0.75(0.13, 2.57), AUCwalker = 0.92). We deploy the final historic control model as a web tool for easy user interaction (https://hicsci.ethz.ch/). DISCUSSION: Our approach is the first to provide predictions across all motor segments independent of the level and severity of SCI. We provide a machine learning concept that is highly interpretable, i.e. the prediction formation process is transparent, that has been validated across European and American data sets, and provides reliable and validated algorithms to incorporate external control data to increase sensitivity and feasibility of multinational clinical trials.

Efficient Sleep Stage Identification Using Piecewise Linear EEG Signal Reduction: A Novel Algorithm for Sleep Disorder Diagnosis.

Sleep is a vital physiological process for human health, and accurately detecting various sleep states is crucial for diagnosing sleep disorders. This study presents a novel algorithm for identifying sleep stages using EEG signals, which is more efficient and accurate than the state-of-the-art methods. The key innovation lies in employing a piecewise linear data reduction technique called the Halfwave method in the time domain. This method simplifies EEG signals into a piecewise linear form with reduced complexity while preserving sleep stage characteristics. Then, a features vector with six statistical features is built using parameters obtained from the reduced piecewise linear function. We used the MIT-BIH Polysomnographic Database to test our proposed method, which includes more than 80 h of long data from different biomedical signals with six main sleep classes. We used different classifiers and found that the K-Nearest Neighbor classifier performs better in our proposed method. According to experimental findings, the average sensitivity, specificity, and accuracy of the proposed algorithm on the Polysomnographic Database considering eight records is estimated as 94.82%, 96.65%, and 95.73%, respectively. Furthermore, the algorithm shows promise in its computational efficiency, making it suitable for real-time applications such as sleep monitoring devices. Its robust performance across various sleep classes suggests its potential for widespread clinical adoption, making significant advances in the knowledge, detection, and management of sleep problems.

Underwater Single-Photon 3D Reconstruction Algorithm Based on K-Nearest Neighbor.

The high sensitivity and picosecond time resolution of single-photon avalanche diodes (SPADs) can improve the operational range and imaging accuracy of underwater detection systems. When an underwater SPAD imaging system is used to detect targets, backward-scattering caused by particles in water often results in the poor quality of the reconstructed underwater image. Although methods such as simple pixel accumulation have been proven to be effective for time-photon histogram reconstruction, they perform unsatisfactorily in a highly scattering environment. Therefore, new reconstruction methods are necessary for underwater SPAD detection to obtain high-resolution images. In this paper, we propose an algorithm that reconstructs high-resolution depth profiles of underwater targets from a time-photon histogram by employing the K-nearest neighbor (KNN) to classify multiple targets and the background. The results contribute to the performance of pixel accumulation and depth estimation algorithms such as pixel cross-correlation and ManiPoP. We use public experimental data sets and underwater simulation data to verify the effectiveness of the proposed algorithm. The results of our algorithm show that the root mean square errors (RMSEs) of land targets and simulated underwater targets are reduced by 57.12% and 23.45%, respectively, achieving high-resolution single-photon depth profile reconstruction.

A hybrid model for the detection of retinal disorders using artificial intelligence techniques.

The prevalence of vision impairment is increasing at an alarming rate. The goal of the study was to create an automated method that uses optical coherence tomography (OCT) to classify retinal disorders into four categories: choroidal neovascularization, diabetic macular edema, drusen, and normal cases. This study proposed a new framework that combines machine learning and deep learning-based techniques. The utilized classifiers were support vector machine (SVM), K-nearest neighbor (K-NN), decision tree (DT), and ensemble model (EM). A feature extractor, the InceptionV3 convolutional neural network, was also employed. The performance of the models was evaluated against nine criteria using a dataset of 18000 OCT images. For the SVM, K-NN, DT, and EM classifiers, the analysis exhibited state-of-the-art performance, with classification accuracies of 99.43%, 99.54%, 97.98%, and 99.31%, respectively. A promising methodology has been introduced for the automatic identification and classification of retinal disorders, leading to reduced human error and saved time.

DTDHM: detection of tandem duplications based on hybrid methods using next-generation sequencing data.

Background: Tandem duplication (TD) is a common and important type of structural variation in the human genome. TDs have been shown to play an essential role in many diseases, including cancer. However, it is difficult to accurately detect TDs due to the uneven distribution of reads and the inherent complexity of next-generation sequencing (NGS) data. Methods: This article proposes a method called DTDHM (detection of tandem duplications based on hybrid methods), which utilizes NGS data to detect TDs in a single sample. DTDHM builds a pipeline that integrates read depth (RD), split read (SR), and paired-end mapping (PEM) signals. To solve the problem of uneven distribution of normal and abnormal samples, DTDHM uses the K-nearest neighbor (KNN) algorithm for multi-feature classification prediction. Then, the qualified split reads and discordant reads are extracted and analyzed to achieve accurate localization of variation sites. This article compares DTDHM with three other methods on 450 simulated datasets and five real datasets. Results: In 450 simulated data samples, DTDHM consistently maintained the highest F1-score. The average F1-score of DTDHM, SVIM, TARDIS, and TIDDIT were 80.0%, 56.2%, 43.4%, and 67.1%, respectively. The F1-score of DTDHM had a small variation range and its detection effect was the most stable and 1.2 times that of the suboptimal method. Most of the boundary biases of DTDHM fluctuated around 20 bp, and its boundary deviation detection ability was better than TARDIS and TIDDIT. In real data experiments, five real sequencing samples (NA19238, NA19239, NA19240, HG00266, and NA12891) were used to test DTDHM. The results showed that DTDHM had the highest overlap density score (ODS) and F1-score of the four methods. Conclusions: Compared with the other three methods, DTDHM achieved excellent results in terms of sensitivity, precision, F1-score, and boundary bias. These results indicate that DTDHM can be used as a reliable tool for detecting TDs from NGS data, especially in the case of low coverage depth and tumor purity samples.

NDMNN: A novel deep residual network based MNN method to remove batch effects from scRNA-seq data.

The rapid development of single-cell RNA sequencing (scRNA-seq) technology has generated vast amounts of data. However, these data often exhibit batch effects due to various factors such as different time points, experimental personnel, and instruments used, which can obscure the biological differences in the data itself. Based on the characteristics of scRNA-seq data, we designed a dense deep residual network model, referred to as NDnetwork. Subsequently, we combined the NDnetwork model with the MNN method to correct batch effects in scRNA-seq data, and named it the NDMNN method. Comprehensive experimental results demonstrate that the NDMNN method outperforms existing commonly used methods for correcting batch effects in scRNA-seq data. As the scale of single-cell sequencing continues to expand, we believe that NDMNN will be a valuable tool for researchers in the biological community for correcting batch effects in their studies. The source code and experimental results of the NDMNN method can be found at https://github.com/mustang-hub/NDMNN.

Streamflow Prediction Using Complex Networks.

The reliable prediction of streamflow is crucial for various water resources, environmental, and ecosystem applications. The current study employs a complex networks-based approach for the prediction of streamflow. The approach consists of three major steps: (1) the formation of a network using streamflow time series; (2) the calculation of the clustering coefficient (CC) as a network measure; and (3) the use of a clustering coefficient-based nearest neighbor search procedure for streamflow prediction. For network construction, each timestep is considered as a node and the existence of link between any node pair is identified based on the difference (distance) between the streamflow values of the nodes. Different distance threshold values are used to identify the critical distance threshold to form the network. The complex networks-based approach is implemented for the prediction of daily streamflow at 142 stations in the contiguous United States. The prediction accuracy is quantified using three statistical measures: correlation coefficient (R), normalized root mean square error (NRMSE), and Nash-Sutcliffe efficiency (NSE). The influence of the number of neighbors on the prediction accuracy is also investigated. The results, obtained with the critical distance threshold, reveal that the clustering coefficients for the 142 stations range from 0.799 to 0.999. Overall, the prediction approach yields reasonably good results for all 142 stations, with R values ranging from 0.05 to 0.99, NRMSE values ranging from 0.1 to 12.3, and the NSE values ranging from -0.89 to 0.99. An attempt is also made to examine the relationship between prediction accuracy and the catchment characteristics/streamflow statistical properties (drainage area, mean flow, coefficient of variation of flow). The results suggest that the prediction accuracy does not have much of a relationship with the drainage area and the mean streamflow values, but with the coefficient of variation of flow. The outcomes from this study are certainly promising regarding the application of complex networks-based concepts for the prediction of streamflow (and other hydrologic) time series.

A Delayed Spiking Neural Membrane System for Adaptive Nearest Neighbor-Based Density Peak Clustering.

Although the density peak clustering (DPC) algorithm can effectively distribute samples and quickly identify noise points, it lacks adaptability and cannot consider the local data structure. In addition, clustering algorithms generally suffer from high time complexity. Prior research suggests that clustering algorithms grounded in P systems can mitigate time complexity concerns. Within the realm of membrane systems (P systems), spiking neural P systems (SN P systems), inspired by biological nervous systems, are third-generation neural networks that possess intricate structures and offer substantial parallelism advantages. Thus, this study first improved the DPC by introducing the maximum nearest neighbor distance and K-nearest neighbors (KNN). Moreover, a method based on delayed spiking neural P systems (DSN P systems) was proposed to improve the performance of the algorithm. Subsequently, the DSNP-ANDPC algorithm was proposed. The effectiveness of DSNP-ANDPC was evaluated through comprehensive evaluations across four synthetic datasets and 10 real-world datasets. The proposed method outperformed the other comparison methods in most cases.

NeuroHealth guardian: A novel hybrid approach for precision brain stroke prediction and healthcare analytics.

Stroke is a severe illness, that requires early stroke detection and intervention, as this would help prevent the worsening of the condition. The research is done to solve stroke prediction problem, which may be divided into a number of sub-problems such as an individual's predisposition to develop stroke. To attain this objective, a multiturn dataset consisting of various health features, such as age, gender, hypertension, and glucose levels, takes a central role. A multiple approach was put forward concentrating on integrating the machine learning techniques, such as Logistic Regression, Naive Bayes, K-Nearest Neighbors, and Support Vector Machine (SV), together to develop an ensemble machine called Neuro-Health Guardian. The hypothesis "Neuro-Health Guardian Model" integrates these algorithms into one, purported to make stroke prediction more accurate. The topic dives into each instance of preparation of data for analysis, data visualization techniques, selection of the right model, training, testing, ensembling, evaluation, and prediction. The models are validated with error rate accounted from their accuracy, precision, recall, F1 score, and finally confusion matrices for a look. The study's result is showing that the ensemble model that combines the multiple algorithms has the edge over them and this is evidently by the fact that it can predict stroke rises. Additionally, accuracy, precision, recall, and F1 scores are measured in all models and the comparison is done to provide a clear comparison of the models' performance. In short, the article presented the formation of the ongoing stroke prediction that revealed the ensemble model as a good anticipation. Precise stroke predisposition forecasting can assist in early intervention thereby preventing stroke-related deaths, and limiting disability burden by stroke. The conclusions that have come out of this study offer a great action item for the development of predictive models related to stroke prevention and treatment.

Machine learning-driven SERS analysis platform for rapid and accurate detection of precancerous lesions of gastric cancer.

A novel approach is proposed leveraging surface-enhanced Raman spectroscopy (SERS) combined with machine learning (ML) techniques, principal component analysis (PCA)-centroid displacement-based nearest neighbor (CDNN). This label-free approach can identify slight abnormalities between SERS spectra of gastric lesions at different stages, offering a promising avenue for detection and prevention of precancerous lesion of gastric cancer (PLGC). The agaric-shaped nanoarray substrate was prepared using gas-liquid interface self-assembly and reactive ion etching (RIE) technology to measure SERS spectra of serum from mice model with gastric lesions at different stages, and then a SERS spectral recognition model was trained and constructed using the PCA-CDNN algorithm. The results showed that the agaric-shaped nanoarray substrate has good uniformity, stability, cleanliness, and SERS enhancement effect. The trained PCA-CDNN model not only found the most important features of PLGC, but also achieved satisfactory classification results with accuracy, area under curve (AUC), sensitivity, and specificity up to 100%. This demonstrated the enormous potential of this analysis platform in the diagnosis of PLGC.

Systematic review of approaches to detection and classification of skin cancer using artificial intelligence: Development and prospects.

In recent years, there has been a significant improvement in the accuracy of the classification of pigmented skin lesions using artificial intelligence algorithms. Intelligent analysis and classification systems are significantly superior to visual diagnostic methods used by dermatologists and oncologists. However, the application of such systems in clinical practice is severely limited due to a lack of generalizability and risks of potential misclassification. Successful implementation of artificial intelligence-based tools into clinicopathological practice requires a comprehensive study of the effectiveness and performance of existing models, as well as further promising areas for potential research development. The purpose of this systematic review is to investigate and evaluate the accuracy of artificial intelligence technologies for detecting malignant forms of pigmented skin lesions. For the study, 10,589 scientific research and review articles were selected from electronic scientific publishers, of which 171 articles were included in the presented systematic review. All selected scientific articles are distributed according to the proposed neural network algorithms from machine learning to multimodal intelligent architectures and are described in the corresponding sections of the manuscript. This research aims to explore automated skin cancer recognition systems, from simple machine learning algorithms to multimodal ensemble systems based on advanced encoder-decoder models, visual transformers (ViT), and generative and spiking neural networks. In addition, as a result of the analysis, future directions of research, prospects, and potential for further development of automated neural network systems for classifying pigmented skin lesions are discussed.

A fault isolation strategy for industrial processes using outlier-degree-based variable contributions.

In industrial process monitoring, it is always a challenging and practical problem to analyze the causes of the system fault by isolating true fault variables from vast amounts of process data. However, the phenomenon of smearing effect occurs by using the traditional contribution analysis-based isolation methods since the defined isolation indices of different variables affect each other. In this paper, a new fault isolation method is proposed based on local outlier factor and improved k-nearest neighbor rule aiming to improve the isolation accuracy. Firstly, the nearest neighbors of each sample are obtained along the direction of a specific variable. Based on the nearest neighbors, the outlier-degree value of the variable is calculated and regarded as the contribution of the variable. Then, the contribution of the variable in all samples are obtained in the same way, among which the maximum one is selected as the isolation threshold value of this variable. During the online monitoring, the contribution of the variable in the newly collected sample is calculated in real time. Once the contribution is greater than the threshold, the variable is judged to be the dominant factor causing the system fault. Two cases on numerical example and Tennessee Eastman process are conducted to evaluate the effectiveness of the proposed method.

VarGibbs Usage in the Optimization of Nearest-Neighbor Parameters and Prediction of Melting Temperature of RNA Duplexes.

The nearest-neighbor (NN) model is a general tool for the evaluation for oligonucleotide thermodynamic stability. It is primarily used for the prediction of melting temperatures but has also found use in RNA secondary structure prediction and theoretical models of hybridization kinetics. One of the key problems is to obtain the NN parameters from melting temperatures, and VarGibbs was designed to obtain those parameters directly from melting temperatures. Here we will describe the basic workflow from RNA melting temperatures to NN parameters with the use of VarGibbs. We start by a brief revision of the basic concepts of RNA hybridization and of the NN model and then show how to prepare the data files, run the parameter optimization, and interpret the results.

How Parameters Influence SHAPE-Directed Predictions.

The structure of an RNA sequence encodes information about its biological function. Dynamic programming algorithms are often used to predict the conformation of an RNA molecule from its sequence alone, and adding experimental data as auxiliary information improves prediction accuracy. This auxiliary data is typically incorporated into the nearest neighbor thermodynamic model22 by converting the data into pseudoenergies. Here, we look at how much of the space of possible structures auxiliary data allows prediction methods to explore. We find that for a large class of RNA sequences, auxiliary data shifts the predictions significantly. Additionally, we find that predictions are highly sensitive to the parameters which define the auxiliary data pseudoenergies. In fact, the parameter space can typically be partitioned into regions where different structural predictions predominate.

Ankylosing spondylitis prediction using fuzzy K-nearest neighbor classifier assisted by modified JAYA optimizer.

The diagnosis of ankylosing spondylitis (AS) can be complex, necessitating a comprehensive assessment of medical history, clinical symptoms, and radiological evidence. This multidimensional approach can exacerbate the clinical burden and increase the likelihood of diagnostic inaccuracies, which may result in delayed or overlooked cases. Consequently, supplementary diagnostic techniques for AS have become a focal point in clinical research. This study introduces an enhanced optimization algorithm, SCJAYA, which incorporates salp swarm foraging behavior with cooperative predation strategies into the JAYA algorithm framework, noted for its robust optimization capabilities that emulate the evolutionary dynamics of biological organisms. The integration of salp swarm behavior is aimed at accelerating the convergence speed and enhancing the quality of solutions of the classical JAYA algorithm while the cooperative predation strategy is incorporated to mitigate the risk of convergence on local optima. SCJAYA has been evaluated across 30 benchmark functions from the CEC2014 suite against 9 conventional meta-heuristic algorithms as well as 9 state-of-the-art meta-heuristic counterparts. The comparative analyses indicate that SCJAYA surpasses these algorithms in terms of convergence speed and solution precision. Furthermore, we proposed the bSCJAYA-FKNN classifier: an advanced model applying the binary version of SCJAYA for feature selection, with the aim of improving the accuracy in diagnosing and prognosticating AS. The efficacy of the bSCJAYA-FKNN model was substantiated through validation on 11 UCI public datasets in addition to an AS-specific dataset. The model exhibited superior performance metrics-achieving an accuracy rate, specificity, Matthews correlation coefficient (MCC), F-measure, and computational time of 99.23 %, 99.52 %, 0.9906, 99.41 %, and 7.2800 s, respectively. These results not only underscore its profound capability in classification but also its substantial promise for the efficient diagnosis and prognosis of AS.

Enhanced PSO feature selection with Runge-Kutta and Gaussian sampling for precise gastric cancer recurrence prediction.

Gastric cancer (GC), characterized by its inconspicuous initial symptoms and rapid invasiveness, presents a formidable challenge. Overlooking postoperative intervention opportunities may result in the dissemination of tumors to adjacent areas and distant organs, thereby substantially diminishing prospects for patient survival. Consequently, the prompt recognition and management of GC postoperative recurrence emerge as a matter of paramount urgency to mitigate the deleterious implications of the ailment. This study proposes an enhanced feature selection model, bRSPSO-FKNN, integrating boosted particle swarm optimization (RSPSO) with fuzzy k-nearest neighbor (FKNN), for predicting GC. It incorporates the Runge-Kutta search, for improved model accuracy, and Gaussian sampling, enhancing the search performance and helping to avoid locally optimal solutions. It outperforms the sophisticated variants of particle swarm optimization when evaluated in the CEC 2014 test suite. Furthermore, the bRSPSO-FKNN feature selection model was introduced for GC recurrence prediction analysis, achieving up to 82.082 % and 86.185 % accuracy and specificity, respectively. In summation, this model attains a notable level of precision, poised to ameliorate the early warning system for GC recurrence and, in turn, advance therapeutic options for afflicted patients.

Vehicle Position Detection Based on Machine Learning Algorithms in Dynamic Wireless Charging.

Dynamic wireless charging (DWC) has emerged as a viable approach to mitigate range anxiety by ensuring continuous and uninterrupted charging for electric vehicles in motion. DWC systems rely on the length of the transmitter, which can be categorized into long-track transmitters and segmented coil arrays. The segmented coil array, favored for its heightened efficiency and reduced electromagnetic interference, stands out as the preferred option. However, in such DWC systems, the need arises to detect the vehicle's position, specifically to activate the transmitter coils aligned with the receiver pad and de-energize uncoupled transmitter coils. This paper introduces various machine learning algorithms for precise vehicle position determination, accommodating diverse ground clearances of electric vehicles and various speeds. Through testing eight different machine learning algorithms and comparing the results, the random forest algorithm emerged as superior, displaying the lowest error in predicting the actual position.