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.

285

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

285 results for “Machine learning dataset”

Learn how ShareScore rates datasets ↗
zenodo40/100

Investigating Online Art Search through Quantitative Behavioral Data and Machine Learning Techniques - Dataset

<p>This dataset includes the detailed values and scripts used to study behavioral aspects of users searching online for Art and Culture by analyzing quantitative data collected by the Art Boulevard search engine using machine learning techniques. This dataset is part of the core methodology, results and discussion sections of the research paper entitled &quot;<strong>Investigating&nbsp;Online&nbsp;Art&nbsp;Search through Quantitative Behavioral Data and Machine Learning Techniques</strong>&quot;</p>

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

Towards Generalization of Machine Learning Models: An Arabic Sentiment Analysis Dataset

<p>This data set consists of approximately 1.64 Million Arabic tweets (shared by their IDs) posted from 2009 to 2020, and their corresponding sentiment using a three-point classification system of Positive, Negative and Neutral/Mixed.&nbsp;No specific locations and/or keywords were specified throughout the data collection to obtain variation in the dialects and topics represented within the dataset. It is important to note that any biases in the proposed dataset in relation to the dialects and/or topics discussed were unintentional.</p> <p><strong>Please&nbsp;use the following citation if you use this data in a paper:</strong></p> <blockquote> <p>Abdaljalil, S., Hassanein, S., Mubarak, H., &amp; Abdelali, A. (2023). Towards Generalization of Machine Learning Models: A Case Study of Arabic Sentiment Analysis.&nbsp;<strong>Proceedings of the International AAAI Conference on Web and Social Media,&nbsp;17(1), 971-980.</strong></p> </blockquote> <p>&nbsp;</p> <p>&nbsp;</p>

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

Large-scale Docking Datasets for Machine Learning

