K-nearest Neighbor Classifier Research Articles

Pattern Recognition of Partial Discharge Faults in Switchgear Using a Back Propagation Neural Network Optimized by an Improved Mantis Search Algorithm

The dependable functioning of switchgear is essential to maintain the stability of power supply systems. Partial discharge (PD) is a critical phenomenon affecting the insulation of switchgear, potentially leading to equipment failure and accidents. PDs are generally grouped into metal particle discharge, suspended discharge, and creeping discharge. Different types of PDs are closely related to the severity of a PD. Partial discharge pattern recognition (PDPR) plays a vital role in the early detection of insulation defects. In this regard, a Back Propagation Neural Network (BPNN) for PDPR in switchgear is proposed in this paper. To eliminate the sensitivity to initial values of BPNN parameters and to enhance the generalized ability of the proposed BPRN, an improved Mantis Search Algorithm (MSA) is proposed to optimize the BPNN. The improved MSA employs some boundary handling strategies and adaptive parameters to enhance the algorithm’s efficiency in optimizing the network parameters of BPNN. Principal Component Analysis (PCA) is introduced to reduce the dimensionality of the feature space to achieve significant time saving in comparable recognition accuracy. The initially extracted 14 feature values are reduced to 7, reducing the BPNN parameter count from 183 with 14 features to 113 with 7 features. Finally, numerical results are presented and compared with Decision Tree (DT), k-Nearest Neighbor classifiers (KNN), and Support Vector Machine (SVM). The proposed method in this paper exhibits the highest recognition accuracy in metal particle discharge and suspended discharge.

CCADD: An Online Webserver for Alzheimer's Disease Detection from Brain MRI

Alzheimer's disease (AD) imposes a growing burden on public health due to its impact on memory, cognition, behavior, and social skills. Early detection using non-invasive brain magnetic resonance images (MRI) is vital for disease management. We introduce CCADD (Corpus Callosum-based Alzheimer's Disease Detection), a user-friendly webserver that automatically identifies and segments the corpus callosum (CC) region from brain MRI slices. Extracted shape and size-based features of CC are fed into Support Vector Machines (SVM), Random Forest (RF), eXtreme Gradient Boosting (XGBoost), K-Nearest Neighbour (KNN), and Artificial Neural Network (ANN) classifiers to predict AD or Mild Cognitive Impairment (MCI). Exhaustive benchmarking on ADNI data reveals high prediction accuracies for different AD severity levels. CCADD empowers clinicians and researchers for AD detection. This server is available at: http://www.hpppi.iicb.res.in/add.

Enhancing Speaker Recognition Models with Noise-Resilient Feature Optimization Strategies

This paper delves into an in-depth exploration of speaker recognition methodologies, with a primary focus on three pivotal approaches: feature-level fusion, dimension reduction employing principal component analysis (PCA) and independent component analysis (ICA), and feature optimization through a genetic algorithm (GA) and the marine predator algorithm (MPA). This study conducts comprehensive experiments across diverse speech datasets characterized by varying noise levels and speaker counts. Impressively, the research yields exceptional results across different datasets and classifiers. For instance, on the TIMIT babble noise dataset (120 speakers), feature fusion achieves a remarkable speaker identification accuracy of 92.7%, while various feature optimization techniques combined with K nearest neighbor (KNN) and linear discriminant (LD) classifiers result in a speaker verification equal error rate (SV EER) of 0.7%. Notably, this study achieves a speaker identification accuracy of 93.5% and SV EER of 0.13% on the TIMIT babble noise dataset (630 speakers) using a KNN classifier with feature optimization. On the TIMIT white noise dataset (120 and 630 speakers), speaker identification accuracies of 93.3% and 83.5%, along with SV EER values of 0.58% and 0.13%, respectively, were attained utilizing PCA dimension reduction and feature optimization techniques (PCA-MPA) with KNN classifiers. Furthermore, on the voxceleb1 dataset, PCA-MPA feature optimization with KNN classifiers achieves a speaker identification accuracy of 95.2% and an SV EER of 1.8%. These findings underscore the significant enhancement in computational speed and speaker recognition performance facilitated by feature optimization strategies.

