Intelligent Fault Diagnosis Approach Based on Composite Multi-Scale Dimensionless Indicators and Affinity Propagation Clustering

The data-driven characterization of discretionary lane-changing behaviors has traditionally been hindered by the scarcity of high-resolution data that can precisely record lateral movements. In this study, we conducted an exploratory investigation leveraging the Third Generation Simulation (TGSIM) dataset to advance our understanding of discretionary lane-changing behaviors. In this paper, we developed a discretionary lane-changing extraction pipeline and scrutinized crucial factors such as gaps and relative speeds in leading and following directions. A dynamic time warping (DTW) analysis was performed to quantify the difference between any pair of lane-changing behaviors, and an affinity propagation (AP) clustering, evaluated on normalized DTW distance, was conducted. Our results yielded five clusters based on lead and lag gaps, enabling us to categorize lane-changing behaviors into aggressive, neutral, and cautious for both leading and following directions. Clustering based on relative speeds revealed two distinct groups of lane-changing behaviors, one representing overtaking and the other indicative of transitioning into a lane with stable and homogenous speed. The proposed DTW analysis, in conjunction with AP clustering, demonstrated promising potential in categorizing and characterizing lane-changing behaviors. Additionally, this approach can be readily adapted to analyze any driving behavior.

With the fast development of internet of things (IoT), a large amount of missing data is produced in the process of data collection and transmission. We call these data incomplete data. Many traditional methods use imputation or discarding strategy to cluster incomplete data. In this paper, we propose an improved incomplete affinity propagation (AP) clustering algorithm based on K nearest neighbours (IAPKNN). IAPKNN firstly partitions the dataset into complete and incomplete dataset, and then clusters the complete data set by AP clustering directly. Secondly, according to the similarity, IAPKNN extends the responsibility and availability matrices to the incomplete dataset. Finally, clustering algorithm is restarted based on the extended matrices. In addition, to address the clustering efficiency of large scale dataset, we give a distributed clustering algorithm scheme. Experiment results demonstrate that IAPKNN is effective in clustering incomplete data directly.

In the field of mechanical fault diagnosis, in order to improve the diagnosis accuracy with high feature dimension, a method of features linear fusion method based on AP(Affinity propagation clustering) and AASC(Affinity Aggregation for Spectral Clustering) algorithm was proposed. Low dimension space was obtained by AP clustering, then using AASC algorithm to fuse this selected features, and gained a new feature, meanwhile which can be used independently as a new feature. In the phase of experiment, this method was compared with respectively LPP and PCA, it’s result indicates that this method is excellent in improving diagnosis accuracy.

Automatic mode tracing of dispersion relations for guided waves in elastic waveguides via physics-driven affinity propagation (AP) clustering

Machine learning (ML) models are cost-effective tools that can establish a prognosis by considering clinical, genomic, and histological data from breast cancer patients. In this study, we evaluate the performance of 12 ML models in predicting the overall survival of breast cancer patients from “The Cancer Genome Atlas-Breast Cancer” database at 60 months of follow-up. The models evaluated were Logistic Regression (LR), Ridge Classifier (RC), Least Absolute Shrinkage and Selection Operator (LASSO), K-Nearest Neighbors (KNN), Naive Bayes (NB), Linear Discriminant Analysis (LDA), Decision Tree (DT), Multilayer Perceptron (MP), Stochastic Gradient Descent (SGD), Support Vector Machine (SVM), Random Forest (RF), and XGBoost (XGB). The most accurate models were NB (86.76%) and SGD (85.29%). The models with the highest sensitivity were SGD (93.75%), MP (91.67%), and NB (89.89%), while the models with the highest specificity were KNN (95.0%), DT (90.0%), and LASSO (85.0%). The models with the highest area under the ROC curve were LDA (90.83%), LASSO (90.1%), and LR (89.79%). The most relevant variables were “Previous Diagnosis of Cancer,” “Presence of Tumor,” “Ancillary Therapy,” and “Histology.” Our findings demonstrate that AI tools for predicting patient outcomes are a viable option when expensive prognostic genomic tools are not available. According to our results, NB and LASSO show promising performance in predicting the prognosis of breast cancer patients. Further studies with data from developing countries are needed to improve the performance of these tools.