<p><strong>Large-scale virtual screening has become a valuable tool for early-phase drug discovery. Recent expansions of commercial chemical space have made it computationally intractable to evaluate all compounds in the libraries. Machine learning is one of the methods that aim to prioritize specific subsets of these vast libraries. In order to put these methods to the test, access to large-scale datasets is beneficial. To help the community benchmark their work, we share the docking scores of several ultralarge virtual screening campaigns.</strong></p> <p><strong>The datasets we provide contain canonical SMILES, compound identifiers, and docking scores. We docked two different chemical libraries against eight different biological targets with therapeutic relevance. The first dataset contained approximately 15.5 million molecules adhering to the &quot;Rule-of-Four&quot;, whereas the second datasets consists of approximately 235 million &quot;lead-like&quot; molecules. The biological targets represent different classes of proteins and binding sites.</strong></p> <p><strong>More details on the datasets and our methods can be found on (<a href="http://github.com/carlssonlab/conformalpredictor">https://github.com/carlssonlab/conformalpredictor</a>) and our pre-print (<a href="https://doi.org/10.26434/chemrxiv-2023-w3x36">https://doi.org/10.26434/chemrxiv-2023-w3x36</a>). </strong></p> <p><strong>Please feel free to download and use these datasets for your own research purposes. We only ask that you cite our pre-print and datasets appropriately if you use it in your work. Thank you for your interest in our research!</strong></p>

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

Dataset for "Brain-machine interface learning is facilitated by specific patterning of distributed cortical feedback"

<p><strong>Dataset for the manuscript entitled: Brain-machine interface learning is facilitated by specific patterning of distributed cortical feedback.</strong></p> <p><strong><em>DOI of the manuscript:</em>&nbsp;<a href="https://doi.org/10.1126/sciadv.adh1328">10.1126/sciadv.adh1328</a></strong></p> <p><em><strong>Abstract of the manuscript:</strong></em></p> <p>Neuroprosthetics offer great hope for motor-impaired patients. One obstacle is that fine motor control requires near-instantaneous, rich somatosensory feedback. Such distributed feedback may be recreated in a brain-machine interface using distributed artificial stimulation across the cortical surface. Here, we hypothesized that neuronal stimulation must be contiguous in its spatiotemporal dynamics in order to be efficiently integrated by sensorimotor circuits. Using a closed-loop brain-machine interface, we trained head-fixed mice to control a virtual cursor by modulating the activity of motor cortex neurons. We provided artificial feedback in real time with distributed optogenetic stimulation patterns in the primary somatosensory cortex. Mice developed a specific motor strategy and succeeded to learn the task only when the optogenetic feedback pattern was spatially and temporally contiguous while it moved across the topography of the somatosensory cortex. These results reveal new properties of sensorimotor cortical integration and set new constraints on the design of neuroprosthetics.</p> <p><strong><em>Description of the variables in the data storage dictionary:</em></strong></p> <ol> <li>cursor_positions: sequence of the virtual cursor position over a session</li> <li>range_of_rewardable_cursor_position: range of cursor positions that can be rewarded. Upper threshold excluded. Lower threshold included. &nbsp;</li> <li>cursor_times: timing of the cursor positions provided by the cursor_positions data, in the same clock as spike and lick times.&nbsp;</li> <li>lick_times: timing of all recorded licks. &nbsp;</li> <li>reward_times:timing of the opening of the valve that releases the water reward.&nbsp;</li> <li>master_spike_times: time of the spikes of the master neurons.</li> <li>master_spike_shape: spike shape of each spike stored in master_spike_times. The shipe shapes are shown for 3s (30kHz sampling rate), for each 4 electrode of the corresponding tetrode.</li> <li>neighbor_spike_times': same as master_spike_times for neighbor neurons.</li> <li>neighbor_spike_shape': same as master_spike_shape for neighbor neurons. &nbsp;&nbsp;</li> </ol> <p><em><strong>General structure of the data set:</strong></em></p> <p>Each variable is a hierarchical tree of lists: [<em>Protocol</em>][<em>Mouse</em>][<em>Session</em>].&nbsp;</p> <p><em>Protocol</em> takes one of the following values:&nbsp;0: Bar feedback | 1: Full shuffle |&nbsp;2: No Feedback |&nbsp;5: Playback Structured Feedback |&nbsp;7: Spontaneous activity |&nbsp;8: Barrel Shuffle | 9: Frame shuffle.</p> <p><em>Mouse </em>and&nbsp;<em>Session</em> iterate through respectively the mice that were involved in the protocole, and the sessions, generally 5 in total.</p> <p><em><strong>Python code to load the hdf5 File</strong></em></p> <p>The code below relies on libraries available on a standard, mac anaconda install of the jupyter notebook system on the 25/03/2024. It provides with several nested lists of Numpy arrays.</p> <p>For instance, to access the series of cursor positions of Mouse M during session number S of Protocole P, index as follows:&nbsp;</p> <p>CP = cursor_positions_DATA[P][M][S]</p> <p># 1 - Load the libraries</p> <p>&nbsp; &nbsp; import h5py<br>&nbsp; &nbsp; import numpy as np<br>&nbsp; &nbsp; import pylab as pl</p> <p>&nbsp; &nbsp; filename = "./data.h5"<br>&nbsp; &nbsp; f = h5py.File(filename, "r")</p> <p># 2 - Extraction of the cursor position, time, lick and reward time, as well as the activity of the master and neighbor neurons.&nbsp;</p> <p>&nbsp; &nbsp; cursor_positions = f['cursor_positions']</p> <p>&nbsp; &nbsp; cursor_positions_DATA = []<br>&nbsp; &nbsp; for Protocole in range(9):<br>&nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole = []<br>&nbsp; &nbsp; &nbsp; &nbsp; P = f[cursor_positions[Protocole][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; for Mouse in range(16): &nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; # Loop through the mice, and collect&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; M = f[P[Mouse][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(M) == [0,1]) and (len(M) == 5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Session in range(5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; S = f[M[Session][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bfr = np.array(S)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse.append(bfr)&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole.append(DATA_mouse)<br>&nbsp; &nbsp; &nbsp; &nbsp; cursor_positions_DATA.append(DATA_protocole)</p> <p>&nbsp;</p> <p>&nbsp; &nbsp; cursor_times = f['cursor_times']</p> <p>&nbsp; &nbsp; cursor_times_DATA = []<br>&nbsp; &nbsp; for Protocole in range(9):<br>&nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole = []<br>&nbsp; &nbsp; &nbsp; &nbsp; P = f[cursor_times[Protocole][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; for Mouse in range(16): &nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; # Loop through the mice, and collect&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; M = f[P[Mouse][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(M) == [0,1]) and (len(M) == 5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Session in range(5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; S = f[M[Session][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bfr = np.array(S)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse.append(bfr)&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole.append(DATA_mouse)<br>&nbsp; &nbsp; &nbsp; &nbsp; cursor_times_DATA.append(DATA_protocole)</p> <p>&nbsp;</p> <p>&nbsp; &nbsp; lick_times = f['lick_times']</p> <p>&nbsp; &nbsp; lick_times_DATA = []<br>&nbsp; &nbsp; for Protocole in range(9):<br>&nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole = []<br>&nbsp; &nbsp; &nbsp; &nbsp; P = f[lick_times[Protocole][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; for Mouse in range(16): &nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; # Loop through the mice, and collect&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; M = f[P[Mouse][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(M) == [0,1]) and (len(M) == 5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Session in range(5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; S = f[M[Session][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bfr = np.array(S)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse.append(bfr)&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole.append(DATA_mouse)<br>&nbsp; &nbsp; &nbsp; &nbsp; lick_times_DATA.append(DATA_protocole)</p> <p>&nbsp;</p> <p>&nbsp; &nbsp; reward_times = f['reward_times']</p> <p>&nbsp; &nbsp; reward_times_DATA = []<br>&nbsp; &nbsp; for Protocole in range(9):<br>&nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole = []<br>&nbsp; &nbsp; &nbsp; &nbsp; P = f[reward_times[Protocole][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; for Mouse in range(16): &nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; # Loop through the mice, and collect&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; M = f[P[Mouse][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(M) == [0,1]) and (len(M) == 5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Session in range(5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; S = f[M[Session][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bfr = np.array(S)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse.append(bfr)&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole.append(DATA_mouse)<br>&nbsp; &nbsp; &nbsp; &nbsp; reward_times_DATA.append(DATA_protocole)</p> <p>&nbsp;</p> <p>&nbsp; &nbsp; master_spike_times = f['master_spike_times']</p> <p>&nbsp; &nbsp; master_spike_times_DATA = []<br>&nbsp; &nbsp; for Protocole in range(9):<br>&nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole = []<br>&nbsp; &nbsp; &nbsp; &nbsp; P = f[master_spike_times[Protocole][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; for Mouse in range(16): &nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; # Loop through the mice, and collect&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; M = f[P[Mouse][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(M) == [0,1]) and (len(M) == 5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Session in range(5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; S = f[M[Session][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_unit = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Unit in range(len(S)):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(S) == [0,1]):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; N = f[S[Unit][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bfr = np.array(N)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_unit.append(bfr)&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse.append(DATA_unit)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole.append(DATA_mouse)<br>&nbsp; &nbsp; &nbsp; &nbsp; master_spike_times_DATA.append(DATA_protocole)</p> <p>&nbsp;</p> <p>&nbsp; &nbsp; neighbor_spike_times = f['neighbor_spike_times']</p> <p>&nbsp; &nbsp; neighbor_spike_times_DATA = []<br>&nbsp; &nbsp; for Protocole in range(9):<br>&nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole = []<br>&nbsp; &nbsp; &nbsp; &nbsp; P = f[neighbor_spike_times[Protocole][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; for Mouse in range(16): &nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; # Loop through the mice, and collect&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; M = f[P[Mouse][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(M) == [0,1]) and (len(M) == 5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Session in range(5):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; S = f[M[Session][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_unit = []<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for Unit in range(len(S)):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if not(list(S) == [0,1]):<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; N = f[S[Unit][0]]<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bfr = np.array(N)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_unit.append(bfr)&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_mouse.append(DATA_unit)<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DATA_protocole.append(DATA_mouse)<br>&nbsp; &nbsp; &nbsp; &nbsp; neighbor_spike_times_DATA.append(DATA_protocole)</p> <p>&nbsp;</p>

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

A Tagged Traffic Accident Dataset for Machine Learning

<p>This dataset contains tagged accident data and is provided for reproducibility for our journal paper&nbsp;</p> <p><strong>Pablo Moriano, Andy Berres, Haowen Xu, Jibonananda Sanyal. &ldquo;Spatiotemporal Features of Traffic Help Reduce Automatic Accident Detection Time.&rdquo; <em>Expert Systems with Applications</em> 244 (2024): 122813. <a title="Persistent link using digital object identifier" href="https://doi.org/10.1016/j.eswa.2023.122813" target="_blank" rel="noopener">https://doi.org/10.1016/j.eswa.2023.122813</a></strong></p> <p>The accompanying Data in Brief publication discusses the methodology behind the creation of these data.</p> <p><strong>Berres, Andy, Pablo Moriano, Haowen Xu, Sarah Tennille, Lee Smith, Jonathan Storey, and Jibonananda Sanyal. "A Traffic Accident Dataset for Chattanooga, Tennessee."&nbsp;<em>Data in Brief</em> (2024): 110675.</strong></p> <p>&nbsp;</p> <p>The zip folder&nbsp;<strong><em>annotatedData.zip</em></strong> contains two subfolders: <strong><em>allData</em></strong> and <strong><em>bestData</em></strong>. The <em>bestData</em> folder contains all data for which a full neighborhood of five sensors upstream and five sensors downstream is available, whereas <em>allData</em> includes everything from <em>bestData</em> as well as data with a smaller number of neighboring sensors. Each folder contains one subfolder called <strong><em>accidents</em></strong> and one subfolder called <strong><em>non-accidents</em></strong>. The <em>accidents</em> folder contains one file per accident. The <em>non-accidents</em> folder contains files for the same location, day of the week and time as a corresponding accident, for each week during which there was no accident impact on the traffic.</p> <p>The file names in both folders are formatted as follows: <strong>yyyy-mm-dd-hhmm-rrrrrXaaa.a.csv</strong>, consisting of date (yyyy-mm-dd), time (hhmm in 24-hour format), and sensor name (rrrrrXaaa.a), which consists of road name (rrrrr; 5 alphanumerical characters), heading (X), and mile marker (aaa.a). For example, the file <em>2020-11-03-1611-00I24W182.8.csv </em>&nbsp;contains data for an accident which occurred at 4:11 p.m. on November 3, 2020 on I-24 Westbound near the radar sensor at mile marker 182.8.</p> <p>The content of each CSV file is a timeseries of radar data beginning 15 minutes prior to the reported incident and ending 15 minutes after the reported incident. It also contains metadata, such as the accident type, etc. Each CSV file contains the following columns:</p> <ul> <li><strong>incident at sensor(i)</strong>: 1 for yes (<em>accidents</em> folder), 0 for no (<em>non-accidents</em> folder)</li> <li><strong>road</strong>: road name with heading, e.g. 00I24E</li> <li><strong>mile</strong>: mile marker of nearest radar sensor, e.g. 182.8</li> <li><strong>type</strong>: accident type, e.g. &ldquo;Prop Damage (over)&rdquo; for property damage exceeding a certain threshold. For non-accidents, the type is given as &ldquo;None&rdquo;.</li> <li><strong>date</strong>: date of the data sample. For accidents, this is the date on which the accident occurred. For non-accidents, this is the date for which the non-accident data sample is collected.</li> <li><strong>incident_time</strong>: time the reference accident was reported in hh:mm. This is the time which is provided in E-TRIMS as the time the 911 call was made.</li> <li><strong>incident_hour</strong>: just the hour from the incident_time, in integer format.</li> <li><strong>data_time</strong>: timestamp for the timeseries contained in the file in hh:mm:ss format. The timeseries consists of 30 second timesteps.</li> <li><strong>weather</strong>: weather during <em>data_time</em>, based on data collected from NASA POWER. We used dry bulb temperature (&deg;C), precipitation (mm/h), and wind speed (m/s) from the raw NASA POWER data to produce the classifications of <em>rain</em> (at least 1mm precipitation and temperatures above 2&deg;C), <em>snow </em>(at least 1mm precipitation and temperatures at or below 2&deg;C), and <em>wind</em> (wind speeds over 30 mph or 13.5 m/s). If there were no inclement weather conditions, we set the category to <em>&ldquo;--"</em>.</li> <li><strong>light</strong>: light conditions during data_time. To produce this field, we collected sunrise, sunset, civil twilight start and civil twilight end times from <a href="https://sunrise-sunset.org">https://sunrise-sunset.org</a>, and derived the categories dawn, daylight, dusk, and dark using these start and end times.</li> <li>The last 33 columns contain radar data for the 11 sensors surrounding the accident or non-accident. For each sensor, we collected <em>speed</em> (mean over 30-second interval in miles per hour, or empty if no vehicles passed), <em>volume</em> (count of all vehicles passing during 30-second interval), and <em>occupancy</em> (mean % of occupancy over 30-second interval).&nbsp; These three variables are grouped in triples, of <strong>speed (k), volume (k), occupancy (k)</strong>, where <em>k</em> indicates the sensor number relative to the closest sensor <em>i</em> to the incident, <em>k&lt;i</em> indicate upstream sensors and <em>k&gt;i</em> indicate downstream sensors. For example, <strong>speed (i-5)</strong> refers to the mean speed at the sensor which is 5 hops upstream from the accident, and <strong>volume(i+1) </strong>refers to the number of vehicles at the sensor immediately downstream from the accident.</li> </ul> <p>The folder <strong><em>metaData.zip</em></strong> contains the following files:</p> <ul> <li><strong>Accidents.csv</strong>: cleaned-up accidents file with all accidents which happened on Chattanooga area highways between November 1, 2020 and April 29, 2021. We have removed accidents which happened on non-highway roads, and we have corrected the timestamps (which were in 12-hour format but missing a.m./p.m. markers) by cross-referencing light and weather conditions.</li> <li><strong>WeatherDict</strong><strong>.json:</strong> a dictionary containing the weather data synthesized from NASA POWER.</li> <li><strong>LightDict.json</strong>: a dictionary containing the light data synthesized from Sunrise-and-Sunset.</li> <li><strong>SensorTopology.csv</strong>: neighborhood information for each radar sensor in the Chattanooga area.</li> <li><strong>SensorZones.geojson</strong>: polygons used to determine the nearest radar sensor for each accident location. Each polygon is tagged with the corresponding radar sensor&rsquo;s name.</li> </ul>

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

Hainan gibbon (Nomascus hainanus) bioacoustics dataset for machine learning

<p>Data accompanying the paper:&nbsp;&quot;<strong>Empowering Deep Learning Acoustic Classifiers with Human-like Ability to Utilize Contextual Information for Wildlife Monitoring</strong>&quot;</p> <p>We provide the audio data (.wav) used to&nbsp;test our neural network classifier along with the corresponding labelled text files (.svl). The audio and labelled files can easily be viewed in Sonic Visualiser. Drag and drop the audio file. Create the spectrogram layer. Drag and drop the corresponding .svl file.</p> <p>The dataset provided here is a subset of the full dataset provided here:&nbsp;10.5281/zenodo.3991714. This dataset has additional files that were manually annotated, which were not manually verified in the original version (10.5281/zenodo.3991714).</p> <p><strong>Files provided</strong></p> <ul> <li><strong>Audio_x.zip</strong> -- we provide x number of .zip files containing audio files, numbered 1 to 4. These were created in batches to simplify downloads.</li> <li><strong>Annotations.zip -</strong>- .svl files which contain the manually verified labels. These files can be read in Sonic Visualiser, or as .XML files in a programming language. We took care to annotate the start and stop time of each gibbon call. The height of each bounding box is not important as the frequency range of Hainan gibbons is already known.</li> <li><strong>model_weights_tensorflow.hdf5&nbsp;</strong>-- the Tensorflow model. Load the model using: model = tf.keras.models.load_model(model_filepath) note that the model expects a three channel input as explained in the research article.</li> </ul>

opencc-by-nc-sa-4.0Jun 2023View details →
zenodo40/100

Automatic Identification of Kidney Cell Types in scRNA-seq and snRNA-seq Data Using Machine Learning Algorithms - Datasets

<p>Datasets for reproducibility of the results found in Automatic Identification of Kidney Cell Types in scRNA-seq and snRNA-seq Data Using Machine Learning Algorithms. This study utilized data from the following 4 journals:</p> <p>Lake, B.B. et al. A single-nucleus RNA-sequencing pipeline to decipher the molecular anatomy and pathophysiology of human kidneys. Nat Commun 10, 2832 (2019).</p> <p>Liao, J., Yu, Z., Chen, Y. et al. Single-cell RNA sequencing of human kidney. Sci Data 7, 4 (2020).</p> <p>Menon, R. et al. Single cell transcriptomics identifies focal segmental glomerulosclerosis remission endothelial biomarker. JCI Insight 5, e133267 (2020).</p> <p>Wu, H. et al. Single-cell transcriptomics of a human kidney allograft biopsy specimen defines a diverse inflammatory response. J Am Soc Nephrol 29: 2069&ndash;2080 (2018).</p> <p>Young, M. D. et al. Single-cell transcriptomes from human kidneys reveal the cellular identity of renal tumors. Science 361, 594&ndash;599 (2018).</p>

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

Soil texture dataset from the publication: "Machine learning applied for Antarctic soil mapping: Spatial prediction of soil texture for Maritime Antarctica and Northern Antarctic Peninsula'

<p>Clay, silt and sand distribution in Antarctic soils&nbsp;modeled and predicted through Machine Learning approaches, legacy soil data and environmental covariates. The coefficient of variation and quantile&nbsp;data represent the spatial uncertainty of the predictions. For more information about the methodology used, users are referred to the article:&nbsp;</p> <p>Siqueira, R.G., Moquedace, C.M., Francelino, M.R., Schaefer, C.E.G.R., Fernandes-Filho, E.I., 2023. Machine learning applied for Antarctic soil mapping: Spatial prediction of soil texture for Maritime Antarctica and Northern Antarctic Peninsula. Geoderma 432, 116405. https://doi.org/10.1016/j.geoderma.2023.116405</p> <p>The .zip file has the following folders:</p> <p>1) soil_texture_antarctica: soil texture information containing clay, silt and sand contents</p> <p>2)&nbsp;soil_texture_coefficient_variation: uncertainty from the coefficient of variation of the soil texture prediction</p> <p>3) soil_texture_prediction_interval: uncertainty from the prediction interval 90% (Q95% - Q5%) of the soil texture prediction</p> <p>4) soil_texture_quantile05: quantile 5% of the soil texture prediction</p> <p>5) soil_texture_quantile95: quantile 95% of the soil texture prediction</p>

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

Soil chemistry dataset from the work "Modelling and prediction of major soil chemical properties with Random Forest: machine learning as tool to understand soil-environment relationships in Antarctica"

<p>Bases sum, H+Al (potential acidity), pH, phosphorous, remaining P (P-rem), sodium and total organic carbon&nbsp;distribution in Antarctic soils modeled and predicted through Machine Learning approaches, legacy soil data and environmental covariates. The quantile and prediction interval data represent the spatial uncertainty of the predictions.</p> <p>As soon as the work&nbsp;&quot;Modelling and prediction of major soil chemical properties with Random Forest: machine learning as tool to understand soil-environment relationships in Antarctica&quot; is published, the paper will be cited here.&nbsp;</p> <p>The .zip file contains the following folders:</p> <p>1) soil_chemistry_antarctica: data containing the soil chemical attributes distribution</p> <p>2) soil_chemistry_prediction_interval: uncertainty from the prediction interval 90% (Q95% - Q5%) of the soil attributes prediction</p> <p>4) soil_texture_quantile05: quantile 5% of the soil attributes prediction</p> <p>5) soil_texture_quantile95: quantile 95% of the soil attributes&nbsp;prediction</p>

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

