Diagnosis of Disc Space Variation Fault Degree of Transformer Winding Based on K-Nearest Neighbor Algorithm

Winding is one of themost important components in power transformers.Ensuring the health state of the winding is of great importance to the stable operation of the power system.To efficiently and accurately diagnose the disc space variation(DSV)fault degree of transformer winding,this paper presents a diagnostic method of winding fault based on the K-Nearest Neighbor(KNN)algorithmand the frequency response analysis(FRA)method.First,a laboratory winding model is used,and DSV faults with four different degrees are achieved by changing disc space of the discs in the winding.Then,a series of FRA tests are conducted to obtain the FRA results and set up the FRA dataset.Second,ten different numerical indices are utilized to obtain features of FRA curves of faulted winding.Third,the 10-fold cross-validation method is employed to determine the optimal k-value of KNN.In addition,to improve the accuracy of the KNN model,a comparative analysis is made between the accuracy of the KNN algorithm and k-value under four distance functions.After getting the most appropriate distance metric and kvalue,the fault classificationmodel based on theKNN and FRA is constructed and it is used to classify the degrees of DSV faults.The identification accuracy rate of the proposed model is up to 98.30%.Finally,the performance of the model is presented by comparing with the support vector machine(SVM),SVM optimized by the particle swarmoptimization(PSO-SVM)method,and randomforest(RF).The results show that the diagnosis accuracy of the proposed model is the highest and the model can be used to accurately diagnose the DSV fault degrees of the winding.

Computational Intelligence Prediction Model Integrating Empirical Mode Decomposition,Principal Component Analysis,and Weighted k-Nearest Neighbor

On the basis of machine leaning,suitable algorithms can make advanced time series analysis.This paper proposes a complex k-nearest neighbor(KNN)model for predicting financial time series.This model uses a complex feature extraction process integrating a forward rolling empirical mode decomposition(EMD)for financial time series signal analysis and principal component analysis(PCA)for the dimension reduction.The information-rich features are extracted then input to a weighted KNN classifier where the features are weighted with PCA loading.Finally,prediction is generated via regression on the selected nearest neighbors.The structure of the model as a whole is original.The test results on real historical data sets confirm the effectiveness of the models for predicting the Chinese stock index,an individual stock,and the EUR/USD exchange rate.

Fault Diagnosis in Robot Manipulators Using SVM and KNN

In this paper,Support Vector Machine(SVM)and K-Nearest Neighbor(KNN)based methods are to be applied on fault diagnosis in a robot manipulator.A comparative study between the two classifiers in terms of successfully detecting and isolating the seven classes of sensor faults is considered in this work.For both classifiers,the torque,the position and the speed of the manipulator have been employed as the input vector.However,it is to mention that a large database is needed and used for the training and testing phases.The SVM method used in this paper is based on the Gaussian kernel with the parametersγand the penalty margin parameter“C”,which were adjusted via the PSO algorithm to achieve a maximum accuracy diagnosis.Simulations were carried out on the model of a Selective Compliance Assembly Robot Arm(SCARA)robot manipulator,and the results showed that the Particle Swarm Optimization(PSO)increased the per-formance of the SVM algorithm with the 96.95%accuracy while the KNN algo-rithm achieved a correlation up to 94.62%.These results showed that the SVM algorithm with PSO was more precise than the KNN algorithm when was used in fault diagnosis on a robot manipulator.

Characteristics,classification and KNN-based evaluation of paleokarst carbonate reservoirs:A case study of Feixianguan Formation in northeastern Sichuan Basin,China

The Feixianguan Formation reservoirs in northeastern Sichuan are mainly a suite of carbonate platform deposits.The reservoir types are diverse with high heterogeneity and complex genetic mechanisms.Pores,vugs and fractures of different genetic mechanisms and scales are often developed in association,and it is difficult to classify reservoir types merely based on static data such as outcrop observation,and cores and logging data.In the study,the reservoirs in the Feixianguan Formation are grouped into five types by combining dynamic and static data,that is,karst breccia-residual vuggy type,solution-enhanced vuggy type,fractured-vuggy type,fractured type and matrix type(non-reservoir).Based on conventional logging data,core data and formation microscanner image(FMI)data of the Qilibei block,northeastern Sichuan Basin,the reservoirs are classified in accordance with fracture-vug matching relationship.Based on the principle of cluster analysis,K-Nearest Neighbor(KNN)classification templates are established,and the applicability of the model is verified by using the reservoir data from wells uninvolved in modeling.Following the analysis of the results of reservoir type discrimination and the production of corresponding reservoir intervals,the contributions of various reservoir types to production are evaluated and the reliability of reservoir type classification is verified.The results show that the solution-enhanced vuggy type is of high-quality sweet spot reservoir in the study area with good physical property and high gas production,followed by the fractured-vuggy type,and the fractured and karst breccia-residual vuggy types are the least promising.

基于CEEMD和优化KNN的离心泵故障诊断方法

卧式离心泵实际测量中背景噪声含量较大,故障特征常被淹没,导致机械故障诊断效果较差,为了实时、精准地获得其运行状态,或对其进行故障诊断,提出了一种基于互补集合经验模态分解(CEEMD)和优化最邻近(KNN)算法的卧式离心泵机械故障诊断方法。首先,采集了卧式离心泵机械故障加速度信号,使用CEEMD对信号进行了一次分解,得到了本征模函数(IMF),采用相关系数法得到了IMF相关系数,确定了相关分量与不相关分量;其次,通过改进小波阈值去噪方法对不相关分量进行处理,提取了重构信号可分析的时频故障特征;最后,搭建了离心泵实验台,采用上述故障诊断方法对离心泵机械故障进行了分类诊断。研究结果表明:经CEEMD降噪后,信号评价指标信噪比(SNR)为2.2571,比原来的去噪方法提升了0.4381;优化后KNN分类对于卧式离心泵的机械故障诊断准确率可达96.7%,能够有效识别离心泵故障,达到智能诊断的目的。

Outsmarting Android Malware with Cutting-Edge Feature Engineering and Machine Learning Techniques

The growing usage of Android smartphones has led to a significant rise in incidents of Android malware andprivacy breaches.This escalating security concern necessitates the development of advanced technologies capableof automatically detecting andmitigatingmalicious activities in Android applications(apps).Such technologies arecrucial for safeguarding user data and maintaining the integrity of mobile devices in an increasingly digital world.Current methods employed to detect sensitive data leaks in Android apps are hampered by two major limitationsthey require substantial computational resources and are prone to a high frequency of false positives.This meansthat while attempting to identify security breaches,these methods often consume considerable processing powerand mistakenly flag benign activities as malicious,leading to inefficiencies and reduced reliability in malwaredetection.The proposed approach includes a data preprocessing step that removes duplicate samples,managesunbalanced datasets,corrects inconsistencies,and imputes missing values to ensure data accuracy.The Minimaxmethod is then used to normalize numerical data,followed by feature vector extraction using the Gain ratio andChi-squared test to identify and extract the most significant characteristics using an appropriate prediction model.This study focuses on extracting a subset of attributes best suited for the task and recommending a predictivemodel based on domain expert opinion.The proposed method is evaluated using Drebin and TUANDROMDdatasets containing 15,036 and 4,464 benign and malicious samples,respectively.The empirical result shows thatthe RandomForest(RF)and Support VectorMachine(SVC)classifiers achieved impressive accuracy rates of 98.9%and 98.8%,respectively,in detecting unknown Androidmalware.A sensitivity analysis experiment was also carriedout on all three ML-based classifiers based on MAE,MSE,R2,and sensitivity parameters,resulting in a flawlessperformance for both datasets.This approach has substantial potential for real-world applications and can serve asa valuable tool for preventing the spread of Androidmalware and enhancing mobile device security.

一种改进的kNN方法及其在文本分类中的应用

介绍了基于kNN的文本分类方法 ,分析了kNN方法实质 ,指出了该方法的不足 ,然后提出了一种改进方法。改进方法是基于文本属性关联和概念共现等基础上提出来的。它实质上是强化了文本中语义链属性因子的作用 ,修正了次要因素的噪声影响 ,使文本分类结果更加理想 ,已有的测试结果证明了这一点 ,尤其在测试文本与训练文本集中的某些文本直观上较相似时 。

