Skip to main content
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

1,549

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

1,549 results for “benchmarks”

Learn how ShareScore rates datasets ↗
zenodo40/100

Surrogate Modeling Benchmark - Damped Oscillator

<p>This dataset is related to the damped oscillator benchmark case. A detailed description of the benchmark case can be found on the public online community website UQWorld:&nbsp;<a href="https://uqworld.org/t/benchmark-case-damped-oscillator/" target="_blank" rel="noopener">https://uqworld.org/t/benchmark-case-damped-oscillator/</a>.</p> <p>The experimental designs include datasets with 400, 800, 1200, 1600, and 2000 samples, each generated using optimized maximin distance Latin Hypercube Sampling (LHS) with 1000 iterations. Each dataset is replicated 20 times. The validation set contains 100,000 samples generated by Monte Carlo simulation. Each dataset contains input samples and the corresponding computational model responses.</p> <h2>Description of the dataset file</h2> <p>The dataset file includes two variables:</p> <ul> <li><em>ExpDesigns</em>, and</li> <li><em>ValidationSet</em>.</li> </ul> <p>Both variables are Matlab structures with fields <em>X</em>, <em>Y</em>, and <em>nSamples</em>. Variable <em>ExpDesigns</em> is a non-scalar structure sized according to the number of experimental design groups. Each field of&nbsp;<em>X</em> for the i-th element of the struct array contains replicated datasets, forming a matrix of size [number of samples] x [dimensionality] x [number of replications]. Similarly, each field of Y for the i-th element contains replicated computational model responses that correspond to the experimental design of the same replication, sized [number of samples] x [number of model outputs] x [number of replications]. The same structure logic applies to the <em>ValidationSet</em> variable, except it contains only one dataset per benchmark case.</p> <p>The structure can be summarized as follows:</p> <ul> <li>ExpDesigns(i).X(j,k,l) <ul> <li>i: dataset group,</li> <li>j: sample index,</li> <li>k: variable index, and</li> <li>l: replication index.</li> </ul> </li> </ul> <ul> <li>ExpDesigns(i).Y(j,m,l) <ul> <li>i, j, l: same as above,</li> <li>m: computational model output index.</li> </ul> </li> </ul> <ul> <li>ValidationSet.X(j,k) <ul> <li>j, k: same as above.</li> </ul> </li> </ul> <ul> <li>ValidationSet.Y(j,m) <ul> <li>j, m: same as above.</li> </ul> </li> </ul> <h2>Description of benchmarked metamodel competitors</h2> <p>The selection of competitors was based on our experience with meta-modeling and includes various metamodel types: Polynomial Chaos Expansions (PCE), Polynomial Chaos Kriging (PCK), and Kriging. Given that each metamodel has many hyperparameters, we chose the most general settings to address different benchmark case difficulties, including dimensionality, nonlinearity, and non-monotonicity.</p> <p>For <strong>Polynomial Chaos Expansions (PCE)</strong>, we used a polynomial degree and q-norm adaptivity approach. This approach adaptively increases the maximum polynomial degree and truncation q-norm until the estimated leave-one-out error starts increasing. Maximum polynomial interaction terms were limited to 2 due to the memory requirements for large model dimensionality and large experimental designs. We tested three different solvers to calculate the PCE coefficients: Least Angle Regression (LARS), Orthogonal Matching Pursuit (OMP), and Subspace Pursuit (SP).</p> <p><strong>Polynomial Chaos Kriging (PCK)</strong> employs a sequential combination strategy of PCE and Kriging. PCE uses degree adaptivity with a fixed q-norm. The maximum number of interactions is again set to 2 with the LARS solver. Ordinary Kriging is applied using the Mat&eacute;rn-5/2 correlation family, ellipsoidal, and anisotropic correlation function. We used a hybrid genetic algorithm to optimize the hyperparameters.</p> <p>We benchmarked both linear and ordinary <strong>Kriging</strong>, including Mat&eacute;rn-5/2 and Gaussian correlation families and separable and ellipsoidal correlation, resulting in eight different Kriging competitors. The hyperparameters were calculated using a hybrid covariance matrix adaptation-evolution strategy optimization.</p> <p>For further details on the settings, please refer to the competitors.m file and UQLab user manuals:</p> <ul> <li>S. Marelli, N. Luethen, B. Sudret, <a href="https://www.uqlab.com/pce-user-manual">UQLab User Manual &ndash; Polynomial Chaos Expansions</a>, Report UQLab-V2.1-104, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>C. Lataniotis, D. Wicaksono, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/kriging-user-manual">UQLab User Manual &ndash; Kriging (Gaussian Process Modeling)</a>, Report UQLab-V2.1-105, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>R. Schoebi, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/pck-user-manual">UQLab User Manual &ndash; Polynomial Chaos Kriging</a>, Report UQLab-V2.0-109, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2022.</li> </ul> <h2>Description of the results file</h2> <p>The results file contains one variable: <em>Metrics</em>. It is a Matlab structure with fields corresponding to each competitor (currently 12). Each competitor field contains data of type non-scalar struct array. The performance metrics included are RelMSE, RelRMSE, RelMAE, MAPE, Q2, and RelCVErr. Each field of Metrics.(CompetitorName) for the i-th element of the struct array contains metrics corresponding to the replicated dataset and the competitor, structured as follows:</p> <ul> <li>Metrics.(CompetitorName)(i).(MetricName)(l)<br> <ul> <li>i: dataset group,</li> <li>l: replication index.</li> </ul> </li> </ul> <p>The description of the performance measures (metrics) can be found here: <a href="https://uqworld.org/t/metamodel-performance-measures/" target="_blank" rel="noopener">https://uqworld.org/t/metamodel-performance-measures/</a>.</p> <h2>Additional files</h2> <p>We provide files in three languages (MATLAB, Python, and Julia) to showcase how to work with datasets, results, and their visualization. The files are called <em>working_with_datafiles.*</em>&nbsp;(the extension depends on the selected language).</p> <h2>Acknowledgment</h2> <p>This project was supported by the Open Research Data Program of the ETH Board under Grant number EPFL SCR0902285. The calculations were run on the Euler cluster of ETH Z&uuml;rich using the MATLAB-based UQLab software developed at the Chair of Risk, Safety and Uncertainty Quantification of ETH Z&uuml;rich.</p>

opencc-by-4.0Sep 2024View details →
zenodo40/100

Surrogate Modeling Benchmark - Truss model

