Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1360
DC FieldValueLanguage
dc.contributor.authorKartelj, Aleksandaren_US
dc.contributor.authorDjukanović, Markoen_US
dc.date.accessioned2024-10-05T08:45:47Z-
dc.date.available2024-10-05T08:45:47Z-
dc.date.issued2023-12-01-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1360-
dc.descriptionOpen Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. Springer DOI: <a href=" https://doi.org/10.1186/s40537-023-00743-2">10.1186/s40537-023-00743-2</a>en_US
dc.description.abstractIn this paper, we solve the well-known symbolic regression problem that has been intensively studied and has a wide range of applications. To solve it, we propose an efficient metaheuristic-based approach, called RILS-ROLS. RILS-ROLS is based on the following two elements: (i) iterated local search, which is the method backbone, mainly solving combinatorial and some continuous aspects of the problem; (ii) ordinary least squares method, which focuses on the continuous aspect of the search space—it efficiently determines the best—fitting coefficients of linear combinations within solution equations. In addition, we introduce a novel fitness function that combines important model quality measures: R2 score, RMSE score, size of the model (or model complexity), and carefully designed local search, which allows systematic search in proximity to candidate solution. Experiments are conducted on the two well-known ground-truth benchmark sets from literature: Feynman and Strogatz. RILS-ROLS was compared to 14 other competitors from the literature. Our method outperformed all 14 competitors with respect to the symbolic solution rate under varying levels of noise. We observed the robustness of the method with respect to noise, as the symbolic solution rate decreases relatively slowly with increasing noise. Statistical analysis of the obtained experimental results confirmed that RILS-ROLS is a new state-of-the-art method for solving the problem of symbolic regression on datasets whose target variable is modelled as a closed-form equation with allowed operators. In addition to evaluation on known ground-truth datasets, we introduced a new randomly generated set of problem instances. The goal of this set of instances was to test the sensitivity of our method with respect to incremental equation sizes under different levels of noise. We have also proposed a parallelized extension of RILS-ROLS that has proven adequate in solving several very large instances with 1 million records and up to 15 input variables.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofJournal of Big Dataen_US
dc.rightsAttribution 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/us/*
dc.subjectGround-truth benchmark setsen_US
dc.subjectIterated local searchen_US
dc.subjectOrdinary least squaresen_US
dc.subjectSymbolic regressionen_US
dc.titleRILS-ROLS: robust symbolic regression via iterated local search and ordinary least squaresen_US
dc.typeArticleen_US
dc.identifier.doi10.1186/s40537-023-00743-2-
dc.identifier.scopus2-s2.0-85160035997-
dc.identifier.isi000993859600005-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85160035997-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn2196-1115en_US
dc.description.rankM21aen_US
dc.relation.firstpageArticlle no, 71en_US
dc.relation.volume10en_US
dc.relation.issue1en_US
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextopen-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-9839-6039-
Appears in Collections:Research outputs
Files in This Item:
File Description SizeFormat
s40537-023-00743-2.pdf2.81 MBAdobe PDF
View/Open
Show simple item record

SCOPUSTM   
Citations

3
checked on Dec 20, 2024

Page view(s)

16
checked on Dec 24, 2024

Download(s)

1
checked on Dec 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons