Mountain View
biomedical and healthCAre Data Discovery Index Ecosystem
help Advanced Search
Title: Identifier Splitters      
dateReleased:
03-31-2017
privacy:
information not avaiable
aggregation:
instance of dataset
dateCreated:
03-31-2017
refinement:
raw
ID:
doi:10.5281/ZENODO.439585
creators:
Binkley, David
Lawrie, Dawn
Pollock, Lori
Hill, Emily
,
availability:
available
types:
other
description:
The oracle, found in the file loyola-udelaware-identifier-splitting-oracle (ludiso) consists of 2663 identifiers. These identifiers were split by volunteers using a web interface. In all 8522 splitting judgements were collected for 2731 identifiers. The data set was curated based on the sum of confidence associated with a particular split. In order to provide a single correct split in the oracle, the split receiving the highest confidence sum was used as the correct split. Of the 2731 identifers, 68 do not appear in the oracle because of ties. (These identifiers can be found in the raw data.) Details on the construction of the oracle can be found in "An empirical study of identifier splitting technique". Attribute Information Each line of the oracle represents one of the 2663 remaining oracle identifiers and includes the following. the identifier's unique identification number, the original identifier as extracted from the source, the dominant language of the program that the id was extracted from, the program from which it was extracted, the identifier as shown to subjects where a '-' denotes a hard split, the number of splittings (always 1 in the oracle, but not in the raw data), the identifier as split by users, the number of confidences (1 - 5) and then each confidence.  
accessURL: https://doi.org/10.5281/ZENODO.439585
storedIn:
Zenodo
qualifier:
not compressed
format:
HTML
accessType:
landing page
authentication:
none
authorization:
none
abbreviation:
ZENODO
homePage: https://zenodo.org/
ID:
SCR:004129
name:
ZENODO

Feedback?

If you are having problems using our tools, or if you would just like to send us some feedback, please post your questions on GitHub.