An $$L_2$$ regularization reduced quadratic surface support vector machine model

IF 1.1 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Combinatorial Optimization Pub Date : 2025-02-18 DOI:10.1007/s10878-024-01250-7
Jiguang Wang, Fangfang Guo, Jie Shen
{"title":"An $$L_2$$ regularization reduced quadratic surface support vector machine model","authors":"Jiguang Wang, Fangfang Guo, Jie Shen","doi":"10.1007/s10878-024-01250-7","DOIUrl":null,"url":null,"abstract":"<p>In this paper, a reduced quadratic surface support vector machine (RQSSVM) classification model is proposed and solved using the augmented Lagrange method. The new model can effectively handle nonlinearly separable data without kernel function selection and parameter tuning due to its quadratic surface segmentation facility. Meanwhile, the maximum margin term is replaced by an <span>\\(L_2\\)</span> regularization term and the Hessian of the quadratic surface is reduced to a diagonal matrix. This simplification significantly reduces the number of decision variables and improves computational efficiency. The <span>\\(L_1\\)</span> loss function is used to transform the problem into a convex composite optimization problem. Then the transformed problem is solved by the Augmented Lagrange method and the non-smoothness of the subproblems is handled by the semi-smooth Newton algorithm. Numerical experiments on artificial and public benchmark datasets show that RQSSVM model not only inherits the superior performance of quadratic surface SVM for segmenting nonlinear surfaces, but also significantly improves the segmentation speed and efficiency.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"13 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01250-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a reduced quadratic surface support vector machine (RQSSVM) classification model is proposed and solved using the augmented Lagrange method. The new model can effectively handle nonlinearly separable data without kernel function selection and parameter tuning due to its quadratic surface segmentation facility. Meanwhile, the maximum margin term is replaced by an \(L_2\) regularization term and the Hessian of the quadratic surface is reduced to a diagonal matrix. This simplification significantly reduces the number of decision variables and improves computational efficiency. The \(L_1\) loss function is used to transform the problem into a convex composite optimization problem. Then the transformed problem is solved by the Augmented Lagrange method and the non-smoothness of the subproblems is handled by the semi-smooth Newton algorithm. Numerical experiments on artificial and public benchmark datasets show that RQSSVM model not only inherits the superior performance of quadratic surface SVM for segmenting nonlinear surfaces, but also significantly improves the segmentation speed and efficiency.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一个$$L_2$$正则化简化二次曲面支持向量机模型
本文提出了一种简化二次曲面支持向量机(RQSSVM)分类模型,并采用增广拉格朗日方法进行了求解。由于该模型具有二次曲面分割功能,可以有效地处理非线性可分数据,而无需进行核函数选择和参数调整。同时,将最大边界项替换为\(L_2\)正则化项,将二次曲面的Hessian简化为对角矩阵。这种简化大大减少了决策变量的数量,提高了计算效率。利用\(L_1\)损失函数将该问题转化为凸复合优化问题。然后用增广拉格朗日法求解变换问题,用半光滑牛顿算法处理子问题的非光滑性。在人工和公共基准数据集上的数值实验表明,RQSSVM模型不仅继承了二次曲面支持向量机分割非线性曲面的优越性能,而且显著提高了分割速度和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
期刊最新文献
Federated edge intelligence for secure and adaptive routing in IoT: a GRU–RL based framework Maximum alternating clean balanced cycle decomposition and applications in rearrangement distance problems Online dispatching and routing for automated guided vehicles in pickup and delivery systems on loop-based graphs Optimal due date assignment in a single machine group technology scheduling environment with learning effect The complexity of distance-r dominating set reconfiguration
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1