<p>This dataset is related to the truss model benchmark case. A detailed description of the benchmark case can be found on the public online community website UQWorld:&nbsp;<a href="https://uqworld.org/t/benchmark-case-truss-model/" target="_blank" rel="noopener">https://uqworld.org/t/benchmark-case-truss-model/</a>.</p> <p>The experimental designs include datasets with 100, 200, 300, 400, and 500 samples, each generated using optimized maximin distance Latin Hypercube Sampling (LHS) with 1000 iterations. Each dataset is replicated 20 times. The validation set contains 100,000 samples generated by Monte Carlo simulation. Each dataset contains input samples and the corresponding computational model responses.</p> <h2>Description of the dataset file</h2> <p>The dataset file includes two variables:</p> <ul> <li><em>ExpDesigns</em>, and</li> <li><em>ValidationSet</em>.</li> </ul> <p>Both variables are Matlab structures with fields <em>X</em>, <em>Y</em>, and <em>nSamples</em>. Variable <em>ExpDesigns</em> is a non-scalar structure sized according to the number of experimental design groups. Each field of&nbsp;<em>X</em> for the i-th element of the struct array contains replicated datasets, forming a matrix of size [number of samples] x [dimensionality] x [number of replications]. Similarly, each field of Y for the i-th element contains replicated computational model responses that correspond to the experimental design of the same replication, sized [number of samples] x [number of model outputs] x [number of replications]. The same structure logic applies to the <em>ValidationSet</em> variable, except it contains only one dataset per benchmark case.</p> <p>The structure can be summarized as follows:</p> <ul> <li>ExpDesigns(i).X(j,k,l) <ul> <li>i: dataset group,</li> <li>j: sample index,</li> <li>k: variable index, and</li> <li>l: replication index.</li> </ul> </li> </ul> <ul> <li>ExpDesigns(i).Y(j,m,l) <ul> <li>i, j, l: same as above,</li> <li>m: computational model output index.</li> </ul> </li> </ul> <ul> <li>ValidationSet.X(j,k) <ul> <li>j, k: same as above.</li> </ul> </li> </ul> <ul> <li>ValidationSet.Y(j,m) <ul> <li>j, m: same as above.</li> </ul> </li> </ul> <h2>Description of benchmarked metamodel competitors</h2> <p>The selection of competitors was based on our experience with meta-modeling and includes various metamodel types: Polynomial Chaos Expansions (PCE), Polynomial Chaos Kriging (PCK), and Kriging. Given that each metamodel has many hyperparameters, we chose the most general settings to address different benchmark case difficulties, including dimensionality, nonlinearity, and non-monotonicity.</p> <p>For <strong>Polynomial Chaos Expansions (PCE)</strong>, we used a polynomial degree and q-norm adaptivity approach. This approach adaptively increases the maximum polynomial degree and truncation q-norm until the estimated leave-one-out error starts increasing. Maximum polynomial interaction terms were limited to 2 due to the memory requirements for large model dimensionality and large experimental designs. We tested three different solvers to calculate the PCE coefficients: Least Angle Regression (LARS), Orthogonal Matching Pursuit (OMP), and Subspace Pursuit (SP).</p> <p><strong>Polynomial Chaos Kriging (PCK)</strong> employs a sequential combination strategy of PCE and Kriging. PCE uses degree adaptivity with a fixed q-norm. The maximum number of interactions is again set to 2 with the LARS solver. Ordinary Kriging is applied using the Mat&eacute;rn-5/2 correlation family, ellipsoidal, and anisotropic correlation function. We used a hybrid genetic algorithm to optimize the hyperparameters.</p> <p>We benchmarked both linear and ordinary <strong>Kriging</strong>, including Mat&eacute;rn-5/2 and Gaussian correlation families and separable and ellipsoidal correlation, resulting in eight different Kriging competitors. The hyperparameters were calculated using a hybrid covariance matrix adaptation-evolution strategy optimization.</p> <p>For further details on the settings, please refer to the competitors.m file and UQLab user manuals:</p> <ul> <li>S. Marelli, N. Luethen, B. Sudret, <a href="https://www.uqlab.com/pce-user-manual">UQLab User Manual &ndash; Polynomial Chaos Expansions</a>, Report UQLab-V2.1-104, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>C. Lataniotis, D. Wicaksono, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/kriging-user-manual">UQLab User Manual &ndash; Kriging (Gaussian Process Modeling)</a>, Report UQLab-V2.1-105, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>R. Schoebi, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/pck-user-manual">UQLab User Manual &ndash; Polynomial Chaos Kriging</a>, Report UQLab-V2.0-109, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2022.</li> </ul> <h2>Description of the results file</h2> <p>The results file contains one variable: <em>Metrics</em>. It is a Matlab structure with fields corresponding to each competitor (currently 12). Each competitor field contains data of type non-scalar struct array. The performance metrics included are RelMSE, RelRMSE, RelMAE, MAPE, Q2, and RelCVErr. Each field of Metrics.(CompetitorName) for the i-th element of the struct array contains metrics corresponding to the replicated dataset and the competitor, structured as follows:</p> <ul> <li>Metrics.(CompetitorName)(i).(MetricName)(l)<br> <ul> <li>i: dataset group,</li> <li>l: replication index.</li> </ul> </li> </ul> <p>The description of the performance measures (metrics) can be found here: <a href="https://uqworld.org/t/metamodel-performance-measures/" target="_blank" rel="noopener">https://uqworld.org/t/metamodel-performance-measures/</a>.</p> <h2>Additional files</h2> <p>We provide files in three languages (MATLAB, Python, and Julia) to showcase how to work with datasets, results, and their visualization. The files are called <em>working_with_datafiles.*</em>&nbsp;(the extension depends on the selected language).</p> <h2>Acknowledgment</h2> <p>This project was supported by the Open Research Data Program of the ETH Board under Grant number EPFL SCR0902285. The calculations were run on the Euler cluster of ETH Z&uuml;rich using the MATLAB-based UQLab software developed at the Chair of Risk, Safety and Uncertainty Quantification of ETH Z&uuml;rich.</p>

opencc-by-4.0Sep 2024View details →
zenodo40/100

Surrogate Modeling Benchmark - Wing weight function

<p>This dataset is related to the wing weight function benchmark case. A detailed description of the benchmark case can be found on the public online community website UQWorld:&nbsp;<a href="https://uqworld.org/t/benchmark-case-wing-weight-function/" target="_blank" rel="noopener">https://uqworld.org/t/benchmark-case-wing-weight-function/</a>.</p> <p>The experimental designs include datasets with 100, 200, 300, 400, and 500 samples, each generated using optimized maximin distance Latin Hypercube Sampling (LHS) with 1000 iterations. Each dataset is replicated 20 times. The validation set contains 100,000 samples generated by Monte Carlo simulation. Each dataset contains input samples and the corresponding computational model responses.</p> <h2>Description of the dataset file</h2> <p>The dataset file includes two variables:</p> <ul> <li><em>ExpDesigns</em>, and</li> <li><em>ValidationSet</em>.</li> </ul> <p>Both variables are Matlab structures with fields <em>X</em>, <em>Y</em>, and <em>nSamples</em>. Variable <em>ExpDesigns</em> is a non-scalar structure sized according to the number of experimental design groups. Each field of&nbsp;<em>X</em> for the i-th element of the struct array contains replicated datasets, forming a matrix of size [number of samples] x [dimensionality] x [number of replications]. Similarly, each field of Y for the i-th element contains replicated computational model responses that correspond to the experimental design of the same replication, sized [number of samples] x [number of model outputs] x [number of replications]. The same structure logic applies to the <em>ValidationSet</em> variable, except it contains only one dataset per benchmark case.</p> <p>The structure can be summarized as follows:</p> <ul> <li>ExpDesigns(i).X(j,k,l) <ul> <li>i: dataset group,</li> <li>j: sample index,</li> <li>k: variable index, and</li> <li>l: replication index.</li> </ul> </li> </ul> <ul> <li>ExpDesigns(i).Y(j,m,l) <ul> <li>i, j, l: same as above,</li> <li>m: computational model output index.</li> </ul> </li> </ul> <ul> <li>ValidationSet.X(j,k) <ul> <li>j, k: same as above.</li> </ul> </li> </ul> <ul> <li>ValidationSet.Y(j,m) <ul> <li>j, m: same as above.</li> </ul> </li> </ul> <h2>Description of benchmarked metamodel competitors</h2> <p>The selection of competitors was based on our experience with meta-modeling and includes various metamodel types: Polynomial Chaos Expansions (PCE), Polynomial Chaos Kriging (PCK), and Kriging. Given that each metamodel has many hyperparameters, we chose the most general settings to address different benchmark case difficulties, including dimensionality, nonlinearity, and non-monotonicity.</p> <p>For <strong>Polynomial Chaos Expansions (PCE)</strong>, we used a polynomial degree and q-norm adaptivity approach. This approach adaptively increases the maximum polynomial degree and truncation q-norm until the estimated leave-one-out error starts increasing. Maximum polynomial interaction terms were limited to 2 due to the memory requirements for large model dimensionality and large experimental designs. We tested three different solvers to calculate the PCE coefficients: Least Angle Regression (LARS), Orthogonal Matching Pursuit (OMP), and Subspace Pursuit (SP).</p> <p><strong>Polynomial Chaos Kriging (PCK)</strong> employs a sequential combination strategy of PCE and Kriging. PCE uses degree adaptivity with a fixed q-norm. The maximum number of interactions is again set to 2 with the LARS solver. Ordinary Kriging is applied using the Mat&eacute;rn-5/2 correlation family, ellipsoidal, and anisotropic correlation function. We used a hybrid genetic algorithm to optimize the hyperparameters.</p> <p>We benchmarked both linear and ordinary <strong>Kriging</strong>, including Mat&eacute;rn-5/2 and Gaussian correlation families and separable and ellipsoidal correlation, resulting in eight different Kriging competitors. The hyperparameters were calculated using a hybrid covariance matrix adaptation-evolution strategy optimization.</p> <p>For further details on the settings, please refer to the competitors.m file and UQLab user manuals:</p> <ul> <li>S. Marelli, N. Luethen, B. Sudret, <a href="https://www.uqlab.com/pce-user-manual">UQLab User Manual &ndash; Polynomial Chaos Expansions</a>, Report UQLab-V2.1-104, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>C. Lataniotis, D. Wicaksono, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/kriging-user-manual">UQLab User Manual &ndash; Kriging (Gaussian Process Modeling)</a>, Report UQLab-V2.1-105, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>R. Schoebi, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/pck-user-manual">UQLab User Manual &ndash; Polynomial Chaos Kriging</a>, Report UQLab-V2.0-109, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2022.</li> </ul> <h2>Description of the results file</h2> <p>The results file contains one variable: <em>Metrics</em>. It is a Matlab structure with fields corresponding to each competitor (currently 12). Each competitor field contains data of type non-scalar struct array. The performance metrics included are RelMSE, RelRMSE, RelMAE, MAPE, Q2, and RelCVErr. Each field of Metrics.(CompetitorName) for the i-th element of the struct array contains metrics corresponding to the replicated dataset and the competitor, structured as follows:</p> <ul> <li>Metrics.(CompetitorName)(i).(MetricName)(l)<br> <ul> <li>i: dataset group,</li> <li>l: replication index.</li> </ul> </li> </ul> <p>The description of the performance measures (metrics) can be found here: <a href="https://uqworld.org/t/metamodel-performance-measures/" target="_blank" rel="noopener">https://uqworld.org/t/metamodel-performance-measures/</a>.</p> <h2>Additional files</h2> <p>We provide files in three languages (MATLAB, Python, and Julia) to showcase how to work with datasets, results, and their visualization. The files are called <em>working_with_datafiles.*</em>&nbsp;(the extension depends on the selected language).</p> <h2>Acknowledgment</h2> <p>This project was supported by the Open Research Data Program of the ETH Board under Grant number EPFL SCR0902285. The calculations were run on the Euler cluster of ETH Z&uuml;rich using the MATLAB-based UQLab software developed at the Chair of Risk, Safety and Uncertainty Quantification of ETH Z&uuml;rich.</p>

