L_(1)-Smooth SVM with Distributed Adaptive Proximal Stochastic Gradient Descent with Momentum for Fast Brain Tumor Detection

Brain tumors come in various types,each with distinct characteristics and treatment approaches,making manual detection a time-consuming and potentially ambiguous process.Brain tumor detection is a valuable tool for gaining a deeper understanding of tumors and improving treatment outcomes.Machine learning models have become key players in automating brain tumor detection.Gradient descent methods are the mainstream algorithms for solving machine learning models.In this paper,we propose a novel distributed proximal stochastic gradient descent approach to solve the L_(1)-Smooth Support Vector Machine(SVM)classifier for brain tumor detection.Firstly,the smooth hinge loss is introduced to be used as the loss function of SVM.It avoids the issue of nondifferentiability at the zero point encountered by the traditional hinge loss function during gradient descent optimization.Secondly,the L_(1) regularization method is employed to sparsify features and enhance the robustness of the model.Finally,adaptive proximal stochastic gradient descent(PGD)with momentum,and distributed adaptive PGDwithmomentum(DPGD)are proposed and applied to the L_(1)-Smooth SVM.Distributed computing is crucial in large-scale data analysis,with its value manifested in extending algorithms to distributed clusters,thus enabling more efficient processing ofmassive amounts of data.The DPGD algorithm leverages Spark,enabling full utilization of the computer’s multi-core resources.Due to its sparsity induced by L_(1) regularization on parameters,it exhibits significantly accelerated convergence speed.From the perspective of loss reduction,DPGD converges faster than PGD.The experimental results show that adaptive PGD withmomentumand its variants have achieved cutting-edge accuracy and efficiency in brain tumor detection.Frompre-trained models,both the PGD andDPGD outperform other models,boasting an accuracy of 95.21%.

Fault diagnosis model based on multi-manifold learning and PSO-SVM for machinery

Fault diagnosis technology plays an important role in the industries due to the emergency fault of a machine could bring the heavy lost for the people and the company. A fault diagnosis model based on multi-manifold learning and particle swarm optimization support vector machine(PSO-SVM) is studied. This fault diagnosis model is used for a rolling bearing experimental of three kinds faults. The results are verified that this model based on multi-manifold learning and PSO-SVM is good at the fault sensitive features acquisition with effective accuracy.

A Fast Algorithm for Support Vector Clustering

Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets.

基于UMAP改进的多域特征提取方法及轴承故障诊断

针对传统多域特征提取方法占用计算资源过大、分类精度不足等问题,提出了一种基于统一流行逼近与投影算法(UMAP)改进的多域特征提取方法。通过对原始信号进行多域特征采集结合UMAP的全局信息提取能力进行信息融合与低维映射重构特征集;在此基础上将特征集输入到支持向量机中进行模型训练,实现轴承的故障识别与诊断。基于某大学公开的滚动轴承实验数据集对比分析了几种典型的优化算法与传统多域特征提取方法,证明所提方法识别滚动轴承故障状态的成功率为100%,验证了该方法的优越性。

基于最大间隔和流形假设的半监督学习算法

半监督学习是一种介于监督学习和无监督学习之间的弱监督学习模式,其在学习过程中将少量标记示例和大量未标记示例结合起来构建模型,以期取得比监督学习仅使用标记示例更高的学习精度。在该学习模式下,文中提出了一种将最大间隔准则和示例空间的流形假设思想相结合的半监督学习算法。该算法在利用示例流形结构估计未标记示例标记置信度的同时利用最大间隔准则构建分类模型,并采用交叉优化方法以迭代的方式交替地求解分类模型参数和标记置信度。在12个UCI数据集和4个由MNIST手写数字集生成的数据集上的实验结果表明,采用半监督直推学习方式,该算法的性能优于其他对比算法的情况为60.5%;采用半监督归纳学习方式,该算法的性能优于其他对比算法的情况为42.6%。

Proximal SVM在脑功能分类中的应用研究

为了研究PSVM分类器用于脑功能识别的有效性与优越性,对脑功能识别做出了深入的研究和分析。采用三名受试者在睁眼和闭眼状态下的脑电实测数据,从不同角度深入分析和比较了PSVM分类器与标准SVM分类器的性能,主要衡量指标为识别率和训练时间。结果PSVM分类器优于标准SVM分类器之处在于,在保证识别率的同时,计算速度有了显著地提高。并且随着样本维数的增加,PSVM分类器的计算速度并没有下降。PSVM用于脑电信号功能识别是高效率的,这对今后的有实时要求的脑功能分类识别问题具有重要意义。

Analysis of loss functions in support vector machines

Support vector machines(SVMs)are a kind of important machine learning methods generated by the cross interaction of statistical theory and optimization,and have been extensively applied into text categorization,disease diagnosis,face detection and so on.The loss function is the core research content of SVM,and its variational properties play an important role in the analysis of optimality conditions,the design of optimization algorithms,the representation of support vectors and the research of dual problems.This paper summarizes and analyzes the 0-1 loss function and its eighteen popular surrogate loss functions in SVM,and gives three variational properties of these loss functions:subdifferential,proximal operator and Fenchel conjugate,where the nine proximal operators and fifteen Fenchel conjugates are given by this paper.

