mlsanityData to 7 Oct 2026

LimeSoDa: A Dataset Collection for Benchmarking of Machine Learning Regressors in Digital Soil Mapping

arXiv 2502.20139 ↗First posted 27 Feb 2025cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Digital soil mapping (DSM) relies on a broad pool of statistical methods, yet determining the optimal method for a given context remains challenging and contentious. Benchmarking studies on multiple datasets are needed to reveal strengths and limitations of commonly used methods. Existing DSM studies usually rely on a single dataset with restricted access, leading to incomplete and potentially misleading conclusions. To address these issues, we introduce an open-access dataset collection called Precision Liming Soil Datasets (LimeSoDa). LimeSoDa consists of 31 field- and farm-scale datasets from various countries. Each dataset has three target soil properties: (1) soil organic matter or soil organic carbon, (2) clay content and (3) pH, alongside a set of features. Features are dataset-specific and were obtained by optical spectroscopy, proximal- and remote soil sensing. All datasets were aligned to a tabular format and are ready-to-use for modeling. We demonstrated the use of LimeSoDa for benchmarking by comparing the predictive performance of four learning algorithms across all datasets. This comparison included multiple linear regression (MLR), support vector regression (SVR), categorical boosting (CatBoost) and random forest (RF). The results showed that although no single algorithm was universally superior, certain algorithms performed better in specific contexts. MLR and SVR performed better on high-dimensional spectral datasets, likely due to better compatibility with principal components. In contrast, CatBoost and RF exhibited considerably better performances when applied to datasets with a moderate number (< 20) of features. These benchmarking results illustrate that the performance of a method is highly context-dependent. LimeSoDa therefore provides an important resource for improving the development and evaluation of statistical methods in DSM.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 10 of its 73 references that are in the map. First posted on arXiv 27 Feb 2025.

Builds on

10 of 73 references.

References · 10

  1. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
  2. 2021Tabular Data: Deep Learning is Not All You Needcited by 530
  3. 2020Improving Reproducibility in Machine Learning Research (A Report from the NeurIPS 2019 Reproducibility Program)cited by 318
  4. 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 218
  5. 2022Why do tree-based models still outperform deep learning on tabular data?cited by 198
  6. 2015ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and Rcited by 171
  7. 2022Leakage and the Reproducibility Crisis in ML-based Sciencecited by 63
  8. 2021Over-optimism in benchmark studies and the multiplicity of design and analysis options when interpreting their resultscited by 15
  9. 2024A Comprehensive Benchmark of Machine and Deep Learning Across Diverse Tabular Datasetscited by 13
  10. 2024An Efficient Model-Agnostic Approach for Uncertainty Estimation in Data-Restricted Pedometric Applicationscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.