opencc-by-4.0Sep 2024View details →
zenodo40/100

Surrogate Modeling Benchmark - Borehole function

<p>This dataset is related to the Borehole function benchmark case. A detailed description of the benchmark case can be found on the public online community website UQWorld:&nbsp;<a href="https://uqworld.org/t/benchmark-case-borehole-function/">https://uqworld.org/t/benchmark-case-borehole-function/</a>.</p> <p>The experimental designs include datasets with 40, 80, 120, 160, and 200 samples, each generated using optimized maximin distance Latin Hypercube Sampling (LHS) with 1000 iterations. Each dataset is replicated 20 times. The validation set contains 100,000 samples generated by Monte Carlo simulation. Each dataset contains input samples and the corresponding computational model responses.</p> <h2>Description of the dataset file</h2> <p>The dataset file includes two variables:</p> <ul> <li><em>ExpDesigns</em>, and</li> <li><em>ValidationSet</em>.</li> </ul> <p>Both variables are Matlab structures with fields <em>X</em>, <em>Y</em>, and <em>nSamples</em>. Variable <em>ExpDesigns</em> is a non-scalar structure sized according to the number of experimental design groups. Each field of&nbsp;<em>X</em> for the i-th element of the struct array contains replicated datasets, forming a matrix of size [number of samples] x [dimensionality] x [number of replications]. Similarly, each field of Y for the i-th element contains replicated computational model responses that correspond to the experimental design of the same replication, sized [number of samples] x [number of model outputs] x [number of replications]. The same structure logic applies to the <em>ValidationSet</em> variable, except it contains only one dataset per benchmark case.</p> <p>The structure can be summarized as follows:</p> <ul> <li>ExpDesigns(i).X(j,k,l) <ul> <li>i: dataset group,</li> <li>j: sample index,</li> <li>k: variable index, and</li> <li>l: replication index.</li> </ul> </li> </ul> <ul> <li>ExpDesigns(i).Y(j,m,l) <ul> <li>i, j, l: same as above,</li> <li>m: computational model output index.</li> </ul> </li> </ul> <ul> <li>ValidationSet.X(j,k) <ul> <li>j, k: same as above.</li> </ul> </li> </ul> <ul> <li>ValidationSet.Y(j,m) <ul> <li>j, m: same as above.</li> </ul> </li> </ul> <h2>Description of benchmarked metamodel competitors</h2> <p>The selection of competitors was based on our experience with meta-modeling and includes various metamodel types: Polynomial Chaos Expansions (PCE), Polynomial Chaos Kriging (PCK), and Kriging. Given that each metamodel has many hyperparameters, we chose the most general settings to address different benchmark case difficulties, including dimensionality, nonlinearity, and non-monotonicity.</p> <p>For <strong>Polynomial Chaos Expansions (PCE)</strong>, we used a polynomial degree and q-norm adaptivity approach. This approach adaptively increases the maximum polynomial degree and truncation q-norm until the estimated leave-one-out error starts increasing. Maximum polynomial interaction terms were limited to 2 due to the memory requirements for large model dimensionality and large experimental designs. We tested three different solvers to calculate the PCE coefficients: Least Angle Regression (LARS), Orthogonal Matching Pursuit (OMP), and Subspace Pursuit (SP).</p> <p><strong>Polynomial Chaos Kriging (PCK)</strong> employs a sequential combination strategy of PCE and Kriging. PCE uses degree adaptivity with a fixed q-norm. The maximum number of interactions is again set to 2 with the LARS solver. Ordinary Kriging is applied using the Mat&eacute;rn-5/2 correlation family, ellipsoidal, and anisotropic correlation function. We used a hybrid genetic algorithm to optimize the hyperparameters.</p> <p>We benchmarked both linear and ordinary <strong>Kriging</strong>, including Mat&eacute;rn-5/2 and Gaussian correlation families and separable and ellipsoidal correlation, resulting in eight different Kriging competitors. The hyperparameters were calculated using a hybrid covariance matrix adaptation-evolution strategy optimization.</p> <p>For further details on the settings, please refer to the competitors.m file and UQLab user manuals:</p> <ul> <li>S. Marelli, N. Luethen, B. Sudret, <a href="https://www.uqlab.com/pce-user-manual">UQLab User Manual &ndash; Polynomial Chaos Expansions</a>, Report UQLab-V2.1-104, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>C. Lataniotis, D. Wicaksono, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/kriging-user-manual">UQLab User Manual &ndash; Kriging (Gaussian Process Modeling)</a>, Report UQLab-V2.1-105, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>R. Schoebi, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/pck-user-manual">UQLab User Manual &ndash; Polynomial Chaos Kriging</a>, Report UQLab-V2.0-109, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2022.</li> </ul> <h2>Description of the results file</h2> <p>The results file contains one variable: <em>Metrics</em>. It is a Matlab structure with fields corresponding to each competitor (currently 12). Each competitor field contains data of type non-scalar struct array. The performance metrics included are RelMSE, RelRMSE, RelMAE, MAPE, Q2, and RelCVErr. Each field of Metrics.(CompetitorName) for the i-th element of the struct array contains metrics corresponding to the replicated dataset and the competitor, structured as follows:</p> <ul> <li>Metrics.(CompetitorName)(i).(MetricName)(l)<br> <ul> <li>i: dataset group,</li> <li>l: replication index.</li> </ul> </li> </ul> <p>The description of the performance measures (metrics) can be found here: <a href="https://uqworld.org/t/metamodel-performance-measures/" target="_blank" rel="noopener">https://uqworld.org/t/metamodel-performance-measures/</a>.</p> <h2>Additional files</h2> <p>We provide files in three languages (MATLAB, Python, and Julia) to showcase how to work with datasets, results, and their visualization. The files are called <em>working_with_datafiles.*</em>&nbsp;(the extension depends on the selected language).</p> <h2>Acknowledgment</h2> <p>This project was supported by the Open Research Data Program of the ETH Board under Grant number EPFL SCR0902285. The calculations were run on the Euler cluster of ETH Z&uuml;rich using the MATLAB-based UQLab software developed at the Chair of Risk, Safety and Uncertainty Quantification of ETH Z&uuml;rich.</p>

opencc-by-4.0Sep 2024View details →
zenodo40/100

Surrogate Modeling Benchmark - Undamped Oscillator

