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.

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.

Study on Chironomid Larvae Recognition Based on DWT and Improved KNN

A chironomid larvae images recognition method based on wavelet energy feature and improved KNN is developed. Wavelet decomposition and color information entropy are selected to construct vectors for KNN that is used to classify of the images. The distance function is modified according to the weight determined by the correlation degree between feature and class, which effectively improves classification accuracy. The result shows the mean accuracy of classification rate is up to 95.41% for freshwater plankton images, such as chironomid larvae, cyclops and harpacticoida.

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 KNN-based two-step fuzzy clustering weighted algorithm for WLAN indoor positioning

Although k-nearest neighbors （KNN） is a popular fingerprint match algorithm for its simplicity and accuracy, because it is sensitive to the circumstances, a fuzzy c-means （FCM） clustering algorithm is applied to improve it. Thus, a KNN-based two-step FCM weighted （KTFW） algorithm for indoor positioning in wireless local area networks （WLAN） is presented in this paper. In KTFW algorithm, k reference points （RPs） chosen by KNN are clustered through FCM based on received signal strength （RSS） and location coordinates. The right clusters are chosen according to rules, so three sets of RPs are formed including the set of k RPs chosen by KNN and are given different weights. RPs supposed to have better contribution to positioning accuracy are given larger weights to improve the positioning accuracy. Simulation results indicate that KTFW generally outperforms KNN and its complexity is greatly reduced through providing initial clustering centers for FCM.

面向非平衡类问题的k近邻分类算法

针对k近邻(k NN)方法不能很好地解决非平衡类问题,提出一种新的面向非平衡类问题的k近邻分类算法。与传统k近邻方法不同,在学习阶段,该算法首先使用划分算法(如K-Means)将多数类数据集划分为多个簇,然后将每个簇与少数类数据集合并成一个新的训练集用于训练一个k近邻模型,即该算法构建了一个包含多个k近邻模型的分类器库。在预测阶段,使用划分算法(如K-Means)从分类器库中选择一个模型用于预测样本类别。通过这种方法,提出的算法有效地保证了k近邻模型既能有效发现数据局部特征,又能充分考虑数据的非平衡性对分类器性能的影响。另外,该算法也有效地提升了k近邻的预测效率。为了进一步提高该算法的性能,将合成少数类过抽样技术(SMOTE)应用到该算法中。KEEL数据集上的实验结果表明,即使对采用随机划分策略划分的多数类数据集,所提算法也能有效地提高k近邻方法在评价指标recall、g-mean、f-measure和AUC上的泛化性能;另外,过抽样技术能进一步提高该算法在非平衡类问题上的性能,并明显优于其他高级非平衡类处理方法。

基于GPU的K-近邻算法实现

K-近邻计算在数据集规模较大时计算复杂度较高,因此,利用图形处理器(GPU)强大的并行计算能力对K-近邻算法进行加速。在分析现有K-近邻算法的基础上,针对该算法时间开销过大的问题,结合GPU的体系结构特征实现基于GPU的K-近邻算法。利用全局存储器的合并访问特性,提高GPU全局存储器访问数据的效率,通过事先过滤数据的方法来减少参与排序的数据量,进而减少排序阶段的线程串行化时间。在KDD,Poker,Covertype 3个数据集上进行实验,结果表明,该实现方法在距离计算阶段每秒执行的浮点运算次数为266.37×109次,而排序阶段为26.47×109次,优于已有方法。

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

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

Metabonomic analysis of hepatitis B virus-induced liver failure:identification of potential diagnostic biomarkers by fuzzy support vector machine

Hepatitis B virus （HBV）-induced liver failure is an emergent liver disease leading to high mortality. The severity of liver failure may be reflected by the profile of some metabolites. This study assessed the potential of using metabolites as biomarkers for liver failure by identifying metabolites with good discriminative performance for its phenotype. The serum samples from 24 HBV-indueed liver failure patients and 23 healthy volunteers were collected and analyzed by gas chromatography-mass spectrometry （GC-MS） to generate metabolite profiles. The 24 patients were further grouped into two classes according to the severity of liver failure. Twenty-five eommensal peaks in all metabolite profiles were extracted, and the relative area values of these peaks were used as features for each sample. Three algorithms, F-test, k-nearest neighbor （KNN） and fuzzy support vector machine （FSVM） combined with exhaustive search （ES）, were employed to identify a subset of metabolites （biomarkers） that best predict liver failure. Based on the achieved experimental dataset, 93.62% predictive accuracy by 6 features was selected with FSVM-ES and three key metabolites, glyeerie acid, cis-aeonitie acid and citric acid, are identified as potential diagnostic biomarkers.

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.

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.

LF-CNN:Deep Learning-Guided Small Sample Target Detection for Remote Sensing Classification

Target detection of small samples with a complex background is always difficult in the classification of remote sensing images.We propose a new small sample target detection method combining local features and a convolutional neural network(LF-CNN)with the aim of detecting small numbers of unevenly distributed ground object targets in remote sensing images.The k-nearest neighbor method is used to construct the local neighborhood of each point and the local neighborhoods of the features are extracted one by one from the convolution layer.All the local features are aggregated by maximum pooling to obtain global feature representation.The classification probability of each category is then calculated and classified using the scaled expected linear units function and the full connection layer.The experimental results show that the proposed LF-CNN method has a high accuracy of target detection and classification for hyperspectral imager remote sensing data under the condition of small samples.Despite drawbacks in both time and complexity,the proposed LF-CNN method can more effectively integrate the local features of ground object samples and improve the accuracy of target identification and detection in small samples of remote sensing images than traditional target detection methods.

基于问题驱动和能力导向的“计算思维与算法设计基础”课程教学实践探索

结合湖南中医药大学教学实践,分析“计算思维与算法设计基础”课程教学现状、教学方法,详细阐述问题驱动式教学法在课程中的应用实践,包括教学设计、教学实施等,分析存在的问题并提出建议。