A machine learning approach to evaluate the impact of virtual balance/cognitive training on fall risk in older women

A machine learning approach to evaluate the impact of virtual balance/cognitive training on fall risk in older women

Optimizing Business-to-Business Customer Satisfaction Analysis through Advanced Two-Stage Clustering: Insights from Industrial Parks

Traditional research on customer satisfaction (CS) estimation has focused on the business-to-customer (BTC) business mode. Customers in the BTC mode have been assumed to be familiar with the full range of services or products and to be able to make estimations of their CS. However, in the business-to-business (BTB) mode, diverse services have often been required and provided. It may be difficult to find members who have experience with all kinds of services or to generate common CS estimation results supported by different members. In this study, the difference between BTC and BTB was verified using structural equation modeling (SEM), and a model of CS estimation was developed with respect to BTB. The empirical results show that perceived service quality has no direct impact on enterprise satisfaction, indicating that traditional models are limited. A two-stage clustering algorithm was adopted to optimize the traditional CS evaluation model based on SEM, i.e., (1) K-nearest neighbor (KNN) classification and (2) density-based spatial clustering of applications with noise (DBSCAN). In order to verify the feasibility of the proposed model, CS with respect to six industrial parks was estimated empirically. The results show that the proposed model can improve the results of CS estimation compared with the results obtained using traditional methods. During the clustering process, each park generated and eliminated a certain number of noise points to optimize the satisfaction evaluation results. Specifically, park A generated and eliminated seven noise points, while park C generated and eliminated five noise points. The results of the satisfaction evaluation of each park obtained using the proposed model are more realistic, i.e., park A > park B > park C > park E > park D > park F. The proposed model extends the existing research on CS estimation in theory and can support applications in the BTB business mode.

Comparison of Different Fusion Radiomics for Predicting Benign and Malignant Sacral Tumors: A Pilot Study.

Differentiating between benign and malignant sacral tumors is crucial for determining appropriate treatment options. This study aims to develop two benchmark fusion models and a deep learning radiomic nomogram (DLRN) capable of distinguishing between benign and malignant sacral tumors using multiple imaging modalities. We reviewed axial T2-weighted imaging (T2WI) and non-contrast computed tomography (NCCT) of 134 patients pathologically confirmed as sacral tumors. The two benchmark fusion models were developed using fusion deep learning (DL) features and fusion classical machine learning (CML) features from multiple imaging modalities, employing logistic regression, K-nearest neighbor classification, and extremely randomized trees. The two benchmark models exhibiting the most robust predictive performance were merged with clinical data to formulate the DLRN. Performance assessment involved computing the area under the receiver operating characteristic curve (AUC), sensitivity, specificity, accuracy, negative predictive value (NPV), and positive predictive value (PPV). The DL benchmark fusion model demonstrated superior performance compared to the CML fusion model. The DLRN, identified as the optimal model, exhibited the highest predictive performance, achieving an accuracy of 0.889 and an AUC of 0.961 in the test sets. Calibration curves were utilized to evaluate the predictive capability of the models, and decision curve analysis (DCA) was conducted to assess the clinical net benefit of the DLR model. The DLRN could serve as a practical predictive tool, capable of distinguishing between benign and malignant sacral tumors, offering valuable information for risk counseling, and aiding in clinical treatment decisions.

Automatic Melanoma Skin Cancer Detection and Segmentation using Snakecut Algorithm