<p>This dataset is related to the undamped oscillator benchmark case. A detailed description of the benchmark case can be found on the public online community website UQWorld: <a href="https://uqworld.org/t/benchmark-case-undamped-oscillator/" target="_blank" rel="noopener">https://uqworld.org/t/benchmark-case-undamped-oscillator/</a>.</p> <p>The experimental designs include datasets with 40, 80, 120, 160, and 200 samples, each generated using optimized maximin distance Latin Hypercube Sampling (LHS) with 1000 iterations. Each dataset is replicated 20 times. The validation set contains 100,000 samples generated by Monte Carlo simulation. Each dataset contains input samples and the corresponding computational model responses.</p> <h2>Description of the dataset file</h2> <p>The dataset file includes two variables:</p> <ul> <li><em>ExpDesigns</em>, and</li> <li><em>ValidationSet</em>.</li> </ul> <p>Both variables are Matlab structures with fields <em>X</em>, <em>Y</em>, and <em>nSamples</em>. Variable <em>ExpDesigns</em> is a non-scalar structure sized according to the number of experimental design groups. Each field of&nbsp;<em>X</em> for the i-th element of the struct array contains replicated datasets, forming a matrix of size [number of samples] x [dimensionality] x [number of replications]. Similarly, each field of Y for the i-th element contains replicated computational model responses that correspond to the experimental design of the same replication, sized [number of samples] x [number of model outputs] x [number of replications]. The same structure logic applies to the <em>ValidationSet</em> variable, except it contains only one dataset per benchmark case.</p> <p>The structure can be summarized as follows:</p> <ul> <li>ExpDesigns(i).X(j,k,l) <ul> <li>i: dataset group,</li> <li>j: sample index,</li> <li>k: variable index, and</li> <li>l: replication index.</li> </ul> </li> </ul> <ul> <li>ExpDesigns(i).Y(j,m,l) <ul> <li>i, j, l: same as above,</li> <li>m: computational model output index.</li> </ul> </li> </ul> <ul> <li>ValidationSet.X(j,k) <ul> <li>j, k: same as above.</li> </ul> </li> </ul> <ul> <li>ValidationSet.Y(j,m) <ul> <li>j, m: same as above.</li> </ul> </li> </ul> <h2>Description of benchmarked metamodel competitors</h2> <p>The selection of competitors was based on our experience with meta-modeling and includes various metamodel types: Polynomial Chaos Expansions (PCE), Polynomial Chaos Kriging (PCK), and Kriging. Given that each metamodel has many hyperparameters, we chose the most general settings to address different benchmark case difficulties, including dimensionality, nonlinearity, and non-monotonicity.</p> <p>For <strong>Polynomial Chaos Expansions (PCE)</strong>, we used a polynomial degree and q-norm adaptivity approach. This approach adaptively increases the maximum polynomial degree and truncation q-norm until the estimated leave-one-out error starts increasing. Maximum polynomial interaction terms were limited to 2 due to the memory requirements for large model dimensionality and large experimental designs. We tested three different solvers to calculate the PCE coefficients: Least Angle Regression (LARS), Orthogonal Matching Pursuit (OMP), and Subspace Pursuit (SP).</p> <p><strong>Polynomial Chaos Kriging (PCK)</strong> employs a sequential combination strategy of PCE and Kriging. PCE uses degree adaptivity with a fixed q-norm. The maximum number of interactions is again set to 2 with the LARS solver. Ordinary Kriging is applied using the Mat&eacute;rn-5/2 correlation family, ellipsoidal, and anisotropic correlation function. We used a hybrid genetic algorithm to optimize the hyperparameters.</p> <p>We benchmarked both linear and ordinary <strong>Kriging</strong>, including Mat&eacute;rn-5/2 and Gaussian correlation families and separable and ellipsoidal correlation, resulting in eight different Kriging competitors. The hyperparameters were calculated using a hybrid covariance matrix adaptation-evolution strategy optimization.</p> <p>For further details on the settings, please refer to the competitors.m file and UQLab user manuals:</p> <ul> <li>S. Marelli, N. Luethen, B. Sudret, <a href="https://www.uqlab.com/pce-user-manual">UQLab User Manual &ndash; Polynomial Chaos Expansions</a>, Report UQLab-V2.1-104, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>C. Lataniotis, D. Wicaksono, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/kriging-user-manual">UQLab User Manual &ndash; Kriging (Gaussian Process Modeling)</a>, Report UQLab-V2.1-105, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2024.</li> <li>R. Schoebi, S. Marelli, B. Sudret, <a href="https://www.uqlab.com/pck-user-manual">UQLab User Manual &ndash; Polynomial Chaos Kriging</a>, Report UQLab-V2.0-109, Chair of Risk, Safety and Uncertainty Quantification, ETH Zurich, Switzerland, 2022.</li> </ul> <h2>Description of the results file</h2> <p>The results file contains one variable: <em>Metrics</em>. It is a Matlab structure with fields corresponding to each competitor (currently 12). Each competitor field contains data of type non-scalar struct array. The performance metrics included are RelMSE, RelRMSE, RelMAE, MAPE, Q2, and RelCVErr. Each field of Metrics.(CompetitorName) for the i-th element of the struct array contains metrics corresponding to the replicated dataset and the competitor, structured as follows:</p> <ul> <li>Metrics.(CompetitorName)(i).(MetricName)(l)<br> <ul> <li>i: dataset group,</li> <li>l: replication index.</li> </ul> </li> </ul> <p>The description of the performance measures (metrics) can be found here: <a href="https://uqworld.org/t/metamodel-performance-measures/" target="_blank" rel="noopener">https://uqworld.org/t/metamodel-performance-measures/</a>.</p> <h2>Additional files</h2> <p>We provide files in three languages (MATLAB, Python, and Julia) to showcase how to work with datasets, results, and their visualization. The files are called <em>working_with_datafiles.*</em>&nbsp;(the extension depends on the selected language).</p> <h2>Acknowledgment</h2> <p>This project was supported by the Open Research Data Program of the ETH Board under Grant number EPFL SCR0902285. The calculations were run on the Euler cluster of ETH Z&uuml;rich using the MATLAB-based UQLab software developed at the Chair of Risk, Safety and Uncertainty Quantification of ETH Z&uuml;rich.</p>

opencc-by-4.0Sep 2024View details →
zenodo40/100

Residual stress in 316L stainless steel benchmark additively manufactured arches determined by neutron diffraction and snychtron X-ray diffraction

<p>Residual stress data recorded as part of the EASI-STRESS project.&nbsp;</p> <p>The data presented is the residual stress in three orthogonal directions determined by neutron diffraction (SALSA at ILL) and synchrotron X-ray diffraction (P07 and P61A at Desy operated by Hereon and ID15A at ESRF). The data is for residual stress in a benchmark 316L stainless steel arch manufactured by laser powder bed fusion using a MetalFAB1 additive manufacturing machine. The arch is square topped with dimensions of nominally 20 mm in both the x and y direction (in plane). The overhang which creates the arch shape runs parallel to the y direction. The height of the arch is nominally 10 mm with the ligament above the over hang being of 2 mm nominal thickness.&nbsp;</p> <p>Data for two lines is presented: line 1 runs from the centre of the top surface (defined at the origin) down into the arch (defined as positive z direction). Line 2 runs along to the x axis at a depth of 1 mm into the arch.&nbsp;</p> <p>The stress-free reference used was a reference comb cut from an identically made arch.</p> <p>Different gauge volume sizes and shapes were defined at each institution, all measurement locations indicate the centre of the gauge volume during each measurement. gauge volumes were: P07 200 x 200 &micro;m2, ~1.9 mm, P61A 150 &times; 150 &micro;m2 ~2.9 mm, ID15A 200 &acute; 50 &micro;m2 ~1.7 mm, SALSA 0.6 x 0.6 x2 mm3.</p>

opencc-by-4.0Oct 2024View details →
zenodo40/100

As built and post heat treatment residual stresses in 316L stainless steel additively manufactured benchmark arches

<p>The data presented is the residual stress in three orthogonal directions determined by neutron diffraction (SALSA at ILL) and synchrotron X-ray diffraction (P07 and P61A at Desy operated by Hereon). The data is for residual stress in a benchmark 316L stainless steel arches manufactured by laser powder bed fusion using MetalFAB1 and EOS M290 additive manufacturing machines. These arches are square topped with dimensions of nominally 20 mm in both the x and y direction (in plane). The overhang which creates the arch shape runs parallel to the y direction. The height of the arch is nominally 10 mm with the ligament above the over hang being of 2 mm nominal thickness.&nbsp;</p> <p>Data for part in both an as built and after a 700 &deg;C 2 hour heat treatment are presented. The measurement &nbsp;line runs from the centre of the top surface (defined at the origin) down into the arch (defined as positive z direction).</p> <p>The stress-free reference used was a reference comb cut from an identically made arches. For heat treated samples, heat treated combs were used.</p> <p>Different gauge volume sizes and shapes were defined at each institution, all measurement locations indicate the centre of the gauge volume during each measurement. gauge volumes were: P07 200 x 200 &micro;m2, ~1.9 mm, P61A 150 &times; 150 &micro;m2 ~2.9 mm, ID15A 200 x 50 &micro;m2 ~1.7 mm, SALSA 0.6 x 0.6 x2 mm3.</p>

opencc-by-4.0Oct 2024View details →
zenodo40/100

Aberrant gene expression prediction benchmark based on GTEx v8