For large-scale data sets, the traditional AP clustering algorithm processes all data samples through the idea of iteration and three metrics calculation. This kind of processing will lead to poor clustering effect and high time consumption. Based on this problem, an algorithm which is called KCAP based on Affinity Propagation clustering and Canopy clustering algorithm was proposed. Firstly, KNN distance was used to calculate the local density for each data. Secondly, we used the Canopy algorithm to roughly cluster the data sets, and the center points were formed into a new data set \(Y\). Then, we applied affinity propagation clustering algorithm to cluster the data set \(Y\). Finally, we assigned the data to the nearest center. Compared with the traditional AP algorithm, K-means algorithm and FCM algorithm, the experimental results on synthetic data sets and UCI data sets show that algorithm KCAP not only improves the clustering accuracy, but also have higher efficiency.KeywordsK-Nearest Neighbors (KNN)Initial centerCanopy algorithmAffinity Propagation (AP)Rough clustering

Advancement in technology has helped people to live a long and better life. But the increased life expectancy has also elevated the risk of age related disorders, especially the neurodegenerative disorders. Alzheimer’s is one such neurodegenerative disorder, which is also the leading contributor towards dementia in elderly people. Despite of extensive research in this field, scientists have failed to find a cure for the disease till date. This makes early diagnosis of Alzheimer’s very crucial so as to delay its progression and improve the condition of the patient. Various techniques are being employed for diagnosing Alzheimer’s which include neuropsychological tests, medical imaging, blood based biomarkers, etc. Apart from this, various machine learning algorithms have been employed so far to diagnose Alzheimer’s in its early stages. In the current research, authors compared the performance of various machine learning techniques i.e., Linear Discriminant Analysis (LDA), K-Nearest Neighbour (KNN), Naïve Bayes (NB), Support Vector Machines (SVM), Decision Trees (DT), Random Forests (RF) and Multi Layer Perceptron (MLP) on Alzheimer’s dataset. This paper experimentally demonstrated that normalization exhibits a predominant role in enhancing the efficiency of some machine learning algorithms. Therefore it becomes imperative to choose the algorithms as per the available data. In this paper, the efficiency of the given machine learning methods was compared in terms of accuracy and f1-score. Naïve Bayes gave a better overall performance for both accuracy and f1-score and it also remained unaffected with the normalization of data along with LDA, DT and RF. Whereas KNN, SVM and MLP showed a drastic (17% to 86%) improvement in the performance when they are given normalized data as compared to un-normalized data from Alzheimer’s dataset.

Handwritten signature identification is a process that determines an individual’s true identity by analyzing their signature. This is an important task in various applications such as financial transactions, legal document verification, and biometric systems. Various techniques have been developed for signature identification, including feature-based methods and machine learning-based methods. However, verifying handwritten signatures in digital transactions and remote document authentication is still challenging. The inherent variety in people’s signatures, which may occur due to factors such as mood, exhaustion, or even the writing tool used, contributes to the problem. Furthermore, the proliferation of sophisticated forgery methods, such as freehand mimicking and sophisticated picture manipulation, necessitates the development of reliable and precise tools for identifying authentic signatures from fake ones.The present paper suggests a method for identifying signatures based on integrating static (off-line) handwritten signature data. This is done by fusing three types of signature features: Linear Discriminant Analysis (LDA) as appearance-based features, Fast Fourier Transform (FFT) as frequency-features, and Gray-Level Co-occurrence Matrix (GLCM) as texture-features. Then, these fused features are inputted into four types of machine learning algorithms: Naive Bayes, K-Nearest Neighbor, Decision Tree, and AdaBoost classifiers, to identify each person and to find the most robust algorithm in terms of accuracy and precision and recall. For experiments, we have used two famous datasets: SigComp2011 and CEDAR. After training datasets, the highest accuracy achieved was 100% on the CEDAR dataset and 94.43% on the SigComp2011 dataset using a Naive Bayes classifier. Index Terms— Fast Fourier Transform, Gray-Level Co-occurrence Matrix, Handwritten Signature, Linear Discriminant Analysis, Machine Learning.

Drone small cells (DSCs) can provide on-demand air-to-ground wireless communications in various unexpected situations, such as traffic jam or natural disasters. However, a DSC needs to face the challenges such as severe co-channel interference, limited battery capacity, and fast topology changes. Aiming to improve energy efficiency of DSCs and quality of services of customers, this paper presents a learning-based multiple drone management (LDM) framework by controlling the transmission power and the 3-dimension location of DSCs based on location data, and reference signal received power of users. Since the labeled throughput data are typically not available in emergency situations, we develop unsupervised learning DSC management techniques: 1) affinity propagation interference management scheme to mitigate interference and energy consumption, and 2) K-means position adjustment to adjust the new 3-dimension positions of drones. Our numerical results show that the proposed LDM framework combining with affinity propagation clustering and k-means clustering can enhance the energy efficiency of DSCs by 25% and the signal-to-interference-plus-noise ratio of ground users by 56%, respectively.

Affinity propagation (AP) algorithm, as a novel clustering method, does not require the users to specify the initial cluster centers in advance, which regards all data points as potential exemplars (cluster centers) equally and groups the clusters totally by the similar degree among the data points. But in many cases there exist some different intensive areas within the same data set, which means that the data set does not distribute homogeneously. In such situation the AP algorithm cannot group the data points into ideal clusters. In this paper, we proposed an extended AP clustering algorithm to deal with such a problem. There are two steps in our method: firstly the data set is partitioned into several data density types according to the nearest distances of each data point; and then the AP clustering method is, respectively, used to group the data points into clusters in each data density type. Two experiments are carried out to evaluate the performance of our algorithm: one utilizes an artificial data set and the other uses a real seismic data set. The experiment results show that groups are obtained more accurately by our algorithm than OPTICS and AP clustering algorithm itself.

Objective: Using methylation characteristics of human genes to construct machine learning predictive models for screening cervical cancer and precancerous lesions. Methods: Human DNA methylation detection was performed on 224 cervical exfoliated cell specimens from the Cancer Hospital of the Chinese Academy of Medical Sciences, Tianjin Central Hospital of Gynecology Obstetrics, Xinmi Maternal and Child Health Hospital of Henan Province, West China Second Affiliated Hospital of Sichuan University, and Heping Hospital Affiliated to Changzhi Medical College collected during April 2014 and March 2015. The hypermethylated gene fragments related to cervical cancer were selected by high-density, high-association, and hypermethylated gene fragment screening and the LASSO regression algorithm. Taking cervical intraepithelial neoplasia grade 2 (CIN2) or more severe lesions as the research outcome, machine learning predictive models based on the random forest (RF), naive Bayes (NB), and support vector machine (SVM) algorithm, respectively, were constructed. A total of 144 outpatient specimens were used as the training set and 80 cervical exfoliated cell specimens from women participating in the cervical cancer screening program were used as the test set to verify the predictive models. Using histological diagnosis results as the gold standard, the detection efficacy for CIN2 or more severe lesions of the three machine learning predictive models were compared with that of the human papilloma virus (HPV) detection and cytological diagnosis. Results: In the training set of 144 cases, there were 34 cases of HPV positivity, with a positive rate of 23.61%. Cytologically, there were 37 cases diagnosed as no intraepithelial lesion or malignancy (NILM), and 107 cases diagnosed as atypical squamous cells of undetermined significance (ASC-US) or above. Histologically, there were 28 cases without cervical intraepithelial neoplasia or benign cervical lesions, 31 cases of CIN1, 18 cases of CIN2, 31 cases of CIN3, and 36 cases of squamous cell carcinoma. Seven hypermethylated gene fragments were selected from 45 genes, and three machine learning prediction models based on the RF, NB, and SVM algorithm, respectively, were constructed. In the validation set of 80 cases, there were 28 cases of HPV positivity, with a positive rate of 35.00%. Cytologically, there were 65 cases diagnosed as NILM and 15 cases as ASC-US or above. Histologically, there were 39 cases without cervical intraepithelial neoplasia or benign cervical lesions, 10 cases of CIN1, 10 cases of CIN2, 11 cases of CIN3, and 10 cases of squamous cell carcinoma. In the validation set, the area under the curve (AUC) values of the RF model, NB model, SVM model, HPV detection, and cytological diagnosis of CIN2 or above were 0.90, 0.88, 0.82, 0.68, and 0.45, respectively. The DeLong test showed that there was no statistically significant difference in the AUC values between the RF, NB, and SVM models (all P＞0.05), and the AUC values of the RF and NB models were higher than that of HPV detection (both P＜0.01), and the AUC values of the RF, NB, and SVM models were higher than that of cytological diagnosis (all P＜0.01). Compared with the NB model, the sensitivity of the RF model was similar (80.65% vs. 77.42%), but the specificity of the NB model was much higher than that of the RF model (93.88% vs. 73.47%). Conclusion: Among the machine learning prediction models for cervical cancer and precancerous lesions constructed based on human DNA methylation, the NB model has good predictive performance for CIN2 and above lesions, and may be used for screening of cervical cancer and precancerous lesions.