Early detection of melanoma skin cancer is crucial for effective treatment, and computer-aided diagnostic technologies offer promising advancements for dermatologists to make faster, more precise diagnoses of skin lesions. Segmenting skin lesions is a crucial first step towards automated Computer-Aided Diagnosis for skin cancer. This paper aims to use SnakeCut, a foreground extraction approach, to automatically segment skin lesions in HSV color space with little human interaction. Active contour (otherwise called Snake) and Improved GrabCut are the two popular methods. By decreasing the energy function of the related contour, the active contour acts as a deformable segmentation contour. Improved GrabCut uses updated iterated graph cuts to store color attributes used as segmentation signals in order to achieve foreground segmentation from close-by pixel similarities in its foreground segmentation algorithm. The proposed integrated solution, which is predicated on a probabilistic framework, is termed “SnakeCut.” We removed the outer black border using preprocessing. Later feature extraction is done using HOG and HSV and classifies the benign or melanoma state using Naïve Bayes, Decision tree, and K-nearest neighbor classifiers. The efficiency of the segmentation strategy was measured using the Jaccard Index. We compared the classification results of our method with existing state-of-the-art approaches. The study demonstrates the efficacy of Automatic SnakeCut in accurately segmenting skin lesions, thereby enhancing the performance of subsequent classification tasks. The average F-score was 0.75 on the 2017 ISIC challenge training dataset of 100 images. Compared to other methods, this study’s findings reveal that the suggested method is highly accurate.

Ultrasound super resolution imaging for accurate uterus tumor detection and malignancy prediction

The term ‘tumor’ describes an atypical development of cells that forms a mass inside an organ; depending on the organ's invasive nature and propensity for metastasis, the growth may be benign or malignant. Improving patient outcomes requires the early detection of malignant tumors. Despite its lower resolution and noise problems, ultrasound, which is frequently used to diagnose uterine tumors, is safer and more economical than magnetic resonance imaging (MRI) scans and biopsies. Ultrasound pictures can be processed using methods including denoising, enhancement, segmentation, and feature extraction to get around these restrictions and boost their quality. Enhanced ultrasound images can reach even higher accuracy, cementing them as plausible alternatives to MRI. A comparative analysis of copious relevant image de-speckling, image enhancement, segmentation, and feature extraction methods are carried out. Higher resolution and superior quality, strong segmented real-time ultrasound uterus tumour images are produced by using diffusion-based hybrid filters, Super Resolution Convolutional Neural Networks (SRCNN), and U-net segmentation technique. The Grey Level Co-occurrence Matrix (GLCM) and Discrete Wavelet Transform (DWT) are used to extract textural features. With the help of several machine learning approaches, such as Support Vector Machine (SVM), K-Nearest Neighbour (KNN), and Random Forest classifiers (RFC), the extracted characteristics are immediately sent to classifiers to classify uterus tumours from ultrasound images between benign and malignant. For the categorization of uterine tumors, the RFC classifier outperformed the other classifiers. The viability of cancer detection using ultrasound pictures is significantly strengthened by the suggested machine learning methodology. Multiple hospitals provided data on ultrasound pictures of uterine tumors, which were used to develop the model and obtain the prediction findings. A radiologist with 17 years of expertise in diagnostic radiology further assessed this dataset. We could produce high-quality ultrasonic real-time images of uterine tumor datasets with the suggested machine learning model at a 97.8 % accuracy rate utilizing RFC.

Improved Kepler Optimization Algorithm for enhanced feature selection in liver disease classification

Liver diseases represent a significant healthcare challenge, impacting millions globally and posing complexities in diagnosis. To address this global health concern, this paper introduces a groundbreaking enhancement to the Kepler Optimization Algorithm, termed I-KOA, designed specifically for feature selection in high-dimensional datasets. By harnessing the synergies of Opposition-Based Learning and a Local Escaping Operator grounded in the k-nearest Neighbor (kNN) classifier, I-KOA asserts itself as a potent tool for local exploitation, balanced exploration, and evasion of local optima. To our knowledge, this is the first work to exploit KOA as a feature selection method. Pioneering the utilization of KOA as a feature selection method, the paper rigorously tests I-KOA in two extensive experiments, tackling the complex CEC’22 benchmark suite functions and the intricate landscape of five liver disease datasets. Results underscore I-KOA’s unparalleled performance, validated through the Friedman test, where it surpasses seven rival optimization algorithms. Achieving an outstanding overall classification accuracy of 93.46%, Feature selection size of 0.1042, sensitivity of 97.46%, precision of 94.37%, and F1-score of 90.35% across the liver disease datasets, I-KOA’s randomized algorithm ensures robust feature selection, striking a compelling balance between subset size and classification efficacy. Acknowledging computational demands and generalization nuances, I-KOA is a formidable tool ready to revolutionize medical diagnosis and decision support systems. The open source codes of the proposed I-KOA are available at https://www.mathworks.com/matlabcentral/fileexchange/161376-improved-kepler-optimization-algorithm.