<p>This repository contains the aberrant gene expression prediction benchmark data as well as the necessary expected gene expression across tissues and tissue-specific isoform contribution scores for AbExp prediction.<br>&nbsp;</p> <p>The aberrant gene expression prediction benchmark data (aberrant_expression_prediction_benchmark.parquet) contains the following columns:</p> <ul> <li>individual: GTEx individual</li> <li>gene: Ensembl gene identifier</li> <li>tissue: GTEx tissue</li> <li>tissue_type: GTEx tissue type</li> <li>mu: OUTRIDER-estimated expected gene expression</li> <li>theta: OUTRIDER-estimated gene dispersion</li> <li>counts: Raw gene expression count</li> <li>normalized_counts: OUTRIDER-normalized gene expression count</li> <li>l2fc: log2 fold change between observed and expected gene expression count</li> <li>zscore: z-score of gene expression, obtained by quantile-mapping the OUTRIDER-estimated distribution to the standard normal distribution</li> <li>nominal_pvalue: OUTRIDER-estimated <em>p</em>-value of being an expression outlier</li> <li>FDR: FDR-adjusted <em>p</em>-value of being an expression outlier</li> <li>is_in_benchmark: Whether this observation is part of the aberrant gene expression prediction benchmark</li> <li>is_underexpressed_outlier: Whether this observation is an underexpression outlier at FDR &lt; 5%. This is the benchmark prediction label.</li> </ul> <p><br>The isoform proportions table (gtex_v8_isoform_proportions.tsv) contains the following columns:</p> <ul> <li>gene: Ensembl gene identifier</li> <li>tissue_type: GTEx tissue type</li> <li>tissue: GTEx tissue</li> <li>transcript: Ensembl transcript identifier</li> <li>mean_transcript_proportions: mean transcript proportions across individuals in GTEx v8</li> <li>median_transcript_proportions: median transcript proportions across individuals in GTEx v8</li> <li>sd_transcript_proportions: standard deviation of transcript proportions across individuals in GTEx v8</li> </ul> <p><br>The expected gene expression table (gtex_v8_expected_expression.tsv) contains the following columns:</p> <ul> <li>gene: Ensembl gene identifier</li> <li>tissue_type: GTEx tissue type</li> <li>tissue: GTEx tissue</li> <li>gene_is_expressed: Whether the gene is expressed in the tissue</li> <li>median_expression: median OUTRIDER-estimated expected gene expression (mu) across individuals</li> <li>expression_dispersion: OUTRIDER-estimated gene dispersion (theta)</li> </ul>

opencc-by-4.0Nov 2023View details →
zenodo40/100

Real-world Optimization Benchmark from Vehicle Dynamics - Data and Code

<p>Data and Code of five 2D single-objective optimization problems from vehicle dynamics design for benchmarking</p> <p>Conference Paper at ECTA Real-world Optimization Benchmark from Vehicle Dynamics: Specification of Problems in 2D and Methodology for Transferring (Meta-)Optimized Algorithm Parameters</p>

opencc-by-4.0Nov 2023View details →
zenodo40/100

RSYD-BASIC results for AMR benchmarking dataset subset (MiSeq data)

<p><strong>Input data:</strong></p> <ul> <li>20240905_test_config.yaml: original config file used to run the pipeline</li> <li>20241004_rsyd_largeset_reads.zip: renamed Illumina MiSeq reads</li> <li>20241011-sample-overview.xlsx: overview of SRR accession numbers to internal sample numbers</li> <li>ILM_Run0001_Y20240904_kts_new.xlsx: runsheet&nbsp;</li> <li>input_en.yaml: column name configuration for the run</li> <li>lis_data.zip: LIS report and bacteria list used for LIS-specific results</li> </ul> <p><strong>Expected results:</strong></p> <ul> <li>20240910_test_illumina_largeset.zip: Results of the RSYD-BASIC pipeline, version 1.15.1, with the reads used</li> </ul>

opencc-by-4.0Oct 2024View details →
zenodo40/100

Loading Stability Benchmark for Pallet Loading Problems

<h3>Description</h3> <p>The dataset contains information about approx. 32.000 pallet loading problem (PLP) cargo layouts derived from a physical simulation with the MSC ADAMS software. The question of the study is to compare and benchmark multiple static stability algorithms: full base support, partial base support, static mechanical equilibrium, and physical simulation. As there are no real-world cargo loading datasets available, we decided to approximate real-world loading. We used a multibody simulator (MSC ADAMS) and simulated cargo loadings for a set of layouts. The benchmark simulation was adjusted in an iterative process, in which we visually tested simulations and incorporated insights from literature about physical cargo properties until we were satisfied with the plausibility of the results. However, the benchmark simulation depends on many parameters that need to be adjusted, and our adjustments might be unprecise. The dataset contains 2 sub-datasets: Dataset 1 is based on the <a href="https://github.com/fbrandt/ACLPP" target="_blank" rel="noopener">ACLPP instances</a> generated by Brandt &amp; Nickel (2019). Dataset 2 is based on the <a href="https://www.sciencedirect.com/science/article/pii/S1568494623011869" target="_blank" rel="noopener">instances</a> from Ali et al. (2024). For every sub-dataset, we assembled three complexity scenarios with four stages. Scenario 1 is the easiest scenario, which assumes all items (boxes) have uniform density and no displaced center of mass (in relation to their geometric center). Scenario 2a moves the CoM now to a random position in the items' dimensions according to a Gaussian distribution around the item's geometric center. Scenario 2b now applies the same procedure as Scenario 2a but employs a uniform distribution.</p> <h3>Stages</h3> <p><strong>Stage 0 ("0_input")</strong> are the raw data from both datasets. We did not include the raw data but provided the link to the dataset in the meta-information here.</p> <p><strong>Stage 1 ("1_AeULDs") </strong>are the input cargo items with itemLabel, weight, (box)-shape with width, height, depth, loading coordinate (x,y,z), sequence, and center of mass (x, y, z). We imposed a cap on the number of items of 20. If a ULD exceeds this threshold, we include only the first 20 items.</p> <p><strong>Stage 2 ("2_AeJobs")</strong> transfers the ULDs to an executable format and includes assessment information (i.e., stability approaches).</p> <p><strong>Stage 3 ("3_AeResults")</strong> are the results from the different static stability algorithms with a uniform static stability score between 0 (first item unstable) and 1 (all items stable) and a runtime.&nbsp;</p> <p><strong>Stage 4 ("4_Benchmark")</strong> are the benchmark data from our multibody simulation. The first folder ("<em>done_raw</em>") is raw output of our ADAMS simulation, which tracks relevant physical characteristics such as angular momentum, angular velocity, acceleration, position, velocity (about the center of mass), translation, rotation, and contact forces with other items. We measured multiple observations per loading sequence, which all have an assigned time step. The total simulation length is 0.3 s. The second folder ("<em>done_intermediate</em>") now filters the raw data, such that we track the largest translation and rotation in x, y, and z- directions per loading step per item. We also calculate the maximal translation and rotation within the simulation. The third folder ("<em>done</em>") transforms the intermediate steps into a final quantified stability outcome, in case any item exceeds the threshold values for translation and rotation. The final outcome is normalized, such that 1 represents a stable cargo layout and 0 represents a layout in which the first item is unstable. Divide the number of stable loading steps by the total number of items in the cargo layout. The fourth folder ("<em>done_sensitivity_analysis</em>") computes the benchmark results for different epsilon_translations and epsilon_rotation values for sensitivity analyses. We filtered the data for the analysis, such that only ULDs with a minimal width, depth, and height of every item are included for the final analysis. Further, we filtered out ULDs that contained less than two items.</p> <p><strong>Stage 5 ("5_Final_results")&nbsp;</strong>contains aggregated results, such as the aggregated number of correct predictions, underestimations, overestimations, and sensitivity analyses results.</p> <h3>Further references</h3> <p>The paper (preprint) describing the study can be found <a href="https://papers.ssrn.com/abstract=4778113" target="_blank" rel="noopener">here</a>. The code for data generation, simulation, and analysis is in the&nbsp;<a href="https://github.com/philippmaz/palletizing_stability_benchmark/" target="_blank" rel="noopener">GitHub Repository</a> (also linked below).</p> <h3>Changelog:</h3> <table> <tbody> <tr> <td><strong>Version</strong></td> <td><strong>Change</strong></td> </tr> <tr> <td>0.0.3</td> <td>This version fixes a bug during item dimension mapping in dataset 2 that made a re-simulation necessary. We imposed a cap on the number of items of 20. If a ULD exceeds this threshold, we include only the first 20 items. For the analysis, we included a minimal item level per ULD of 2. We set the minimal item dimensions to 10 (previously: 15). We removed macOS-specific files from the archive.</td> </tr> </tbody> </table> <p>&nbsp;</p>

opencc-by-4.0May 2024View details →
zenodo40/100

Birdsong NOIZEUS: Bioacoustics noise reduction benchmark dataset

