Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.