面对大规模数据集的数据驱动稳健优化:增量学习法

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Computational Science Pub Date : 2024-09-21 DOI:10.1016/j.jocs.2024.102432
{"title":"面对大规模数据集的数据驱动稳健优化:增量学习法","authors":"","doi":"10.1016/j.jocs.2024.102432","DOIUrl":null,"url":null,"abstract":"<div><div>One of the most significant current discussions in optimization under deep uncertainty is integrating machine learning and data science into robust optimization, which has led to the emergence of a new field called Data-Driven Robust Optimization (DDRO). When creating data-driven uncertainty sets, it considers a dataset’s complexity, hidden information, and inherent form. One of the more practical machine learning algorithms for creating data-driven uncertainty sets is support vector clustering (SVC). This algorithm has no prerequisites for preliminary information to generate uncertainty sets with arbitrary geometry. More scenarios can reduce risk when developing SVC-based uncertainty sets. However, the lack of a systematic way to manage the large number of these scenarios hinders the employment of SVC. This paper puts forward an incremental learning algorithm based on support vector clustering, called Incremental Support Vector Clustering (ISVC), to construct an uncertainty set incrementally and efficiently using large datasets. This approach’s novelty and main contributions include incrementally constructing uncertainty sets and dynamic management of outliers. In order to update the temporarily stored Bounded Support Vectors (BSV) and identify outliers, the idea of BSV-archive is offered, where the revision-and-recycle operation is tailored to do just that. As a result, some of the newly acquired information is preserved. Experiments on large-scale datasets demonstrate that the proposed ISVC approach can create an uncertainty set comparable to that of an SVC-based method while using significantly less time.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1000,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data-driven robust optimization in the face of large-scale datasets: An incremental learning approach\",\"authors\":\"\",\"doi\":\"10.1016/j.jocs.2024.102432\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>One of the most significant current discussions in optimization under deep uncertainty is integrating machine learning and data science into robust optimization, which has led to the emergence of a new field called Data-Driven Robust Optimization (DDRO). When creating data-driven uncertainty sets, it considers a dataset’s complexity, hidden information, and inherent form. One of the more practical machine learning algorithms for creating data-driven uncertainty sets is support vector clustering (SVC). This algorithm has no prerequisites for preliminary information to generate uncertainty sets with arbitrary geometry. More scenarios can reduce risk when developing SVC-based uncertainty sets. However, the lack of a systematic way to manage the large number of these scenarios hinders the employment of SVC. This paper puts forward an incremental learning algorithm based on support vector clustering, called Incremental Support Vector Clustering (ISVC), to construct an uncertainty set incrementally and efficiently using large datasets. This approach’s novelty and main contributions include incrementally constructing uncertainty sets and dynamic management of outliers. In order to update the temporarily stored Bounded Support Vectors (BSV) and identify outliers, the idea of BSV-archive is offered, where the revision-and-recycle operation is tailored to do just that. As a result, some of the newly acquired information is preserved. Experiments on large-scale datasets demonstrate that the proposed ISVC approach can create an uncertainty set comparable to that of an SVC-based method while using significantly less time.</div></div>\",\"PeriodicalId\":48907,\"journal\":{\"name\":\"Journal of Computational Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1877750324002254\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877750324002254","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

在深度不确定性条件下的优化方面,当前最重要的讨论之一是将机器学习和数据科学整合到稳健优化中,这导致了一个名为数据驱动稳健优化(DDRO)的新领域的出现。在创建数据驱动的不确定性集时,它要考虑数据集的复杂性、隐藏信息和固有形式。支持向量聚类(SVC)是用于创建数据驱动不确定性集的较为实用的机器学习算法之一。这种算法对初步信息没有先决条件,可以生成任意几何形状的不确定集合。在开发基于 SVC 的不确定性集时,更多的场景可以降低风险。然而,由于缺乏系统的方法来管理这些大量的情景,SVC 的应用受到了阻碍。本文提出了一种基于支持向量聚类的增量学习算法,称为增量支持向量聚类(ISVC),利用大型数据集增量、高效地构建不确定度集。这种方法的新颖性和主要贡献包括增量构建不确定集和动态管理异常值。为了更新临时存储的有界支持向量(BSV)并识别离群值,我们提出了 BSV 存档的想法,其中的修订和循环操作正是为实现这一目的而量身定制的。因此,一些新获取的信息得以保留。在大规模数据集上进行的实验表明,所提出的 ISVC 方法可以创建一个与基于 SVC 方法相当的不确定性集,而所用时间却大大减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Data-driven robust optimization in the face of large-scale datasets: An incremental learning approach
One of the most significant current discussions in optimization under deep uncertainty is integrating machine learning and data science into robust optimization, which has led to the emergence of a new field called Data-Driven Robust Optimization (DDRO). When creating data-driven uncertainty sets, it considers a dataset’s complexity, hidden information, and inherent form. One of the more practical machine learning algorithms for creating data-driven uncertainty sets is support vector clustering (SVC). This algorithm has no prerequisites for preliminary information to generate uncertainty sets with arbitrary geometry. More scenarios can reduce risk when developing SVC-based uncertainty sets. However, the lack of a systematic way to manage the large number of these scenarios hinders the employment of SVC. This paper puts forward an incremental learning algorithm based on support vector clustering, called Incremental Support Vector Clustering (ISVC), to construct an uncertainty set incrementally and efficiently using large datasets. This approach’s novelty and main contributions include incrementally constructing uncertainty sets and dynamic management of outliers. In order to update the temporarily stored Bounded Support Vectors (BSV) and identify outliers, the idea of BSV-archive is offered, where the revision-and-recycle operation is tailored to do just that. As a result, some of the newly acquired information is preserved. Experiments on large-scale datasets demonstrate that the proposed ISVC approach can create an uncertainty set comparable to that of an SVC-based method while using significantly less time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computational Science
Journal of Computational Science COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
5.50
自引率
3.00%
发文量
227
审稿时长
41 days
期刊介绍: Computational Science is a rapidly growing multi- and interdisciplinary field that uses advanced computing and data analysis to understand and solve complex problems. It has reached a level of predictive capability that now firmly complements the traditional pillars of experimentation and theory. The recent advances in experimental techniques such as detectors, on-line sensor networks and high-resolution imaging techniques, have opened up new windows into physical and biological processes at many levels of detail. The resulting data explosion allows for detailed data driven modeling and simulation. This new discipline in science combines computational thinking, modern computational methods, devices and collateral technologies to address problems far beyond the scope of traditional numerical methods. Computational science typically unifies three distinct elements: • Modeling, Algorithms and Simulations (e.g. numerical and non-numerical, discrete and continuous); • Software developed to solve science (e.g., biological, physical, and social), engineering, medicine, and humanities problems; • Computer and information science that develops and optimizes the advanced system hardware, software, networking, and data management components (e.g. problem solving environments).
期刊最新文献
AFF-BPL: An adaptive feature fusion technique for the diagnosis of autism spectrum disorder using Bat-PSO-LSTM based framework Data-driven robust optimization in the face of large-scale datasets: An incremental learning approach VEGF-ERCNN: A deep learning-based model for prediction of vascular endothelial growth factor using ensemble residual CNN A new space–time localized meshless method based on coupling radial and polynomial basis functions for solving singularly perturbed nonlinear Burgers’ equation Implementation of the emulator-based component analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1