<p>------------------------------------------------------------------------<br>Birdsong noizeus dataset<br>------------------------------------------------------------------------</p> <p>Authors: Tim Sainburg &amp; Asaf Zorea<br>Year: 2024</p> <p>------------------------------------------------------------------------<br>General information<br>------------------------------------------------------------------------<br>- There are 5 recordings from each of 14 individuals (European starlings) recorded in an acoustically isolated chamber.&nbsp;<br>- For each song, we apply noise at 5 SNR levels (0dB, 5dB, 10dB, 15dB).&nbsp;<br>- There are 8 noise types, each taken from a single noise clip from the "Soundscapes from around the world" dataset.<br>- They are "rain", "town", "wind", "waterfall", "insect", "swamp" "frogscape", "forest"<br>- Each soundscape contains multiple noise sources.&nbsp;<br>- Noise levels were estimated using the pyloudnorm software (Steinmetz et al., 2021)<br>- Audio is provided as waveforms at 44100 samplerate</p> <p>------------------------------------------------------------------------<br>Data format<br>------------------------------------------------------------------------</p> <p>- clean<br>&nbsp; &nbsp; - {bird_name}_{timestamp}.wav<br>- noisy<br>&nbsp; &nbsp; - {snr}dB<br>&nbsp; &nbsp; &nbsp; &nbsp; - {bird_name}_{timestamp}_{noise_category}_{snr}.wav<br>- noise_sample<br>&nbsp; &nbsp; - {snr}dB<br>&nbsp; &nbsp; &nbsp; &nbsp; - {bird_name}_{timestamp}_{noise_category}_{snr}.wav</p> <p>`clean` contains the original clean audio.<br>`noisy` contains the song+noise<br>`noise_sample` contains a 1-second sample of noise only.&nbsp;</p> <p>Timestamp is in the format YYYY-MM-DD_HH-MM-SS-MILLISECONDS and refers to the time that the song was recorded.&nbsp;</p> <p>------------------------------------------------------------------------<br>Data sources<br>------------------------------------------------------------------------</p> <p>Birdsong<br>---------<br>Birdsong are acoustically isolated songs from 14 European Starlings<br>https://zenodo.org/records/3237218</p> <p>Citation:&nbsp;<br>Arneodo, Z., Sainburg, T., Jeanne, J., &amp; Gentner, T. (2019). An acoustically isolated European starling song library (Version v1) [Data set]. Zenodo. https://doi.org/10.5281/zenodo.3237218</p> <p>This dataset is available under the following license:<br>- &nbsp;Creative Commons Attribution 4.0 International (https://creativecommons.org/licenses/by/4.0/legalcode)</p> <p><br>Noise<br>-----<br>Noise are taken from the Xeno-canto - "Soundscapes from around the world" dataset<br>https://www.gbif.org/dataset/ff571aeb-46bf-45c4-ad2c-af4d68315765</p> <p>Citation:<br>Vellinga W (2024). Xeno-canto - Soundscapes from around the world. Xeno-canto Foundation for Nature Sounds. Occurrence dataset https://doi.org/10.15468/9u3zaq accessed via GBIF.org on 2024-10-17.</p> <p>We sampled 8 soundscapes from this dataset:<br>&nbsp; &nbsp; 1. Rain https://www.gbif.org/occurrence/4523646364<br>&nbsp; &nbsp; &nbsp; &nbsp; - Virginia<br>&nbsp; &nbsp; &nbsp; &nbsp; - 457s<br>&nbsp; &nbsp; &nbsp; &nbsp; - rain, Recording of the feeders in the backyard with a light rain falling on the leaf litter, while a freight train passes by ~1/2 mile away.<br>&nbsp; &nbsp; 2. Town https://xeno-canto.org/696263<br>&nbsp; &nbsp; &nbsp; &nbsp; - 2:22<br>&nbsp; &nbsp; &nbsp; &nbsp; - &nbsp;the closer habitat are greater trees and coniferes ..smaller bushes ...some other Krautg&auml;rten ... traffic-noise is to hear..as airplanes,too.<br>&nbsp; &nbsp; &nbsp; &nbsp; - insects, birds, bells, traffic?, airplane<br>&nbsp; &nbsp; &nbsp; &nbsp; - Germany<br>&nbsp; &nbsp; 3. Wind https://xeno-canto.org/911773<br>&nbsp; &nbsp; &nbsp; &nbsp; - 5:29<br>&nbsp; &nbsp; &nbsp; &nbsp; - Very windy day, grassland to shrubland habitat<br>&nbsp; &nbsp; &nbsp; &nbsp; - Wisconsin<br>&nbsp; &nbsp; 4. Waterfall https://xeno-canto.org/406993<br>&nbsp; &nbsp; &nbsp; &nbsp; - 24:02<br>&nbsp; &nbsp; &nbsp; &nbsp; - sound scenes captured in a river forest with zarzas, hiedras and other matorrales at the edge of a small waterfall.<br>&nbsp; &nbsp; &nbsp; &nbsp; - Spain<br>&nbsp; &nbsp; 5. Insect https://xeno-canto.org/454914<br>&nbsp; &nbsp; &nbsp; &nbsp; - 5:45<br>&nbsp; &nbsp; &nbsp; &nbsp; - Australia<br>&nbsp; &nbsp; &nbsp; &nbsp; - cicadias, birds,<br>&nbsp; &nbsp; 6. Swanp https://xeno-canto.org/909875<br>&nbsp; &nbsp; &nbsp; &nbsp; - 2:24<br>&nbsp; &nbsp; &nbsp; &nbsp; - Swampy area along dirt road/trail. Species Include: American Bullfrog, Cricket Frogs, American Crow, Prothonotary Warbler, Red-winged Blackbird, Indigo Bunting, Northern Cardinal<br>&nbsp; &nbsp; 7. Frogscape https://xeno-canto.org/718213<br>&nbsp; &nbsp; &nbsp; &nbsp; - 4:42&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; - European Tree Frog Hyla arborea Green Frog Pelophlyax sp.<br>&nbsp; &nbsp; &nbsp; &nbsp; - Austrial&nbsp;<br>&nbsp; &nbsp; 8. Forest https://xeno-canto.org/900744&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; - 3:04<br>&nbsp; &nbsp; &nbsp; &nbsp; - Sweden<br>&nbsp; &nbsp; &nbsp; &nbsp; - A beautiful choir with frogs, toads, geese and ducks to enjoy in the darkness a foggy night.<br>&nbsp; &nbsp; &nbsp; &nbsp;&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp;&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp;&nbsp;<br>All noise recordings have one of the following licensesL<br>- Creative Commons Attribution-NonCommercial-ShareAlike 4.0 (https://creativecommons.org/licenses/by-nc-sa/4.0/)<br>- Creative Commons Attribution-ShareAlike 4.0 (https://creativecommons.org/licenses/by-sa/4.0/)</p> <p><br>Additional information about the noise dataset</p> <p><br>------------------------------------------------------------------------<br>citations<br>------------------------------------------------------------------------</p> <p>Steinmetz, C. J., &amp; Reiss, J. (2021, May). pyloudnorm: A simple yet flexible loudness meter in python. In Audio Engineering Society Convention 150. Audio Engineering Society.</p> <p>Arneodo, Z., Sainburg, T., Jeanne, J., &amp; Gentner, T. (2019). An acoustically isolated European starling song library (Version v1) [Data set]. Zenodo. https://doi.org/10.5281/zenodo.3237218</p> <p>Vellinga W (2024). Xeno-canto - Soundscapes from around the world. Xeno-canto Foundation for Nature Sounds. Occurrence dataset https://doi.org/10.15468/9u3zaq accessed via GBIF.org on 2024-10-17.</p>

opencc-by-nc-4.0Oct 2024View details →
zenodo40/100

Code and data for molecular dating benchmark based on real and simulated Primates gene trees

<p>Benchmark of molecular clock dating applied to single gene trees separately, whose results are described in&nbsp;&ldquo;Factors influencing the accuracy and precision in dating single gene trees&rdquo; by&nbsp;Guillaume Louvel and Hugues Roest Crollius.</p> <ol> <li>Real Primates gene trees are analyzed to identify&nbsp;what characteristics of a gene tree are related to the precision of dating;&nbsp;</li> <li>alignments are also simulated on the&nbsp;tree of Primates to&nbsp;measure the accuracy of dating under controlled parameters such as the degree of rate variation and the length of the alignment.</li> </ol> <p><strong>Content</strong></p> <p><code>Louvel_Accuracy-dating_results_2024.tar.gz</code>:<br>&nbsp;&nbsp;&nbsp; - <code>notebook/</code>: statistical analyses in Python;<br>&nbsp;&nbsp;&nbsp; - <code>outputs/</code>: html reports with figures/tables resulting from the analysis;<br>&nbsp;&nbsp;&nbsp; - <code>lib/</code>: required libraries.<br>&nbsp;&nbsp;&nbsp; - <code>data/</code>: intermediate data needed for the final analysis (dates, gene tree features);</p> <p><code>Louvel_Accuracy-dating_dating-source_2024.tar.gz</code>:<br>&nbsp;&nbsp;&nbsp; - <code>dating-source/</code>: input data and config files necessary to reproduce <code>data</code>;</p> <p><code>Louvel_Accuracy-dating_raw-data-preparation_2024.tar.gz</code>:<br>&nbsp;&nbsp;&nbsp; - <code>raw-data-preparation/</code>: raw data and steps to produce&nbsp;<code>dating-source</code>.<br><br><strong>Requirements</strong><br><br>This code requires the libraries developed in the lab for this project,<br>available at <a href="https://github.com/DyogenIBENS/">github.com/DyogenIBENS/</a>, but also included here in <code>lib/</code>.<br><br>- <a href="https://github.com/DyogenIBENS/Phylorgs">Phylorgs</a><br>- <a href="https://github.com/DyogenIBENS/LibsDyogen_py3">LibsDyogen_py3</a><br>- <a href="https://github.com/DyogenIBENS/ToolsDyogen_py3">ToolsDyogen_py3</a>.</p>

