OpenAIRE Research Graph » History » Version 21
Alessia Bardi, 05/11/2021 03:57 PM
1 | 1 | Alessia Bardi | h1. The OpenAIRE Research Graph |
---|---|---|---|
2 | |||
3 | The OpenAIRE Research Graph is one of the largest open scholarly record collections worldwide, key in fostering Open Science and establishing its practices in the daily research activities. |
||
4 | Conceived as a public and transparent good, populated out of data sources trusted by scientists, the Graph aims at bringing discovery, monitoring, and assessment of science back in the hands of the scientific community. |
||
5 | |||
6 | Imagine a vast collection of research products all linked together, contextualised and openly available. For the past ten years OpenAIRE has been working to gather this valuable record. It is a massive collection of metadata and links between scientific products such as articles, datasets, software, and other research products, entities like organisations, funders, funding streams, projects, communities, and data sources. |
||
7 | |||
8 | As of today, the OpenAIRE Research Graph aggregates around 450Mi metadata records with links collecting from 10K data sources trusted by scientists, including: |
||
9 | * Repositories registered in OpenDOAR or re3data.org |
||
10 | * Open Access journals registered in DOAJ |
||
11 | * Crossref |
||
12 | * Unpaywall |
||
13 | * ORCID |
||
14 | * Microsoft Academic Graph |
||
15 | * Datacite |
||
16 | |||
17 | After cleaning, deduplication, enrichment and full-text mining processes, the graph is analysed to produce statistics for OpenAIRE MONITOR (https://monitor.openaire.eu), the Open Science Observatory (https://osobservatory.openaire.eu), made discoverable via OpenAIRE EXPLORE (https://explore.openaire.eu) and programmatically accessible as described at https://develop.openaire.eu. |
||
18 | 3 | Alessia Bardi | Json dumps are also published on Zenodo. |
19 | 1 | Alessia Bardi | |
20 | 3 | Alessia Bardi | TODO: image of high-level data model (entities and semantic relationships, we can draw here: https://docs.google.com/drawings/d/1c4s7Pk2r9NgV_KXkmX6mwCKBIQ-yK3_m6xsxB-3Km1s/edit) |
21 | |||
22 | 1 | Alessia Bardi | h2. Graph Data Dumps |
23 | |||
24 | 2 | Alessia Bardi | In order to facilitate users, different dumps are available. All are available under the "Zenodo community called OpenAIRE Research Graph":https://zenodo.org/communities/openaire-research-graph. |
25 | Here we provide detailed documentation about the full dump: |
||
26 | |||
27 | * Json dump: https://doi.org/10.5281/zenodo.3516917 |
||
28 | * Json schema: https://doi.org/10.5281/zenodo.4238938 |
||
29 | |||
30 | [[Json schema]] |
||
31 | [[FAQ]] |
||
32 | 1 | Alessia Bardi | |
33 | h2. Graph provision processes |
||
34 | |||
35 | 16 | Alessia Bardi | [[OpenAIRE entity identifier and PID mapping policy]] |
36 | 10 | Alessia Bardi | |
37 | 11 | Alessia Bardi | h3. Aggregation business logic by major sources |
38 | |||
39 | 20 | Alessia Bardi | DOIBoost is the intersection among Crossref, Unpaywall, Microsoft Academic Graph and ORCID |
40 | 19 | Alessia Bardi | [[DOIBoost]] |
41 | 20 | Alessia Bardi | |
42 | [[Datacite]] |
||
43 | 11 | Alessia Bardi | |
44 | 21 | Alessia Bardi | [[EuropePMC]] |
45 | |||
46 | The strategy for the resolution of links between publications and datasets is defined by Scholexplorer |
||
47 | [[Scholexplorer]] |
||
48 | |||
49 | 3 | Alessia Bardi | h3. Deduplication business logic |
50 | |||
51 | h4. Deduplication business logic for research results |
||
52 | |||
53 | Metadata records about the same scholarly work can be collected from different providers. Each metadata record can possibly carry different information because, for example, some providers are not aware of links to projects, keywords or other details. Another common case is when OpenAIRE collects one metadata record from a repository about a pre-print and another record from a journal about the published article. For the provision of statistics, OpenAIRE must identify those cases and “merge” the two metadata records, so that the scholarly work is counted only once in the statistics OpenAIRE produces. |
||
54 | |||
55 | Duplicates among research results are identified among results of the same type (publications, datasets, software, other research products). If two duplicate results are aggregated one as a dataset and one as a software, for example, they will never be compared and they will never be identified as duplicates. |
||
56 | OpenAIRE supports different deduplication strategies based on the type of results. |
||
57 | |||
58 | *Methodology overview* |
||
59 | |||
60 | The deduplication process can be divided into two different phases: |
||
61 | * Candidate identification (clustering) |
||
62 | 6 | Alessia Bardi | * Decision tree |
63 | 10 | Alessia Bardi | * Creation of representative record |
64 | 3 | Alessia Bardi | |
65 | The implementation of each phase is different based on the type of results that are being processed. |
||
66 | |||
67 | |||
68 | *Strategy for publications* |
||
69 | |||
70 | 1 | Alessia Bardi | _Candidate identification (clustering)_ |
71 | 6 | Alessia Bardi | |
72 | 1 | Alessia Bardi | Due to the high number of metadata records collected by OpenAIRE, it would not be feasible to compute all possible comparisons between all metadata records. |
73 | 6 | Alessia Bardi | The goal of this phase is to limit the number of comparisons by creating groups (or clusters) of records that are likely “similar”. Every record can be added to more than one group. |
74 | The decision of inclusion in a group is performed by 2 clustering functions: |
||
75 | * Lowercase: doi (in pid list and alternate identifiers list) |
||
76 | * WordsStatsSuffixPrefixChain: suffixprefix with statistics on the full title (number_of_words & number_of_letters%10) |
||
77 | Example: |
||
78 | If title is : “Search for the Standard Model Higgs Boson” |
||
79 | 3 | Alessia Bardi | The clustering function produces 2 keys (i.e. adds the publication to two clusters): [5-3-seaardmod, 5-3-rchstadel] |
80 | |||
81 | 6 | Alessia Bardi | |
82 | _Desicision tree_ |
||
83 | |||
84 | For each pair of publications in a cluster the following strategy (depicted in the figure below) is applied. |
||
85 | Cross comparison of the pid lists (in the @pid@ and @alternateid@ elements). If 50% common pids, levenshtein distance on titles with low threshold (0.9). |
||
86 | Otherwise, check if the number of authors and the title version is equal. If so, levenshtein distance on titles with higher threshold (0.99). |
||
87 | 3 | Alessia Bardi | The publications are matched as duplicate if the distance is higher than the threshold, in every other case they are considered as distinct publications. |
88 | |||
89 | !dedup-results.png! |
||
90 | |||
91 | 10 | Alessia Bardi | _Creation of representative record_ |
92 | |||
93 | TODO |
||
94 | |||
95 | |||
96 | 3 | Alessia Bardi | *Strategy for datasets* |
97 | |||
98 | *Strategy for software* |
||
99 | |||
100 | *Strategy for other types of research products* |
||
101 | |||
102 | 8 | Alessia Bardi | *Clustering functions* |
103 | 3 | Alessia Bardi | |
104 | _NgramPairs_ |
||
105 | It produces a list of concatenations of a pair of ngrams generated from different words. |
||
106 | Example: |
||
107 | Input string: “Search for the Standard Model Higgs Boson” |
||
108 | 1 | Alessia Bardi | Parameters: ngram length = 3 |
109 | 8 | Alessia Bardi | List of ngrams: “sea”, “sta”, “mod”, “hig” |
110 | Ngram pairs: “seasta”, “stamod”, “modhig” |
||
111 | 3 | Alessia Bardi | |
112 | _SuffixPrefix_ |
||
113 | It produces ngrams pairs in a particular way: it concatenates the suffix of a string with the prefix of the next in the input string. |
||
114 | Example: |
||
115 | Input string: “Search for the Standard Model Higgs Boson” |
||
116 | 1 | Alessia Bardi | Parameters: suffix and prefix length = 3 |
117 | 3 | Alessia Bardi | Output list: “ardmod” (suffix of the word “Standard” + prefix of the word “Model”), “rchsta” (suffix of the word “Search” + prefix of the word “Standard”) |
118 | 1 | Alessia Bardi | |
119 | h3. TODOs |
||
120 | |||
121 | 10 | Alessia Bardi | * OpenAIRE entity identifier & PID mapping policy (started, to be completed by Claudio and/or Michele DB) |
122 | 1 | Alessia Bardi | * Aggregation business logic by major sources: |
123 | 15 | Alessia Bardi | ** -Unpaywall integration- |
124 | ** -Crossref integration- |
||
125 | ** -ORCID integration- |
||
126 | ** -Cross cleaning actions: hostedBy patch- |
||
127 | 1 | Alessia Bardi | ** Scholexplorer business logic (relationship resolution) |
128 | 3 | Alessia Bardi | ** DataCite |
129 | 1 | Alessia Bardi | ** EuropePMC |
130 | ** more…. |
||
131 | 10 | Alessia Bardi | * Deduplication business logic (started, to be completed by Michele DB) |
132 | 9 | Alessia Bardi | ** For research outputs ( -publications- , datasets, software, orp) |
133 | 1 | Alessia Bardi | ** For research organizations |
134 | * Enrichment |
||
135 | ** Mining business logic |
||
136 | ** Deduction-based inference |
||
137 | ** Propagation business logic |
||
138 | * Post-cleaning business logic |
||
139 | * FAQ |