基于半监督MPSVM的电力系统暂态稳定评估

半监督学习可借助有标签和部分无标签样本数据来构建电网暂态稳定评估模型,有效利用输入样本数据,可提高电网暂态稳定评估准确率,为此提出基于半监督近似流形支持向量机(manifold proximal support vector machine,MPSVM)的暂态稳定评估方法。首先,在MPSVM的正则项中引入判别变量,可最大限度捕捉样本数据内部的几何信息,并通过最大距离理论表征电力系统稳定类和不稳定类之间的差异,进而转化为求解特征值问题;然后,采用贝叶斯非线性分层模型确定最优参数,可进一步提高评估准确率;最后,采用IEEE 39标准系统和鞍山电网的仿真分析验证所提评估模型的有效性和准确性。

Sparse Proximal Support Vector Machine with a Specialized Interior-Point Method

Support vector machine(SVM)is a widely used method for classification.Proximal support vector machine(PSVM)is an extension of SVM and a promisingmethod to lead to a fast and simple algorithm for generating a classifier.Motivated by the fast computational efforts of PSVM and the properties of sparse solution yielded by l1-norm,in this paper,we first propose a PSVM with a cardinality constraint which is eventually relaxed byl1-norm and leads to a trade-offl1−l2 regularized sparse PSVM.Next we convert thisl1−l2 regularized sparse PSVM into an equivalent form of1 regularized least squares(LS)and solve it by a specialized interior-point method proposed by Kim et al.(J SelTop Signal Process 12:1932–4553,2007).Finally,l1−l2 regularized sparse PSVM is illustrated by means of a real-world dataset taken from the University of California,Irvine Machine Learning Repository(UCI Repository).Moreover,we compare the numerical results with the existing models such as generalized eigenvalue proximal SVM(GEPSVM),PSVM,and SVM-Light.The numerical results showthat thel1−l2 regularized sparsePSVMachieves not only better accuracy rate of classification than those of GEPSVM,PSVM,and SVM-Light,but also a sparser classifier compared with the1-PSVM.

Consensus Proximal Support Vector Machine for Classification Problems with Sparse Solutions

Classification problem is the central problem in machine learning.Support vector machines(SVMs)are supervised learning models with associated learning algorithms and are used for classification in machine learning.In this paper,we establish two consensus proximal support vector machines(PSVMs)models,based on methods for binary classification.The first one is to separate the objective functions into individual convex functions by using the number of the sample points of the training set.The constraints contain two types of the equations with global variables and local variables corresponding to the consensus points and sample points,respectively.To get more sparse solutions,the second one is l1–l2 consensus PSVMs in which the objective function contains an■1-norm term and an■2-norm term which is responsible for the good classification performance while■1-norm term plays an important role in finding the sparse solutions.Two consensus PSVMs are solved by the alternating direction method of multipliers.Furthermore,they are implemented by the real-world data taken from the University of California,Irvine Machine Learning Repository(UCI Repository)and are compared with the existed models such as■1-PSVM,■p-PSVM,GEPSVM,PSVM,and SVM-light.Numerical results show that our models outperform others with the classification accuracy and the sparse solutions.

Semi-Supervised Learning Based on Manifold in BCI

A Laplacian support vector machine （LapSVM） algorithm, a semi-supervised learning based on manifold, is introduced to brain-computer interface （BCI） to raise the classification precision and reduce the subjects＇ training complexity. The data are collected from three subjects in a three-task mental imagery experiment. LapSVM and transductive SVM （TSVM） are trained with a few labeled samples and a large number of unlabeled samples. The results confirm that LapSVM has a much better classification than TSVM.

Forecasting of Stock Returns by Using Manifold Wavelet Support Vector Machine

An admissible manifold wavelet kernel is proposed to construct manifold wavelet support vector machine(MWSVM) for stock returns forecasting.The manifold wavelet kernel is obtained by incorporating manifold theory into wavelet technique in support vector machine(SVM).Since manifold wavelet function can yield features that describe of the stock time series both at various locations and at varying time granularities,the MWSVM can approximate arbitrary nonlinear functions and forecast stock returns accurately.The applicability and validity of MWSVM for stock returns forecasting is confirmed through experiments on real-world stock data.

平滑支持向量模型预测控制集气管压力

集气管的是炼焦制气的重要组成部分,保持集气管压力的稳定,可以提高炼焦制气的效率,降低炼焦制气中产生的气体对环境的污染。随着数据挖掘理论在工业中的应用,支持向量机(The Support Vector Machine SVM)在集气管压力的控制上取得了良好的效果,但其在处理非线性的数据方面的效果并不显著,为了解决这个问题,这里提出了一种平滑支持向量机模型,这是一个具有数据采集、数据平滑与非线性逼近功能相统一的系统模型,利用平滑度对数据进行噪声处理,将平滑处理过的数据用于回归模型的预测控制。这里提出的方法,对唐山某钢铁企业的实际数据进行实验仿真,结果表明,平滑支持向量模型对集气管压力的控制均方根误差较小,控制效果显著。