opencc-by-4.0Aug 2023View details →
zenodo40/100

Benchmark instances and models for the Oven Scheduling Problem

<p>This dataset contains benchmark instances for the Oven Scheduling Problem that was introduced by the authors in Lackner, M.-L., Mrkvicka, C., Musliu, N., Walkiewicz, D., Winter, F., <em>Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem</em>. In: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Moreover, MiniZinc models and CP Optimizer models as well as the solutions found for the benchmark set are provided.</p>

opencc-by-4.0Dec 2022View details →
zenodo40/100

Ice Anatomy: A Benchmark Dataset and Methodology for Automatic Ice Boundary Extraction from Radio-Echo Sounding Data

<p>The measurement of ice thickness is of great importance for the accurate estimation of glacier volume and the delineation of their bedrock topography. In particular, this is a crucial factor in forecasting the future evolution of glaciers in the context of a changing climate. In order to derive the ice thickness, the travel time of electromagnetic waves in radargrams acquired by radio-echo sounding (RES) systems is analyzed. This can only be achieved by identifying the ice surface and underlying ice bottom in corresponding radargrams. Manually identifying these two reflection horizons in RES data is a laborious and time-consuming process. Consequently, scientists are attempting to automate this task through the use of techniques such as deep learning. Such automation can significantly reduce the time between a field campaign and the calculation of the glacier's ice thickness distribution. In this paper, we present the first benchmark dataset for delineating the ice surface and bottom boundaries in RES data, to facilitate straightforward comparisons of deep learning models in the future. The ``IceAnatomy'' dataset comprises radargrams and the corresponding manual picks, amounting to a total of over 45,000km of observations. The RES data originates from three sources: FAU, CReSIS, and AWI. The dataset comprises different RES systems as well as different pre-processing methods. In addition, the data was acquired over a large range of geographical and glaciological settings, featuring different thermal regimes present in Antarctica and the Southern Patagonian Icefield. This diversity ensures that the models' behaviors can be analyzed in different scenarios. We define a standardized train-test split for each source in the dataset. This allows us to introduce not only a baseline model trained on the entire training set (the ``omni'' model), but also three source-specific baseline models. The source-specific models are trained exclusively on the subset of the training data acquired by the specified source. The baseline models provide an initial benchmark against which subsequent models can be compared. The source-specific models demonstrate more accurate results than the omni model. For the FAU, CReSIS, and AWI test sets, the source-specific models achieve &nbsp;Mean Meter Errors of 2.1m, 23.1m, and 4.9m for the ice surface and 9.1m, 78.2m, and 29.3m for the ice bottom. In relation to the mean measured ice thickness, these errors equate to 1.2%, 3.1%, and 0.3% for the ice surface and&nbsp; 4.9%, 10.4%, and 1.5% for the ice bottom.</p> <p>&nbsp;</p> <p>&nbsp;For more information, please read the following paper:</p> <p>[Coming soon. Currently under review.]</p> <p>Please also cite this paper if you plan on using the dataset.</p> <p>&nbsp;</p> <p>For the implementation of a baseline model please visit:</p> <p>[Coming soon]</p> <p>&nbsp;</p>

opencc-by-4.0Oct 2024View details →
zenodo40/100

LiDAR Segmentation Benchmark Dataset: La Palma

<p>The purpose of this benchmark dataset is primarily to allow the assessment of individual tree segmentation algorithms on LiDAR data. The high density ULS point cloud data were captured by the Zenmuse L1 sensor on a DJI Matrice 300RTK over a coniferous plot on La Palma (Canary Islands, Spain). The dataset comprises the CHM and the normalized 3D cloud, as well as the fully annotated data to serve as a benchmark for segmentation.</p> <p>The publication associated with this database is:</p> <p>Marcello, J.; Sp&iacute;nola, M.; Albors, L.; Marqu&eacute;s, F.; Rodr&iacute;guez-Esparrag&oacute;n, D.; Eugenio, F. Performance of Individual Tree Segmentation Algorithms in Forest Ecosystems Using UAV LiDAR Data. <em>Drones</em>&nbsp;<strong>2024</strong>,&nbsp;<em>8</em>, 772. https://doi.org/10.3390/drones8120772</p>

opencc-by-4.0Nov 2024View details →
zenodo40/100

WONDERBREAD: A Benchmark + Dataset for Business Process Management (BPM) Tasks

<p><strong>Paper:</strong> <a href="https://arxiv.org/abs/2406.13264">WONDERBREAD: A Benchmark for Evaluating Multimodal Foundation Models on Business Process Management Tasks</a></p> <h2><strong>Background</strong></h2> <p>The&nbsp;<em>WONDERBREAD</em> dataset contains <strong>2,928 human demonstrations</strong> of <strong>598 web navigation workflows</strong> across <strong>6 types of BPM tasks</strong>. These tasks measure the ability of a model to generate accurate documentation, assist in knowledge transfer, and improve the efficiency of workflows.</p> <p>Please see our website for more details:&nbsp;<a href="https://wonderbread.stanford.edu/">https://wonderbread.stanford.edu/</a></p> <h2><strong>Quick Start</strong></h2> <p>To start, download <strong>debug_demos.zip</strong> (1 GB). It contains a subset of <strong>24 demonstrations</strong> which can give you a sense of how the dataset is structured.</p> <p>To reproduce the paper, download <strong>gold_demos.zip</strong> (33 GB). It contains <strong>724 demonstrations</strong> corresponding to the 162 "Gold" tasks which were used for all the evaluations in the original paper.</p> <p>To obtain the full dataset, download&nbsp;<strong>demos.zip</strong> (133 GB). This contains all <strong>2,928 demonstrations</strong> and can be used for training, fine-tuning, and evaluating models.</p> <h2><strong>Dataset Structure</strong></h2> <p>The dataset contains several files, defined below.</p> <ol> <li><strong>Raw Data</strong><em> (useful for training/fine-tuning/evaluation)</em> <ol> <li><strong>debug_demos.zip </strong>(1 GB)<strong> -- </strong>a subset of only 24 demonstrations taken from the full dataset. Useful to get a sense of the dataset and for debugging.</li> <li><strong>gold_demos.zip</strong> (22 GB) -- a subset of only 724 demonstrations corresopnding to the 162 "Gold" tasks. This is the dataset that was used for all evaluations in the original <em>WONDERBREAD</em> paper.</li> <li><strong>demos.zip</strong> (133 GB) -- all 2,928 demonstrations across 598 tasks. Useful for training your own models.</li> </ol> </li> <li><strong>Modality-Specific Subsets of Raw Data </strong><em>(useful for specific types of training/fine-tuning/evaluation)</em><br> <ol> <li><strong>All Demos</strong> <ol> <li><strong>demos_sop_only.zip</strong> (4 MB)-- only the SOP <code>.txt</code> files for all 2,928 demonstrations</li> <li><strong>demos_sop_and_trace_only.zip</strong> (770 MB)-- only the SOP <code>.txt</code> files and action trace <code>.json</code> files for all 2,928 demonstrations</li> <li><strong>demos_sop_and_trace_and_screenshots_only.zip</strong> (22 GB)-- only the SOP <code>.txt</code> files and action trace <code>.json</code> files and screenshot images for all 2,928 demonstrations</li> </ol> </li> <li><strong>"Gold" Demos</strong> <ol> <li><strong>gold_demos_sop_only.zip</strong> (1 MB)-- only the SOP <code>.txt</code> files for the 724 demonstrations in the "Gold" tasks.</li> <li><strong>gold_demos_sop_and_trace_only.zip</strong> (190 MB) -- only the SOP <code>.txt</code> files and action trace&nbsp;<code>.json</code>&nbsp;files for the 724 demonstrations in the "Gold" tasks.</li> <li><strong>gold_demos_sop_and_trace_and_screenshots_only.zip </strong>(6 GB) -- only the SOP <code>.txt</code> files and action trace <code>.json</code> files and screenshot images for the 724 demonstrations in the "Gold" tasks</li> </ol> </li> </ol> </li> <li><strong>Evaluation</strong><em> (useful for evaluation)</em> <ol> <li><strong>qa_dataset.csv -- </strong>contains all 120 questions and ground truth answers used in the "Knowlege Transfer" evaluation.<strong><br></strong></li> <li><strong>df_rankings.csv -- </strong>contains the rankings of all "Gold" tasks used in the "SOP Ranking" evaluation.<strong><br></strong></li> </ol> </li> <li><strong>Metadata</strong><em> (can be safely ignored)</em> <ol> <li><strong>Process Mining Task Demonstrations.xlsx --</strong> maps human annotators to specific demonstrations; also contains "Gold" task rankings used in the "SOP Ranking" evaluation.</li> <li><strong>metadata.json -- </strong>maps Google Drive URLs to Google Drive Folder IDs to demonstration names</li> <li><strong>df_valid.csv -- </strong>tracks assets associated with each demonstration</li> </ol> </li> </ol>

