A greedy neighborhood-search algorithm for identifying breakpoints in piecewise polynomial regression claims higher accuracy than existing methods on synthetic and real data while also selecting the optimal breakpoint count.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved identification of breakpoints in piecewise regression and its applications
A greedy neighborhood-search algorithm for identifying breakpoints in piecewise polynomial regression claims higher accuracy than existing methods on synthetic and real data while also selecting the optimal breakpoint count.