Simple SummaryTargeted therapy against epidermal growth factor (EGFR) mutations has become the standard of care for non-small cell lung cancer, and there has not been an efficient genetic test for non-small cell lung cancer patients. The present study aims to find a novel data-driven genetic testing method that can effectively predict the mutation status of EGFR based on a prediction model combining clinical features. The results of this study provide a powerful theoretical basis for the establishment of an effective mutation prediction model. The prediction model can provide a high reference value aiding in EGFR mutation diagnosis and subsequent treatment course.Data from 758 patients with lung adenocarcinoma were retrospectively collected. All patients had undergone computed tomography imaging and EGFR gene testing. Radiomic features were extracted using the medical imaging tool 3D-Slicer and were combined with the clinical features to build a machine learning prediction model. The high-dimensional feature set was screened for optimal feature subsets using principal component analysis (PCA) and the least absolute shrinkage and selection operator (LASSO). Model prediction of EGFR mutation status in the validation group was evaluated using multiple classifiers. We showed that six clinical features and 622 radiomic features were initially collected. Thirty-one radiomic features with non-zero correlation coefficients were obtained by LASSO regression, and 24 features correlated with label values were obtained by PCA. The shared radiomic features determined by these two methods were selected and combined with the clinical features of the respective patient to form a subset of features related to EGFR mutations. The full dataset was partitioned into training and test sets at a ratio of 7:3 using 10-fold cross-validation. The area under the curve (AUC) of the four classifiers with cross-validations was: (1) K-nearest neighbor (AUCmean = 0.83, Acc = 81%); (2) random forest (AUCmean = 0.91, Acc = 83%); (3) LGBM (AUCmean = 0.94, Acc = 88%); and (4) support vector machine (AUCmean = 0.79, Acc = 83%). In summary, the subset of radiographic and clinical features selected by feature engineering effectively predicted the EGFR mutation status of this NSCLC patient cohort.

