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.
7
datasets available to search
ShareScore release 0.9.0
Dataset results
7 results for “online sources”
ISPON: A New Dataset for Identifying Sources in Political Online News
<p>This dataset contains a set of annotations for informational news sources (such as eyewitnesses, public officials, academic experts, reports, or other documentation) that provide support for claims made within online political news articles. Our dataset contains fine-grained annotations on the sources cited within each article, including in-text notations highlighting the words or phrases signaling a source. The dataset comprises annotations for nearly 2,500 articles covering 47 outlets. In addition, the dataset includes a larger set of >150,000 URLs from 92 outlets.</p>
BRAIN Journal-The Presence and Activity on Facebook of the Informative Travel Organizations in Romania-Figure 2. Online presence through a website of Romanian tourism entities with informative role Source: authors
<p>According to research results (Figure 2), almost 68% of the entities with tourist information and promotion role own a proper site for the presentation of the work, while 18.35%, most probably do not realize in pragmatic terms the usefulness of such promotional tools. The situation can be cataloged as quite worrying, especially if we consider that today, due to the fulminant development of smartphones, more and more tourists choose to seek information on the Internet, even during their trip to a new destination (Wang el. al. 2012).</p>
An Online Integrated Development Environment for Automated Programming Assessment Systems Open Source Data
<p>This dataset accompanies the paper <em>"An Online Integrated Development Environment for Automated Programming Assessment Systems"</em>. It contains data from the usability evaluation of a feature-rich online IDE designed for integration into Automated Programming Assessment Systems (APASs). The dataset includes survey responses from 27 participants based on the Technology Acceptance Model (TAM), performance metrics such as memory usage, and qualitative user feedback. The study highlights challenges in integrating online IDEs with APASs, such as memory efficiency, load balancing, and user experience. The dataset supports further research in developing scalable, effective, and user-friendly programming education tools.<br><br>Here you can find the code changes required for the online IDE in Artemis: <a href="https://github.com/ls1intum/Artemis/pull/6706/files" target="_blank" rel="noopener">Github</a></p>
Online Appendix of "Toward Interactive Optimization of Source Code Differences: An Empirical Study of Its Performance"
<div> <div><strong>Abstract</strong></div> <div>This is the dataset of the paper entitled "Toward Interactive Optimization of Source Code Differences: An Empirical Study of Its Performance", presented at SCAM 2024. It contains information related to the target commits and their attributes, as well as simulation results pertaining to the research questions in the paper.</div> <div> </div> <div>The target projects and commits in the dataset are based on a prior study: Nugroho, et al.: "How different are different diff algorithms in Git?: Use --histogram for code changes", Empirical Software Engineering, 2020, https://doi.org/10.1007/s10664-019-09772-z</div> <div> </div> </div> <div> <div><strong>Survey Overview</strong></div> <div> <div><em>1. Filtration</em></div> <div> <div>We collected attributes related to the changes for filtering and RQ purposes.</div> <ul> <li>Number of lines</li> <li>Number of changed lines</li> <li>Similarity distance</li> <li>Number of mismatch diff area</li> </ul> <div><em>2. RQ1</em></div> <div> <div>We investigate the minimum number of feedback actions needed to correct the initial diffs to the target diffs. Regarding the simulation, two types of heuristic functions (non-admissible and admissible functions) have been used to reduce costs. When the search with the non-admissible heuristic function of the initial state does not match the ideal optimal result, i.e., when there is room for improvement in the number of feedback actions, we applied another A* search with the admissible heuristic function.</div> <div> </div> <div> <div>We obtained the following results through search:</div> <ul> <li>Number of feedback actions (A* search with non-admissible heuristic)</li> <li>Number of feedback actions (A* search with admissible heuristic)</li> </ul> <div> </div> <div><em>3. RQ2</em></div> <div> <div> <div>We investigated the various effects that feedbacks have on the diffs by examining the diffs at depth 1 of the search tree. The dataset records the maximum, minimum, median, mean, and standard deviation for each search problem.</div> <br> <div>The study yielded the following results:</div> <ul> <li>Similarity distance</li> <li>Number of mismatch diff area</li> </ul> </div> </div> </div> </div> </div> </div> <div> <div> </div> <div> <div><strong>Dataset Columns</strong></div> <div>The following are the contents represented by the columns in the CSV file and their descriptions.</div> <div> </div> <div> <table> <tbody> <tr> <td>Column name</td> <td>Description</td> </tr> <tr> <td>project_name</td> <td>Name of the project associated with the data.</td> </tr> <tr> <td>filename</td> <td>Name of the file being analyzed.</td> </tr> <tr> <td>filepath</td> <td>Path to the file within the project.</td> </tr> <tr> <td>commit_id</td> <td>Commit hash representing the new version of the file.</td> </tr> <tr> <td>parent_commit</td> <td>Commit hash representing the old version of the file.</td> </tr> <tr> <td>error_commit</td> <td>An error occurred when retrieving the commit from the repository.</td> </tr> <tr> <td>error_setup</td> <td>Any error when generating the new and old versions of the file.</td> </tr> <tr> <td>error_analyze</td> <td>An error when collecting information for filtering.</td> </tr> <tr> <td>new_loc</td> <td>Lines of the new version of the source code.</td> </tr> <tr> <td>old_loc</td> <td>Lines of the old version of the source code.</td> </tr> <tr> <td>histogram_len</td> <td>Path length of the diff when using the Histogram algorithm.</td> </tr> <tr> <td>myers_len</td> <td>Path length of the diff when using the Myers algorithm.</td> </tr> <tr> <td>histogram-myers#edge</td> <td>Number of difference edges between Histogram and Myers diff.</td> </tr> <tr> <td>histogram-dp#edge</td> <td>Number of difference edges between Histogram and initial diff.</td> </tr> <tr> <td>myers-dp#edge</td> <td>Number of difference edges between Myers and initial diff.</td> </tr> <tr> <td>histogram-myers#area</td> <td>Number of mismatch diff areas between Histogram and Myers diff.</td> </tr> <tr> <td>histogram-dp#area</td> <td>Number of mismatch diff areas between Histogram and initial diff.</td> </tr> <tr> <td>myers-dp#area</td> <td>Number of mismatch diff areas between Myers and initial diff.</td> </tr> <tr> <td>dp#candidate</td> <td>Number of feedback candidates of initial diff (similarity distance).</td> </tr> <tr> <td>#insert</td> <td>Number of lines added in the change.</td> </tr> <tr> <td>#delete</td> <td>Number of lines deleted in the change.</td> </tr> <tr> <td>#change</td> <td>#insert + #delete.</td> </tr> <tr> <td>error_Asearch</td> <td>An error occurring during A* search with a non-admissible heuristic.</td> </tr> <tr> <td>#feedback_A</td> <td>Number of feedback actions for A* search with a non-admissible heuristic.</td> </tr> <tr> <td>time_A</td> <td>Time taken for A* search with a non-admissible heuristic (ms).</td> </tr> <tr> <td>RQ1_error_iteration</td> <td>An error when iterations exceed the limit (10,000,000) during A* search with an admissible heuristic.</td> </tr> <tr> <td>RQ1_error_timeout</td> <td>An error when the search time exceeds the limit (1,800 seconds).</td> </tr> <tr> <td>RQ1_error_other</td> <td>Other errors encountered during A* search with an admissible heuristic.</td> </tr> <tr> <td>RQ1#feedback</td> <td>Number of feedback actions for A* search with an admissible heuristic.</td> </tr> <tr> <td>RQ1#iter</td> <td>Number of iterations for A* search with an admissible heuristic.</td> </tr> <tr> <td>RQ1_time</td> <td>Time taken for A* search with an admissible heuristic.</td> </tr> <tr> <td>RQ2_error_exceed</td> <td>An error due to exceeding time or iteration limits in RQ2.</td> </tr> <tr> <td>RQ2_error_other</td> <td>Other errors encountered during RQ2.</td> </tr> <tr> <td>RQ2#children</td> <td>Number of children nodes of the initial state (= similarity distance).</td> </tr> <tr> <td>RQ2#candidate_min</td> <td>Minimum similarity distance among the generated diffs.</td> </tr> <tr> <td>RQ2#candidate_max</td> <td>Maximum similarity distance among the generated diffs.</td> </tr> <tr> <td>RQ2#candidate_ave</td> <td>Average of similarity distance among the generated diffs.</td> </tr> <tr> <td>RQ2#candidate_median</td> <td>Median of similarity distance among the generated diffs.</td> </tr> <tr> <td>RQ2#candidate_sd</td> <td>Standard deviation of similarity distance among the generated diffs.</td> </tr> <tr> <td>RQ2#area_min</td> <td>Minimum number of mismatch diff areas among the generated diffs.</td> </tr> <tr> <td>RQ2#area_max</td> <td>Maximum number of mismatch diff areas among the generated diffs.</td> </tr> <tr> <td>RQ2#area_ave</td> <td>Average number of mismatch diff areas among the generated diffs.</td> </tr> <tr> <td>RQ2#area_median</td> <td>Median number of mismatch diff areas among the generated diffs.</td> </tr> <tr> <td>RQ2#area_sd</td> <td>Standard deviation of number of mismatch diff areas among the generated diffs.</td> </tr> <tr> <td>is_used</td> <td>Indicates whether this data is used in the results of RQ1 and RQ2.</td> </tr> </tbody> </table> </div> </div> </div> </div>
Online Appendix for "An Exploratory Study of the State of Practice of Performance Testing in Java-Based Open Source Projects"
<p>Here we collect some raw data and additional material to the paper <em>"An Exploratory Study of the State of Practice of Performance Testing in Java-Based Open Source Projects"</em>, by Philipp Leitner and Cor-Paul Bezemer.</p>
Data archive for the peer-reviewed journal article "Major source categories of PM2.5 oxidative potential in wintertime Beijing and surroundings based on online dithiothreitol-based field measurements"
<p>This data archive accompanying the article "Major source categories of PM2.5 oxidative potential in wintertime Beijing and surroundings based on online dithiothreitol-based field measurements", which was accepted in April 2024 in the peer-reviewed journal <strong><em>Science of the Total Environment</em></strong>. This data archive contains the processed OPvDTT measurements, chemical speciation of PM2.5, and source contribution used in the manuscript.</p>
Flemish online news (15 sources)
<p>From 2017 to 2021, online news media were scraped to provide a real-time collection of digital news. Fifteen popular and diverse Flemish news sources were selected for this purpose, resulting in a vast collection of nearly 1.5 million articles in four years. The data format is JSON-lines (one JSON object per line for lazy loading). The fifteen sources are: </p> <table> <thead> <tr> <th scope="col">No.</th> <th scope="col">Name</th> <th scope="col">URL</th> <th scope="col">Type</th> </tr> </thead> <tbody> <tr> <td>1.</td> <td>Het Laatste Nieuws</td> <td>hln.be</td> <td>Newspaper</td> </tr> <tr> <td>2.</td> <td>Het Nieuwsblad</td> <td>nieuwsblad.be</td> <td>Newspaper</td> </tr> <tr> <td>3.</td> <td>VRT</td> <td>vrt.be</td> <td>Public broadcasting</td> </tr> <tr> <td>4.</td> <td>De Standaard</td> <td>standaard.be</td> <td>Newspaper</td> </tr> <tr> <td>5.</td> <td>Gazet van Antwerpen</td> <td>gva.be</td> <td>Regional Newspaper</td> </tr> <tr> <td>6.</td> <td>De Morgen</td> <td>demorgen.be</td> <td>Newspaper</td> </tr> <tr> <td>7.</td> <td>De Tijd</td> <td>tijd.be</td> <td>Financial newspaper</td> </tr> <tr> <td>8.</td> <td>Metro</td> <td>nl.metrotime.be</td> <td>Newspaper</td> </tr> <tr> <td>9.</td> <td>Knack</td> <td>knack.be</td> <td>Magazine</td> </tr> <tr> <td>10.</td> <td>Trends</td> <td>trends.knack.be</td> <td>Financial magazine</td> </tr> <tr> <td>11.</td> <td>De Zondag</td> <td>dezondag.be</td> <td>Weekly newspaper</td> </tr> <tr> <td>12.</td> <td>Humo</td> <td>humo.be</td> <td>Magazine</td> </tr> <tr> <td>13.</td> <td>Het Belang van Limburg</td> <td>hbvl.be</td> <td>Regional Newspaper</td> </tr> <tr> <td>14.</td> <td>Krant van West-Vlaanderen</td> <td>kw.be</td> <td>Regional Newspaper</td> </tr> <tr> <td>15.</td> <td>'t Pallieterke</td> <td>palnws.be</td> <td>Magazine</td> </tr> </tbody> </table> <p> </p>
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research 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.
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.
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.
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.
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.