D-Net
/
openaire-graph-docs
6
1
Fork 5
Code Issues 5 Pull Requests 4 Packages Projects Releases 40 Wiki Activity

Add versionless doi for scholix

This commit is contained in:
Serafeim Chatzopoulos 2023-10-25 00:13:40 -07:00
parent 00a0f77ecb
commit 3f078bb26b
3 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/downloads/related-datasets.md
View File

@ -8,7 +8,7 @@ In this page, we list other related datasets; please refer to their respective s
## The dataset of ScholeXplorer
Dataset: https://zenodo.org/records/8074885
Dataset: https://zenodo.org/doi/10.5281/zenodo.1200252
Schema (Scholix version 3): https://doi.org/10.5281/zenodo.1120275

2
versioned_docs/version-6.0.0/downloads/related-datasets.md
View File

@ -8,7 +8,7 @@ In this page, we list other related datasets; please refer to their respective s
## The dataset of ScholeXplorer
Dataset: https://doi.org/10.5281/zenodo.6338616
Dataset: https://zenodo.org/doi/10.5281/zenodo.1200252
Schema (Scholix version 3): https://doi.org/10.5281/zenodo.1120275

5
versioned_docs/version-6.0.0/graph-production-workflow/enrichment-by-mining/citation_matching.md
View File

@ -1,6 +1,6 @@
# Citation matching
***Short description:*** During a citation matching task, bibliographic entries are linked to the documents that they reference. The citation matching module - one of the modules of the Information Inference Service (IIS) - receives as an input a list of documents accompanied by their metadata and bibliography. Among them, it discovers links described above and returns them as a list. It is worth mentioning that the implemented algorithm has been described in detail in [arXiv:1303.6906](https://arxiv.org/abs/1303.6906).
***Short description:*** During a citation matching task, bibliographic entries are linked to the documents that they reference. The citation matching module - one of the modules of the Information Inference Service (IIS) - receives as an input a list of documents accompanied by their metadata and bibliography. Among them, it discovers links described above and returns them as a list. It is worth mentioning that the implemented algorithm has been described in detail in [arXiv:1303.6906](https://arxiv.org/abs/1303.6906)[1].
***Algorithmic details:***
@ -35,6 +35,7 @@ names, we have taken longest common subsequence (LCS) of two strings into consid
***Environment:***
Java, Spark
***References:*** -
***References:***
* Fedoryszak, M., Tkaczyk, D., Bolikowski, Ł. (2013). Large Scale Citation Matching Using Apache Hadoop. In: Aalberg, T., Papatheodorou, C., Dobreva, M., Tsakonas, G., Farrugia, C.J. (eds) Research and Advanced Technology for Digital Libraries. TPDL 2013. Lecture Notes in Computer Science, vol 8092. Springer, Berlin, Heidelberg. [https://doi.org/10.1007/978-3-642-40501-3_37](https://doi.org/10.1007/978-3-642-40501-3_37)
***Authority:*** ICM • ***License:*** AGPL-3.0 • ***Code:*** [CoAnSys/citation-matching](https://github.com/CeON/CoAnSys/tree/master/citation-matching)