基于均衡适配迁移的异源域样本轴承故障诊断

由于轴承带标签的故障样本数量较少,且源域数据与目标域数据存在异域问题,会导致轴承诊断准确率大大下降。为此,对异源域样本条件下的轴承故障诊断问题进行了研究,提出了基于改进均衡分布适配迁移学习的轴承故障迭代诊断方法。首先,分析了滚动轴承的结构和不同部位故障的信号特征;介绍了迁移学习工作原理,基于动态的均衡因子,提出了改进均衡分布适配方法,解决了边缘分布和条件分布差异性未知导致的异源域适配难题;然后,给出了基于K近邻算法(KNN)的伪标签初步确定方法,提出了基于迁移学习和KNN算法的目标域伪标签迭代优化方法,确定了目标域样本的故障标签;最后,采用实验数据对该诊断方法的有效性进行了验证,并将其与其他两种方法进行了异域样本的故障诊断,对其诊断准确率进行了对比。研究结果表明:在凯斯西储轴承实验中,基于迁移学习、迁移成分分析(TCA)+KNN的诊断准确率均值分别为93.72%和75.52%;在西安交通大学轴承实验中,基于迁移学习、TCA+KNN的诊断准确率分别为94.80%和70.40%。上述实验结果验证了基于迁移学习的迭代诊断方法在异源域样本故障诊断中的优越性。

基于交叉小波变换与改进变分模态分解的联合去噪方法

轴承早期的故障信号容易被噪声所淹没,导致其故障特征难以被提取,为此,提出了一种基于交叉小波变换(XWT)与改进变分模态分解(IVMD)联合去噪的信号处理方法。首先,对双通道的原始信号进行了XWT处理,得到了小波相干谱,通过包络谱曲线确定了最佳模态数K;将传统VMD优化为IVMD,利用IVMD将两个通道中峭度值较大的信号分解成为多个固有模态分量(IMFs),再对每个IMF与峭度值较大的信号进行XWT处理;然后,将得到的小波相干谱图与双通道原始信号的小波相干谱图进行了比较,从原始信号中去除了识别出的噪声分量,实现了降噪和故障特征增强的目的;最后,利用K邻近(KNN)算法进行了滚动轴承故障分类,其故障识别率达到了97.51%,与IVMD、VMD-XWT方法相比,该方法故障识别率分别提高了10.83%、4.62%。研究结果表明:该方法可以明显降低噪声干扰,能更好地提取轴承早期的故障信息。

云计算中保护数据隐私的快速多关键词语义排序搜索方案

可搜索加密技术主要解决在云服务器不完全可信的情况下,支持用户在密文上进行搜索.该文提出了一种快速的多关键词语义排序搜索方案.首先,该文首次将域加权评分的概念引入文档的评分当中,对标题、摘要等不同域中的关键词赋予不同的权重加以区分.其次,对检索关键词进行语义拓展,计算语义相似度,将语义相似度、域加权评分和相关度分数三者结合,构造了更加准确的文档索引.然后,针对现有的MRSE(Multi-keyword Ranked Search over Encrypted cloud data)方案效率不高的缺陷,将创建的文档向量分块,生成维数较小的标记向量.通过对文档标记向量和查询标记向量的匹配,有效地过滤了大量的无关文档,减少了计算文档相关度分数和排序的时间,提高了搜索的效率.最后,在加密文档向量时,将文档向量分段,每一段与对应维度的矩阵相乘,使得构建索引的时间减少,进一步提高了方案的效率.理论分析和实验结果表明:该方案实现了快速的多关键词语义模糊排序搜索,在保障数据隐私安全的同时,有效地提高了检索效率,减少了创建索引的时间,并返回更加满足用户需求的排序结果.

一种用于非平衡数据分类的集成学习模型

针对非平衡数据分类问题,提出了一种改进的SVM-KNN分类算法,在此基础上设计了一种集成学习模型。该模型采用限数采样方法对多数类样本进行分割,将分割后的多数类子簇与少数类样本重新组合,利用改进的SVM-KNN分别训练,得到多个基本分类器,对各个基本分类器进行组合。采用该模型对UCI数据集进行实验,结果显示该模型对于非平衡数据分类有较好的效果。

