PFW: Polygonal Fuzzy Weighted—An SVM Kernel for the Classification of Overlapping Data Groups

Abstract

Support vector machines are supervised learning models which are capable of classifying data and measuring regression by means of a learning algorithm. If data are linearly separable, a conventional linear kernel is used to classify them. Otherwise, the data are normally first transformed from input space to feature space, and then they are classified. However, carrying out this transformation is not always practical, and the process itself increases the cost of training and prediction. To address these problems, this paper puts forward an SVM kernel, called polygonal fuzzy weighted or PFW, which effectively classifies data without space transformation, even if the groups in question are not linearly separable and have overlapping areas. This kernel is based on Gaussian data distribution, standard deviation, the three-sigma rule and a polygonal fuzzy membership function. A comparison of our PFW, radial basis function (RBF) and conventional linear kernels in identical experimental conditions shows that PFW produces a minimum of 26% higher classification accuracy compared with the linear kernel, and it outperforms the RBF kernel in two-thirds of class labels, by a minimum of 3%. Moreover, Since PFW runs within the original feature space, it involves no additional computational cost.

Divergent abiotic spectral pathways unravel pathogen stress signals across species

“…After this trimming step, we retained 5484 olive trees (from 5566 trees) and 3652 almond trees (from 3882 almond trees). Trees were then grouped through CWSI clustering analysis using a modified three-sigma rule 58 . This rule describes the density of a distribution within standard deviation bands on both sides of the mean point into the 68 th , 95 th and 99.7 th percentiles 58 , representing µ ± σ, µ ± 2σ and µ ± 3σ, respectively.…”

“…Trees were then grouped through CWSI clustering analysis using a modified three-sigma rule 58 . This rule describes the density of a distribution within standard deviation bands on both sides of the mean point into the 68 th , 95 th and 99.7 th percentiles 58 , representing µ ± σ, µ ± 2σ and µ ± 3σ, respectively. The first interval defined by the classic three-sigma rule (µ ± σ) represented most trees, while the third interval (µ ± 3σ) consisted of very few trees, raising issues for the determination of statistical significance analysis.…”

Deep Multiscale Soft‐Threshold Support Vector Data Description for Enhanced Heavy‐Duty Gas Turbine Generator Sets’ Anomaly Detection

“…Te distance between the new data points and the center of the hypersphere obtained through the network model was utilized to determine whether the data were anomalous. Additionally, the distance can provide insights into the degree of abnormality in data [31][32][33][34][35][36].…”

A New Bearing Fault Detection Strategy Based on Combined Modes Ensemble Empirical Mode Decomposition, KMAD, and an Enhanced Deconvolution Process

“…In probability and statistics, the three-sigma rule states that approximately 99.73% of data following a normal distribution are located inside a range of three standard deviations from the mean [24].…”