Background/Objectives: Fetal health is essential in prenatal care, influencing both maternal and fetal outcomes. Cardiotocography (CTG) monitors uterine contractions and fetal heart rate, yet manual interpretation exhibits significant inter-examiner variability. Machine learning offers automated alternatives; however, class imbalance in CTG datasets where pathological cases constitute less than 10% leads to poor detection of minority classes. This study aims to provide the first systematic benchmark comparing five resampling strategies across seven classifier families for multi-class CTG classification, evaluated using imbalance-aware metrics rather than overall accuracy alone. Methods: Seven machine learning models were employed: Naïve Bayes (NB), Random Forest (RF), Linear Discriminant Analysis (LDA), k-Nearest Neighbors (KNN), Linear Support Vector Machine (SVM), Multinomial Logistic Regression (MLR), and Multi-Layer Perceptron (MLP). To address class imbalance, we evaluated the original unbalanced dataset (base) and five resampling methods: SMOTE, BSMOTE, ADASYN, NearMiss, and SCUT. Performance was evaluated on a held-out test set using Balanced Accuracy (BACC), Macro-F1, the Macro-Matthews Correlation Coefficient (Macro-MCC), and Macro-Averaged ROC-AUC. We also report per-class ROC curves. Results: Among all models, RF proved most reliable. Training on the original distribution (base) yielded the highest BACC (0.9118), whereas RF combined with BSMOTE provided the strongest class-balanced performance (Macro-MCC = 0.8533, Macro-F1 = 0.9073) with a near-perfect ROC-AUC (approximately 0.986–0.989). Overall, resampling effects proved model dependent. While some classifiers achieved optimal performance on the natural class distribution, oversampling techniques, particularly SMOTE and BSMOTE, demonstrated significant improvements in minority class discrimination and class-balanced metrics across multiple model families. Notably, certain models benefited substantially from resampling, exhibiting enhanced Macro-F1, BACC, and minority class recall without sacrificing overall accuracy. Conclusions: These findings establish robust, model-agnostic baselines for CTG-based fetal health screening. They highlight that strategic oversampling can translate improved minority class discrimination into clinically meaningful performance gains, supporting deployment in cost-sensitive and threshold-aware clinical settings.

Software testing is an important task in software development activities, and it requires most of the resources, namely, time, cost and effort. To minimize this fatigue, software bug prediction (SBP) models are applied to improve the software quality assurance (SQA) processes by predicting buggy components. The bug prediction models use machine learning classifiers so that bugs can be predicted in software components in some software metrics. These classifiers are characterized by some configurable parameters, called hyper-parameters that need to be optimized to ensure better performance. Many methods have been proposed by researchers to predict the defective components but these classifiers sometimes not perform well when default settings are used for machine learning classifiers. In this paper, software bug prediction model is proposed which uses machine learning classifiers in conjunction with the Artificial Immune Network (AIN) to improve bug prediction accuracy through its hyper-parameter optimization. For this purpose, seven machine learning classifiers, such as support vector machine Radial base function (SVM-RBF), K-nearest neighbor (KNN) (Minkowski metric), KNN (Euclidean metric), Naive Bayes (NB), Decision Tree (DT), Linear discriminate analysis (LDA), Random forest (RF) and adaptive boosting (AdaBoost), were used. The experiment was carried out on bug prediction dataset. The results showed that hyper-parameter optimization of machine learning classifiers, using AIN and its applications for software bug prediction, performed better than when classifiers with their default hyper-parameters were used.

Feature selection is referred to the process of obtaining a subset from an original feature set according to certain feature selection criterion, which selects the relevant features of the dataset. It plays a role in compressing the data processing scale, where the redundant and irrelevant features are removed. Feature selection techniques show that more information is not always good in machine learning applications. Apply different algorithms for the data at hand and with baseline classification performance values we can select a final feature selection algorithm. In this paper, we propose a hybrid classification model, which has correlation based filter feature selection algorithm and Machine learning as classifiers. The objective of this study is to select relevant features and analyze the outperform machine learning algorithms in order to train our model, predict and compare their classification performance. In this method, features are ordered according to their Absolute correlation value with respect to the class attribute. Then top K Features are selected from ordered list of features to form a reduced dataset. This proposed classifier model is applied to our smart meter datasets. To measure the performance of these selected features; seven benchmark classifier are used; Random Forest (RF), Logistic Regression (LR), k-Nearest Neighbor (kNN), Naive Bayes (NB), Decision Tree (DT), Linear Discriminant Analysis (LDA) and Support Vector Machine (SVM). This paper then analyzes the performance of all classifiers with feature selection in term of accuracy, sensitivity, F-Measure, Specificity, Precision, and MCC. From our experiment, we found that Random Forest classifier performed higher than other used classifiers.