A Memetic Algorithm With Competition for the Capacitated Green Vehicle Routing Problem

In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.

A Two-Stage Vehicle Type Recognition Method Combining the Most Effective Gabor Features

Vehicle type recognition(VTR)is an important research topic due to its significance in intelligent transportation systems.However,recognizing vehicle type on the real-world images is challenging due to the illumination change,partial occlusion under real traffic environment.These difficulties limit the performance of current state-of-art methods,which are typically based on single-stage classification without considering feature availability.To address such difficulties,this paper proposes a two-stage vehicle type recognition method combining the most effective Gabor features.The first stage leverages edge features to classify vehicles by size into big or small via a similarity k-nearest neighbor classifier(SKNNC).Further the more specific vehicle type such as bus,truck,sedan or van is recognized by the second stage classification,which leverages the most effective Gabor features extracted by a set of Gabor wavelet kernels on the partitioned key patches via a kernel sparse representation-based classifier(KSRC).A verification and correction step based on minimum residual analysis is proposed to enhance the reliability of the VTR.To improve VTR efficiency,the most effective Gabor features are selected through gray relational analysis that leverages the correlation between Gabor feature image and the original image.Experimental results demonstrate that the proposed method not only improves the accuracy of VTR but also enhances the recognition robustness to illumination change and partial occlusion.

Accelerated k-nearest neighbors algorithm based on principal component analysis for text categorization

Text categorization is a significant technique to manage the surging text data on the Internet.The k-nearest neighbors(kNN) algorithm is an effective,but not efficient,classification model for text categorization.In this paper,we propose an effective strategy to accelerate the standard kNN,based on a simple principle:usually,near points in space are also near when they are projected into a direction,which means that distant points in the projection direction are also distant in the original space.Using the proposed strategy,most of the irrelevant points can be removed when searching for the k-nearest neighbors of a query point,which greatly decreases the computation cost.Experimental results show that the proposed strategy greatly improves the time performance of the standard kNN,with little degradation in accuracy.Specifically,it is superior in applications that have large and high-dimensional datasets.

Using Deep Learning for Soybean Pest and Disease Classification in Farmland

To accurately identify soybean pests and diseases, in this paper, a kind of deep convolution network model was used to determine whether or not a soybean crop possessed pests and diseases. The proposed deep convolution network could learn the highdimensional feature representation of images by using their depth. An inception module was used to construct a neural network. In the inception module, multiscale convolution kernels were used to extract the distributed characteristics of soybean pests and diseases at different scales and to perform cascade fusion. The model then trained the SoftMax classifier in a uniformed framework. This realized the model of soybean pests and diseases so as to verify the effectiveness of this method. In this study, 800 images of soybean leaf images were taken as the experimental objects. Of these 800 images, 400 were selected for network training, and the remaining 400 images were used for the network test. Furthermore, the classical convolutional neural network was optimized. The accuracies before and after optimization were 96.25% and 95.81%, respectively, in terms of extracting image features. This type of research might be applied to achieve a degree of automation in agricultural field management.

基于改进K-近邻算法的XLPE电缆气隙放电发展阶段识别

对运行工况下的XLPE电缆气隙放电发展阶段进行准确识别,有利于将电缆故障扼杀在萌芽状态,保障电力系统正常运行。该文首先介绍了模拟XLPE电缆气隙放电的试验平台搭建、缺陷模型制作和特征量提取及降维的方法及步骤,基于试验观察和对大量数据样本进行聚类分析,将XLPE电缆气隙放电发展过程分为四个阶段,针对以往XLPE电缆气隙放电阶段识别模型的训练周期长、计算复杂度高和收敛速度慢等问题,该文提出一种经高斯函数加权的改进K-近邻(KNN)分类算法应用于XLPE电缆气隙放电阶段识别。对气隙放电的随机测试样本采用基于二叉树的核函数支持向量机、未改进的K-近邻算法和改进后的K-近邻算法三种算法分别进行了阶段识别。试验结果表明,改进后的K-近邻算法识别正确率高、速度快,处理含噪信号鲁棒性好,相比另两种算法更优。