Comparative Analysis Of Machine Learning And Deep Learning Models Integrated With Altman Z-Score For Financial Distress Prediction In Companies Listed On The Indonesia Stock Exchange (IDX)

Financial distress is a condition in which a company experiences a decline in its financial situation, which is typically temporary. However, financial distress can worsen if not promptly addressed, leading to bankruptcy. Early identification of potential financial distress in a company is crucial for stakeholders such as investors, creditors, and regulators. In practice, predicting financial distress in a company is not an easy task. One of the methods commonly used to identify early symptoms of financial distress is the method introduced by Altman in 1986. Altman's research model, known as the Z-Score, determines a value based on standard calculations of financial ratios to indicate the likelihood of a company experiencing bankruptcy. The use of artificial intelligence, such as deep learning, can enhance the scope of research on the analysis and prediction of financial distress. This study aims to conduct a comparative analysis of machine learning models, such as the K-Nearest Neighbor Classifier and Random Forest Classifier, and deep learning models, such as Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN). This analysis is carried out to evaluate the success rate of the proposed deep learning models in predicting financial distress in companies operating in Indonesia. Based on the conducted research, the K-Nearest Neighbor Classifier algorithm achieved an accuracy of 77.42% during testing and 88.89% during validation, the Random Forest Classifier algorithm achieved an accuracy of 87.09% during testing and 95.24% during validation, the CNN model achieved an accuracy of 95.16% during testing and 96.83% during validation, and the RNN model achieved an accuracy of 93.55% during testing and 96.83% during validation. Based on these results, the deep learning method has a higher average success rate than machine learning models in predicting financial distress.

Elderly Signature Identification Using HOG Method and K-Nearest Neighbors Classifier

Signature is used to legally approve an agreement, treaty, and state administrative activities. Identification of the signature is needed to ensure the ownership of a signature so that things do not happen that harm the owner of the signature, such as forgery. In this study, the authors identified signatures for people over 50 years of age. The obtained signature is scanned to produce a signature image, the image is pre-processed so that it is ready for feature extraction that can characterize the signature image. The HOG method is used to perform feature extraction to produce a dataset that has 4,536 feature vectors for each signature image. The K-NN classification method is used to identify the signature image, the highest accuracy is obtained when using the value of K = 3, 4 which is 98.6%. The value of K = 7, 8, 10 obtained the lowest accuracy value of 96%. The decrease in accuracy from the highest to the lowest which is not significant shows that the dataset from feature extraction using the HOG method can characterize one signature ownership with other signatures quite well. The HOG method obtains a large feature vector for each signature, so it is recommended to optimize the feature extraction to reduce the feature size and speed up computing.

Energy optimization for wireless sensor network using minimum redundancy maximum relevance feature selection and classification techniques

In wireless sensor networks (WSN), conserving energy is usually a basic issue, and several approaches are applied to optimize energy consumption. In this article, we adopt feature selection approaches by using minimum redundancy maximum relevance (MRMR) as a feature selection technique to minimize the number of sensors thereby conserving energy. MRMR ranks the sensors according to their significance. The selected features are then classified by different types of classifiers; SVM with linear kernel classifier, naïve Bayes classifier, and k-nearest neighbors classifier (KNN) to compare accuracy values. The simulation results illustrated an improvement in the lifetime extension factor of sensors and showed that the KNN classifier gives better results than the naïve Bayes and SVM classifier.

Bacterial Disease Detection of Cherry Plant Using Deep Features