Image for the dataset in "Extraction of stratigraphic exposures on visible images using a supervised machine learning technique"

<p>This is&nbsp;the original and hand-masked image&nbsp;for the dataset used in a research paper &quot;Extraction of stratigraphic exposures on visible images using a supervised machine learning technique&quot;.</p> <p>The content&nbsp;is</p> <ul> <li>Original images with hand-masked images (original_images_NOGUCHIandShoji.zip) <ul> <li>training/* : original images used for the training dataset generation&nbsp;(60 files)</li> <li>training_masks/* : hand-masked images for the training dataset generation (60 files)</li> <li>validation/* : original images used for the training dataset generation&nbsp;(10 files)</li> <li>validation_masks/* : hand-masked images for the validation dataset generation (10 files)</li> <li>test/* :&nbsp;original images used as the test data (5&nbsp;files)</li> <li>test_masks/* :&nbsp;hand-masked images used as the test data (5 files).</li> </ul> </li> </ul> <p>Note that original images include&nbsp;images obtained using <em>google-image-download</em>, a Python script published on GitHub (<a href="https://github.com/Joeclinton1/google-images-download/tree/patch-1">https://github.com/Joeclinton1/google-images-download/tree/patch-1</a>, Copyright &copy; 2015-2019 Hardik Vasa).&nbsp;The whole images we obtained by <em>google-image-download</em> were labeled as noncommercial reuse with modification.</p> <p>For more details, please refer to a research paper &quot;Extraction of stratigraphic exposures on visible images using a supervised machine learning technique&quot;.</p> <p>Correspondence: Rina Noguchi (r-noguchi@env.sc.niigata-u.ac.jp)</p>

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

Simulated datasets for detector and particle flow reconstruction: CLIC detector, hit-based data, machine learning format

<p>Derived from https://zenodo.org/record/8260741, prepared in a machine-learning friendly TFDS format, ready to be used with https://zenodo.org/record/8397954.</p> <ul> <li>clic_edm_ttbar_hits_pf10k.tar: ee -&gt; ttbar, center of mass energy at 380 GeV, 10k events</li> <li>clic_edm_qq_hits_pf10k.tar: ee -&gt; Z* -&gt; qqbar, center of mass energy at 380 GeV, 10k events</li> </ul> <p><strong>Contents</strong></p> <p>Each .tar file contains the dataset in the <a href="https://github.com/tensorflow/datasets">tensorflow-datasets</a> (minimum version v4.9.1), <a href="https://github.com/google/array_record">array_record</a> format.</p> <p><strong>Dataset semantics</strong></p> <p>Each dataset consists of events that can be iterated over using the tensorflow-datasets library in either tensorflow or pytorch. Each event has the following information available:</p> <ul> <li>X: the reconstruction input features, i.e. tracks and calorimeter hits</li> <li>ygen: the ground truth particles with the features [&quot;PDG&quot;, &quot;charge&quot;, &quot;pt&quot;, &quot;eta&quot;, &quot;sin_phi&quot;, &quot;cos_phi&quot;, &quot;energy&quot;, &quot;jet_idx&quot;], with &quot;jet_idx&quot; corresponding to the gen-jet assignment of this particle</li> <li>ycand: the baseline Pandora PF particles with the features [&quot;PDG&quot;, &quot;charge&quot;, &quot;pt&quot;, &quot;eta&quot;, &quot;sin_phi&quot;, &quot;cos_phi&quot;, &quot;energy&quot;, &quot;jet_idx&quot;], with &quot;jet_idx&quot; corresponding to the gen-jet assignment of this particle</li> </ul> <p>The full semantics, including the list of features for X, are available at https://github.com/jpata/particleflow/blob/v1.6/mlpf/heptfds/clic_pf_edm4hep_hits/utils_edm.py.</p>

opencc-by-4.0Oct 2023View details →
zenodo36/100

Image Dataset for 'Digitally deconstructing leaves in 3D using X-ray microcomputed tomography and machine learning'

<p>Dataset used in the manuscript &#39;Digitally Deconstructing Leaves in 3D Using X-ray microcomputed Tomography and Machine Learning&#39;. Please cite the paper presenting this dataset:</p> <p><strong>Citation:</strong> Th&eacute;roux-Rancourt, G., M. R. Jenkins, C. R. Brodersen, A. McElrone, E. J. Forrestel, and J. M. Earles. 2020. Digitally deconstructing leaves in 3D using X-ray microcomputed tomography<strong> </strong>and machine learning. <em>Applications in Plant Sciences</em> 8(7): .</p> <p>&nbsp;</p> <p><strong>Description of the dataset</strong></p> <p>A &#39;Cabernet Sauvignon&#39; grapevine (<em>Vitis vinifera</em> L.) leaf from a plant of the BOKU experimental vineyard in Tulln, Austria, was scanned using microCT at the Swiss Light Source. The original reconstructions of the scans are using the gridrec (<a href="https://zenodo.org/api/files/bbca544a-15d0-40f3-8cc9-a3ee3c08fd7e/Gridrec_reconstruction_downsized.zip?versionId=28d98982-f69d-4eac-9dfa-efcc89c6823c">Gridrec_reconstruction_downsized.zip</a>) and the paganin, or phase-contrast, algortithm (<a href="https://zenodo.org/api/files/bbca544a-15d0-40f3-8cc9-a3ee3c08fd7e/Phase_contrast_reconstruction_downsized.zip?versionId=bef3260d-2865-4c9b-b5e1-e692edefb691">Phase_contrast_reconstruction_downsized.zip</a>). To facilitate automated segmentation, the size of the image in the <em>x </em>and <em>y</em> dimensions have been halved, so that the size of the pixels is 0.325 &micro;m in those dimensions, but 0.1625 &micro;m in the <em>z</em> (slices) dimension.</p> <p>A binary image segmenting the leaf cells and the airspace for each gridrec and phase-contrast stacks are created, and both are combined together (<a href="https://zenodo.org/api/files/bbca544a-15d0-40f3-8cc9-a3ee3c08fd7e/Binary_stack_for_local_thickness.zip?versionId=165e3938-b490-4e56-9c8e-a2084cb39d49">Binary_stack_for_local_thickness.zip</a>), a map of the local thickness is created (<a href="https://zenodo.org/api/files/bbca544a-15d0-40f3-8cc9-a3ee3c08fd7e/Local_thickness_map.zip?versionId=ce0a7dc7-5e3f-44a4-8881-cf84b6efd87c">Local_thickness_map.zip</a>). This map gives information on the largest diameter of the pixels labeled as cells in the binary stack.</p> <p>Hand-labeled slices or ground truths were drawn on the following slices:&nbsp;80, 140, 200, 260, 340, 400, 440, 540, 620, 740, 800, 860, 940, 1060, 1140, 1240, 1300, 1400, 1480, 1540, 1600, 1690, 1740, 1840 (<a href="https://zenodo.org/api/files/bbca544a-15d0-40f3-8cc9-a3ee3c08fd7e/Hand_labelled_slices.tif?versionId=a21a13ac-fa47-4ef8-a903-ecc433787184">Hand_labelled_slices.tif</a>).</p> <p>Using the hand-labeled slices and the different images, a random-forest model was trained, which allowed to automatically segment the remaining slices of the stack (<a href="https://zenodo.org/api/files/bbca544a-15d0-40f3-8cc9-a3ee3c08fd7e/Fullstack_Prediction_Example-6_training_slices-6_testing_slices.zip?versionId=02b69e65-da85-492e-9b72-9b2b3ccd085f">Fullstack_Prediction_Example-6_training_slices-6...</a>).</p> <p>The source code for the segmentation program is available <a href="https://github.com/plant-microct-tools/leaf-traits-microct/tree/master">here</a>, and the source code for the testing used in the paper is available <a href="https://github.com/plant-microct-tools/leaf-traits-microct/tree/nb-slices-eval">here</a>.</p>

opencc-by-4.0Mar 2020View details →
zenodo36/100

NEMO, HIDRA and Tide Gauge Datasets for HIDRA Machine Learning Algorithm Verification

<p>Supporting sea level datasets for paper:</p> <p>&quot;HIDRA 1.0: Deep-Learning-Based Ensemble Sea Level Forecastingin the Northern Adriatic&quot;</p> <p>by&nbsp;Lojze Žust, Anja Fettich, Matej Kristan, and Matjaž Ličer</p>

opencc-by-4.0Oct 2020View details →
zenodo36/100

FORCE 2020 Well well log and lithofacies dataset for machine learning competition

<p>This well log dataset from 118 wells in the Norwegian Sea that has been used in the FORCE 2020 machine learning competition with seismic and wells to predict the lithofacies using machine learning models.&nbsp;</p> <p>The well logs have been slightly cleaned up and partially despiked.</p> <p>The lithofacies and lithology interpretation has been hand crafted using skilled geoscientists&nbsp; (Thanks to Explocrowd for excellent work). For citation in addition to the DOI please also refer to the github repository where the documentation and trained models reside</p> <p><a href="https://github.com/bolgebrygg/Force-2020-Machine-Learning-competition">https://github.com/bolgebrygg/Force-2020-Machine-Learning-competition&nbsp;</a></p> <p>&nbsp;</p> <p>The original well log data comes form the Norwegian government and is provided by a NOLD 2.0 license</p> <p>&nbsp;</p>

opencc-by-4.0Dec 2020View details →
zenodo36/100

Machine learning reactive mixing dataset-0

<p>Reactive-mixing dataset-0 for machine learning analyses</p>

opencc-by-4.0Jan 2021View details →
zenodo36/100

Machine learning reactive mixing dataset-2

<p>Reactive-mixing dataset-1.1 for machine learning analyses</p>

opencc-by-4.0Jan 2021View details →
zenodo36/100

Machine learning reactive mixing dataset-1

<p>Reactive-mixing dataset-1&nbsp;for machine learning analyses</p>

opencc-by-4.0Jan 2021View details →
zenodo36/100

Machine learning reactive mixing dataset-9

<p>Reactive-mixing dataset-3&nbsp;for machine learning analyses</p>

opencc-by-4.0Jan 2021View details →
zenodo36/100

Machine learning reactive mixing dataset-4

<p>Reactive-mixing dataset-1.3&nbsp;for machine learning analyses</p>

opencc-by-4.0Jan 2021View details →
zenodo36/100

Machine learning reactive mixing dataset-3

<p>Reactive-mixing dataset-1.2&nbsp;for machine learning analyses</p>

opencc-by-4.0Jan 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

ScienceDex for faculty

Your academic CV and NIH biosketch

Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.