Detection and recognition of LPI radar signals using visibility graphs

The detection and recognition of radar signals play a critical role in the maintenance of future electronic warfare(EW).So far,however,there are still problems with signal detection and recognition,especially in the low probability of intercept(LPI)radar.This paper explores the usefulness of such an algorithm in the scenario of LPI radar signal detection and recognition based on visibility graphs(VG).More network and feature information can be extracted in the VG two-dimensional space,this algorithm can solve the problem of signal recognition using the autocorrelation function.Wavelet denoising processing is introduced into the signal to be tested,and the denoised signal is converted to the VG domain.Then,the signal detection is performed by using the constant false alarm of the VG average degree.Next,weight the converted graph.Finally,perform feature extraction on the weighted image,and use the feature to complete the recognition.It is testified that the proposed algorithm offers significant improvements,such as robustness to noise,and the detection and recognition accuracy,over the recent researches.

Precipitation Retrieval from Himawari-8 Satellite Infrared Data Based on Dictionary Learning Method and Regular Term Constraint

In this paper,the application of an algorithm for precipitation retrieval based on Himawari-8 (H8) satellite infrared data is studied.Based on GPM precipitation data and H8 Infrared spectrum channel brightness temperature data,corresponding "precipitation field dictionary" and "channel brightness temperature dictionary" are formed.The retrieval of precipitation field based on brightness temperature data is studied through the classification rule of k-nearest neighbor domain (KNN) and regularization constraint.Firstly,the corresponding "dictionary" is constructed according to the training sample database of the matched GPM precipitation data and H8 brightness temperature data.Secondly,according to the fact that precipitation characteristics in small organizations in different storm environments are often repeated,KNN is used to identify the spectral brightness temperature signal of "precipitation" and "non-precipitation" based on "the dictionary".Finally,the precipitation field retrieval is carried out in the precipitation signal "subspace" based on the regular term constraint method.In the process of retrieval,the contribution rate of brightness temperature retrieval of different channels was determined by Bayesian model averaging (BMA) model.The preliminary experimental results based on the "quantitative" evaluation indexes show that the precipitation of H8 retrieval has a good correlation with the GPM truth value,with a small error and similar structure.

Effect of the target positions on the rapid identification of aluminum alloys by using filament-induced breakdown spectroscopy combined with machine learning

Filament-induced breakdown spectroscopy(FIBS)combined with machine learning algorithms was used to identify five aluminum alloys.To study the effect of the distance between focusing lens and target surface on the identification accuracy of aluminum alloys,principal component analysis(PCA)combined with support vector machine(SVM)and Knearest neighbor(KNN)was used.The intensity and intensity ratio of fifteen lines of six elements(Fe,Si,Mg,Cu,Zn,and Mn)in the FIBS spectrum were selected.The distances between the focusing lens and the target surface in the pre-filament,filament,and post-filament were 958 mm,976 mm,and 1000 mm,respectively.The source data set was fifteen spectral line intensity ratios,and the cumulative interpretation rates of PC1,PC2,and PC3 were 97.22%,98.17%,and 95.31%,respectively.The first three PCs obtained by PCA were the input variables of SVM and KNN.The identification accuracy of the different positions of focusing lens and target surface was obtained,and the identification accuracy of SVM and KNN in the filament was 100%and 90%,respectively.The source data set of the filament was obtained by PCA for the first three PCs,which were randomly selected as the training set and test set of SVM and KNN in 3:2.The identification accuracy of SVM and KNN was 97.5%and 92.5%,respectively.The research results can provide a reference for the identification of aluminum alloys by FIBS.

Motion information analysis system based on acceleration signals

A motion information analysis system based on the acceleration data is proposed in this paper,consisting of filtering,feature extraction and classification.The Kalman filter is adopted to eliminate the noise.With the time-domain and frequency-domain analysis,acceleration features like the amplitude,the period and the acceleration region values are obtained.Furthermore,the accuracy of the motion classification is improved by using the k-nearest neighbor （KNN） algorithm.