Although the cherry plant is widely grown in the world and Turkey, it is a fruit tree that is difficult to grow and maintain. It can be exposed to various pesticide diseases, especially during fruiting. Today, approaches based on expert reviews and analyses are used for the identification of these diseases. In addition, cherry producers are trying to detect diseases with their knowledge based on experience. Computer-aided agricultural analysis systems are also being developed depending on the rapid developments in technology. These systems help to monitor all processes from planting, cultivation, and harvesting of agricultural products and to make decisions to grow the products healthily. One of the most important issues to be detected and monitored with these systems is plant diseases. The features of the cherry plant disease will be determined by using a pre-trained convolutional neural network (CNN) model which is DarkNet-19, within the scope of this study. These machine learning-based features have been used for the detection of bacteria-based diseases commonly seen on the leaves of cherry plants. The acquired features are classified with Linear Discriminant Analysis, K-Nearest Neighbor, and Support Vector Machine classifiers to solve the multi-class problem including diseased (less and very) and healthy plants. The experimental results show that a success rate of 88.1% was obtained in the detection of the disease.

Enhancing gastric cancer early detection: A multi-verse optimized feature selection model with crossover-information feedback

Gastric cancer (GC), an acknowledged malignant neoplasm, threatens life and digestive system functionality if not detected and addressed promptly in its nascent stages. The indispensability of early detection for GC to augment treatment efficacy and survival prospects forms the crux of this investigation. Our study introduces an innovative wrapper-based feature selection methodology, referred to as bCIFMVO-FKNN-FS, which integrates a crossover-information feedback multi-verse optimizer (CIFMVO) with the fuzzy k-nearest neighbors (FKNN) classifier. The primary goal of this initiative is to develop an advanced screening model designed to accelerate the identification of patients with early-stage GC. Initially, the capability of CIFMVO is validated through its application to the IEEE CEC benchmark functions, during which its optimization efficiency is measured against eleven cutting-edge algorithms across various dimensionalities—10, 30, 50, and 100. Subsequent application of the bCIFMVO-FKNN-FS model to the clinical data of 1632 individuals from Wenzhou Central Hospital—diagnosed with either early-stage GC or chronic gastritis—demonstrates the model's formidable predictive accuracy (83.395%) and sensitivity (87.538%). Concurrently, this investigation delineates age, gender, serum gastrin-17, serum pepsinogen I, and the serum pepsinogen I to serum pepsinogen II ratio as parameters significantly associated with early-stage GC. These insights not only validate the efficacy of our proposed model in the early screening of GC but also contribute substantively to the corpus of knowledge facilitating early diagnosis.

The Impact of Device Type Number on IoT Device Classification

Today, connected systems are widely used with the recent developments in technology. The internet- connected devices create data traffic when communicating with each other. These data may contain extremely confidential information. Observers can obtain confidential information from the traffic when the security of this traffic cannot be adequately ensured. This confidential information can be personal information as well as information about the type of device used by the person. Even if the traffic is en- crypted, the attacker can obtain information about these devices using machine learning algorithms. This paper presents the importance of the effect of device type number for the classification of IoT devices. Therefore, inference attacks on privacy with machine learning algorithms, attacks on machine learning models, and the padding method that is commonly used against such attacks are presented. Moreover, experiments are carried out by using the dataset of the traffic generated by the Internet of Things (IoT) devices. For this purpose, Random Forest, Decision Tree, and k-Nearest Neighbors (k-NN) classification algorithms are compared and the accuracy rate changes according to the number of devices are presented. According to the results, the Random Forest and Decision Tree algorithms found to be more effective than the k-NN algorithm.

Application of interpretable machine learning algorithms to predict acute kidney injury in patients with cerebral infarction in ICU