一种求解二阶常微分方程近似解的P-SVM方法

微分方程的计算求解在计算机工程上有重要的理论意义和应用价值。针对传统数值解法计算复杂度高、解的形式离散等问题,本文基于微分方程的回归方程观点与解法,应用统计回归方法求解二阶常微分方程,并给出基于中心支持向量机(proximal support vector machine,P-SVM)在常微分方程的初值和边值问题上的近似解求法。通过在目标优化函数中添加偏置项,构建P-SVM回归模型,从而避免大规模求解线性方程组,得到结构简洁的最优解表达式。模型通过最小化训练样本点的均方误差和,在保证精度的同时,有效提高了近似解的计算速度。此外,形式简洁固定的解析解表达式也便于在实际应用中进行定性分析和性质研究。数值试验结果验证了P-SVM方法是一种高效可行的常微分方程求解方法。

中心支持向量机的改进及其在地源热泵系统提高防冻剂传热能力的应用

为有针对性地解决地源热泵系统中防冻剂传热能力的问题,对现有中心支持向量机进行了改进研究,构建了加权中心支持向量机模型。并通过对地源热泵系统常用防冻剂传热能力的分析研究,给出了应用加权中心支持向量机对地源热泵系统混合防冻剂传热能力分类的新方法。

Intuitionistic Fuzzy Laplacian Twin Support Vector Machine for Semi-supervised Classification

In general,data contain noises which come from faulty instruments,flawed measurements or faulty communication.Learning with data in the context of classification or regression is inevitably affected by noises in the data.In order to remove or greatly reduce the impact of noises,we introduce the ideas of fuzzy membership functions and the Laplacian twin support vector machine(Lap-TSVM).A formulation of the linear intuitionistic fuzzy Laplacian twin support vector machine(IFLap-TSVM)is presented.Moreover,we extend the linear IFLap-TSVM to the nonlinear case by kernel function.The proposed IFLap-TSVM resolves the negative impact of noises and outliers by using fuzzy membership functions and is a more accurate reasonable classi-fier by using the geometric distribution information of labeled data and unlabeled data based on manifold regularization.Experiments with constructed artificial datasets,several UCI benchmark datasets and MNIST dataset show that the IFLap-TSVM has better classification accuracy than other state-of-the-art twin support vector machine(TSVM),intuitionistic fuzzy twin support vector machine(IFTSVM)and Lap-TSVM.

基于核主元分析和邻近支持向量机的汽轮机凝汽器过程监控和故障诊断

提出了基于核主元分析(KPCA)和邻近支持向量机(PSVM)的汽轮机凝汽器过程监控和故障诊断新方法,将数据先用核主元法进行分析和处理,即通过非线性变换将样本数据从输入空间映射到高维特征空间,然后在高维特征空间中进行特征提取,若数据的Hotelling’sT2和Q统计量超过控制限,说明有故障发生,则计算样本的非线性主元得分向量,并将其作为输入值送入已训练好的邻近支持向量机进行故障类型识别。该方法可以有效地捕捉变量间的非线性关系,过程监控和故障诊断效果明显好于PCA-PSVM法。汽轮机历史故障特征数据集仿真试验证明了该方法的有效性。

基于局部图嵌入加权罚SVM的模拟电路故障诊断方法

针对传统支持向量机(SVM)在模拟电路故障诊断应用中存在的不足,提出一种基于局部图嵌入加权罚支持向量机(LGEWP-SVM)的模拟电路故障诊断新方法。通过在保持数据整体类间间隔最大化的基础上优化数据流形的局部分布,同时在惩罚系数中引入数据的全局分布信息,设计了一种依赖于数据分布的新型支持向量机。该方法有效融合了数据的先验分布信息,增强了算法的抗干扰能力,提高了模型的诊断准确度。实验结果验证了所提方法的有效性。

基于流形学习和最小二乘支持向量机的滚动轴承退化趋势预测

为更好地表征滚动轴承性能退化趋势,提出基于流形学习和最小二乘支持向量机的滚动轴承退化趋势预测新方法。提取振动信号的多域特征组成高维特征集,利用局部保持投影算法(LPP)对多域高维特征集进行维数约简,消除各特征指标之间的冗余、冲突等问题。将维数约简后的特征向量作为最小二乘支持向量机的输入,建立退化趋势预测模型,完成退化趋势预测。运用实测的滚动轴承全寿命实验数据进行检验,结果表明该方法能获得准确的预测结果。

一种新的有监督流形学习方法

提出了一种新的有监督流形学习方法,目的是提供将流形学习降维方法高效应用于有监督学习问题的全新策略.算法的核心思想是集成流形学习方法对高维流形结构数据的降维有效性与支撑向量机(SVM)在中小规模分类数据集上的优良特性实现高效有监督流形学习.算法具体实现步骤为:首先利用SVM在流形学习降维数据中选出对分类决策最重要的数据集,即支撑向量集;按标号返回可得到原空间的支撑向量集;在这个集合上再次使用SVM即可得到原空间的分类决策,从而完成有监督流形学习.在一系列人工与实际数据集上的实验验证了方法的有效性.