opencc-by-4.0Jun 2024View details →
zenodo40/100

PSB2: The Second Program Synthesis Benchmark Suite

<p><strong>PSB2: The Second Program Synthesis Benchmark Suite Datasets</strong></p> <p>Version 1.0.1 (see version history at bottom)</p> <p>This repository contains datasets for the 25 problems described in the paper <em>PSB2: The Second Program Synthesis Benchmark Suite</em>. These problems come from a variety of sources, and require a range of programming constructs and datatypes to solve. These datasets are designed to be usable for any method of performing general program synthesis, including and not limited to inductive program synthesis and evolutionary methods such as genetic programming.</p> <p>For more information, see the associated website: <a href="https://cs.hamilton.edu/~thelmuth/PSB2/PSB2.html">https://cs.hamilton.edu/~thelmuth/PSB2/PSB2.html</a></p> <p><strong>Use</strong></p> <p>Each problem in the benchmark suite is located in a separate directory in the `datasets` directory.</p> <p>For each problem, we provide a set of `edge` cases and a set of `random` cases. The `edge` cases are hand-chosen cases representing the limits of the problem. The `random` cases are all generated based on problem-specific distributions. For each problem, we included exactly 1 million `random` cases.</p> <p>A typical use of these datasets for a set of runs of program synthesis would be:</p> <ul> <li>For each run, use every `edge` case in the training set</li> <li>For each run, use a different, randomly-sampled set of `random` cases in the training set.</li> <li>Use a larger set of `random` cases as an unseen test set.</li> </ul> <p><strong>Sampling Libraries</strong></p> <p>We provide the following libraries to make the downloading and sampling of these datasets easier. Using these libraries, you do not need to download the entire dataset from Zenodo; the individual problem datasets are downloaded and stored once when first sampling them.</p> <ul> <li>Python: <a href="https://github.com/thelmuth/psb2-python">https://github.com/thelmuth/psb2-python</a></li> <li>Clojure: <a href="https://github.com/thelmuth/psb2-clojure">https://github.com/thelmuth/psb2-clojure</a></li> </ul> <p><strong>Dataset format</strong></p> <p>Each edge and random dataset is provided in three formats: CSV, JSON, and EDN, with all three formats containing identical data.</p> <p>The CSV files are formatted as follows:</p> <ul> <li>The first row of the file is the column names.</li> <li>Each following row corresponds to one set of program inputs and expected outputs.</li> <li>Input columns are labeled `input1`, `input2`, etc., and output columns are labeled `output1`, `output2`, etc.</li> <li>In CSVs, string inputs and outputs are double quoted when necessary, but not if not necessary. Newlines within strings are escaped.</li> <li>Columns in CSV files are comma-separated.</li> </ul> <p>The JSON and EDN files are formatted using the <a href="https://jsonlines.org/">JSON Lines</a> standard (adapted for EDN).<br> Each case is put on its own line of the data file. The files should be read line-by-line and each parsed into an object/map using a JSON/EDN parser.</p> <p><strong>Citation</strong></p> <p>If you use these datasets in a publication, please cite the paper <em>PSB2: The Second Program Synthesis Benchmark Suite</em> and include a link to this repository.</p> <p>BibTeX entry for paper:</p> <pre><code>@InProceedings{Helmuth:2021:GECCO, author = "Thomas Helmuth and Peter Kelly", title = "{PSB2}: The Second Program Synthesis Benchmark Suite", booktitle = "2021 Genetic and Evolutionary Computation Conference", series = {GECCO '21}, year = "2021", isbn13 = {978-1-4503-8350-9}, address = {Lille, France}, size = {10 pages}, doi = {10.1145/3449639.3459285}, publisher = {ACM}, publisher_address = {New York, NY, USA}, month = {10-14} # jul, doi-url = {https://doi.org/10.1145/3449639.3459285}, URL = {https://dl.acm.org/doi/10.1145/3449639.3459285}, }</code></pre> <p><strong>Version History</strong></p> <p>1.0.0 - 2021/4/10 - Initial publication of PSB2 datasets on Zenodo.</p> <p>1.0.1 - 2021/7/9 - Changes to CSVs to quote all strings that could be read as integers. No changes in actual data, just formatting.</p> <p>&nbsp;</p>

openmit-licenseApr 2021View details →
zenodo40/100

The Oberwolfach Steel-Profile benchmark revisited

<p>This archive features the matrix data for the reimplemented Steel Profile benchmark from the Oberwolfach Collection. In contrast to the original, it uses FENICS, rather than ALBERTA, for the finite element semi-discretization in space.</p> <ol> <li>Download and unzip all ZIP files for the dimensions you need (numbers in the names are dimensions of the system)</li> <li>add getrail.m to the same folder</li> <li>download mmread.m from&nbsp;https://math.nist.gov/MatrixMarket/mmio/matlab/mmiomatlab.html</li> </ol> <p>See `help getrail` for usage instructions.</p>

opencc-by-4.0Jul 2021View details →
zenodo40/100

Simulated pp collisions at 13 TeV with 2 leptons + 1 b jet final state and selected benchmark Beyond the Standard Model signals

<p>This data-set is comprised of simulated events of pp collisions at 13 TeV with 2 leptons + 1 bottom jet sinal state, with HT &gt; 500 GeV. It includes the following samples</p> <ul> <li>Standard-Model background (bkg), generated at leading order includes the sub-samples Z+Jets, ttbar, WW, WZ, and ZZ. <ul> <li>The processes were generated in kinematic regions to ensure good statistics across the whole phase space. The sampling was carried out using event generation filters at parton level as follows <ul> <li>ttbar: pT &lt;100 GeV; pT in [100, 250] GeV; pT &gt; 250 GeV</li> <li>The scalar sum of the pT of outgoing particles for Z+Jet: ST &lt; 250 Gev; ST in [250, 500] GeV; ST &gt;&nbsp;500 GeV</li> <li>W/Z pT for dibosons: pT &lt; 250 GeV; pT in [250, 500] GeV; pT &gt; 500 GeV</li> </ul> </li> </ul> </li> <li>Vector-like T-quarks with masses 1.0, 1.2, 1.4 TeV (hq1000, hq1200, hq14000) pair produced either through the Standard-Model gluon (wohg) or through a BSM 3TeV heavy gluon (hg3000)</li> <li>tZ production through a Flavour Changing Neutral Current (fcnc) vertex</li> </ul> <p>The samples are provided with both a full set of features, or with a sanitised set of features. The sanitised features remove some accumulation at zeros from non-reconstructed objects (i.e. missing values).&nbsp;All samples were generated using MadGraph5 2.6.5 and the detector was simulated using Delphes 3 with the default CMS card. For the Standard-Model background, both Pythia 8.2 (with CMS CUETP8M1 underlying event tune&nbsp;and NNPDF 2.3 parton distribution functions)&nbsp;(pythia) and Herwig 7 (herwig) hadronisations are provided to compare the background simulation. For the BSM signals only Pythia is provided.</p> <p>For the details of the generation and on the differences between the two feature sets please refer&nbsp;to&nbsp;<a href="https://link.springer.com/article/10.1140%2Fepjc%2Fs10052-020-08807-w">Finding new physics without learning about it: anomaly detection as a tool for searches at colliders</a>&nbsp;for more details. Each file provides a train:validation:split with the ratios 1:1:1 to ensure equal statistical description of the events at each step of the machine learning workflow.</p>

opencc-by-4.0Jul 2021View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record