BackgroundAcute kidney injury (AKI) is not only a complication but also a serious threat to patients with cerebral infarction (CI). This study aimed to explore the application of interpretable machine learning algorithms in predicting AKI in patients with cerebral infarction. MethodsThe study included 3920 patients with CI admitted to the Intensive Care Unit and Emergency Medicine of the Central Hospital of Lishui City, Zhejiang Province. Nine machine learning techniques, including XGBoost, logistics, LightGBM, random forest (RF), AdaBoost, GaussianNB (GNB), Multi-Layer Perceptron (MLP), support vector machine (SVM), and k-nearest neighbors (KNN) classification, were used to develop a predictive model for AKI in these patients. SHapley Additive exPlanations (SHAP) analysis provided visual explanations for each patient. Finally, model effectiveness was assessed using metrics such as average precision (AP), sensitivity, specificity, accuracy, F1 score, precision-recall (PR) curve, calibration plot, and decision curve analysis (DCA). ResultsThe XGBoost model performed better in the internal validation set and the external validation set, with an AUC of 0.940 and 0.887, respectively. The five most important variables in the model were, in order, glomerular filtration rate, low-density lipoprotein, total cholesterol, hemiplegia and serum kalium. ConclusionThis study demonstrates the potential of interpretable machine learning algorithms in predicting CI patients with AKI.

Human Scream Detection and Analysis to Control Crime Rate using Machine Learning

Public safety is significantly hampered by delayed police response due to a lack of accurate and timely information about crimes. Human scream detection using audio classification offers a promising solution. This work presents a novel three- phase scream detection system leveraging a K-Nearest Neighbors (KNN) classifier and a Multilayer Perceptron (MLP) model. The system first separates human distress sounds from back- ground noise using MFCC features and KNN. Subsequently, it differentiates screams from shouts within the distress category using another KNN classifier. Finally, the classified screams trigger emergency notifications sent to the police station via the Twilio library. Our proposed system offers a robust and layered approach to scream detection, potentially enhancing response times and improving public safety. Index Terms—MFCCs, KNN, Multilayer perceptron model, Scream Detection.

An efficient dynamic migration and consolidation method of VMs based on improved K-nearest neighbor algorithm and attribute weighting

Virtual machine (VM) consolidation and migration that only consider current workload can result in excessive unnecessary migrations. To address this issue, a VM consolidation algorithm based on resource utilization prediction is proposed. An improved K-nearest neighbor (KNN) classification algorithm weighted by attribute inconsistency is proposed to predict the workload of both the host and the VMs. Firstly, two distributions are partitioned according to the neighboring relationship for comparing consistency. Then, an inconsistency evaluation function based on earth mover’s distance (EMD) is designed to measure the inconsistency between the neighboring sample set of each sample under each attribute and the equivalent partition refined by the decision attribute. Finally, the inconsistency level of the neighboring samples is transformed into the importance of the corresponding attribute to implement the attribute weighting KNN classifier. When selecting the source host and target host for VM migration, both current and predicted overloads are considered to avoid unnecessary VM migrations. Simulation tests were performed with random and realistic workloads, and the results show that the proposed method can reduce the overall energy consumption of the host, while also reducing service level agreement (SLA) violations and VM migration.

Artificial multi-verse optimisation for predicting the effect of ideological and political theory course

Enhancing teaching sufficiency is crucial because low teaching efficiency has always been a widespread issue in ideological and political theory course. Evaluating data on the course is obtained from a freshmen class of 2022 using questionnaires. The data is organised and condensed for mining and analysis. Subsequently, an intelligent artificial multi-verse optimizer (AMVO) method s developed to predict the effect of ideological and political theory course. The proposed AMVO approach was tested against various cutting-edge algorithms to demonstrate its effectiveness and stability on the benchmark functions. The experimental results indicated that AMVO ranked first among the 23 test functions. Furthermore, the binary AMVO enhanced k-nearest neighbour classifier had excellent performance in the art ideological and political theory course in terms of error rate, accuracy, specificity and sensitivity. This model can predict the overall evaluation attitude of freshmen towards the course based on the dataset. In addition, we can further analyse the potential correlations between factors that enhance the intellectual and political content of the course. This model can further refine the evaluation of ideological and political courses by teachers and students in our school, thereby achieving the fundamental goal of moral cultivation.

Comparative Analysis of Support Vector Machine, Random Forest and k-Nearest Neighbor Classifiers for Predicting Remaining Usage Life of Roller Bearings

Comparative Analysis of Support Vector Machine, Random Forest and k-Nearest Neighbor Classifiers for Predicting Remaining Usage Life of Roller Bearings