From f1938bd15976fe09db8b42a73e378083167f1d00 Mon Sep 17 00:00:00 2001 From: Serafeim Chatzopoulos Date: Mon, 16 Oct 2023 17:25:53 +0300 Subject: [PATCH] Add citation_matching.md changes to current release --- .../enrichment-by-mining/citation_matching.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/versioned_docs/version-6.0.0/graph-production-workflow/enrichment-by-mining/citation_matching.md b/versioned_docs/version-6.0.0/graph-production-workflow/enrichment-by-mining/citation_matching.md index 01fcf37..9b3582b 100644 --- a/versioned_docs/version-6.0.0/graph-production-workflow/enrichment-by-mining/citation_matching.md +++ b/versioned_docs/version-6.0.0/graph-production-workflow/enrichment-by-mining/citation_matching.md @@ -1,7 +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. In this document we shall evaluate if the module has been properly integrated with the whole -system and assess the accuracy of the algorithm used. It is worth mentioning that the implemented algorithm has been described in detail in arXiv:1303.6906 [cs.IR]1. However, in the referenced paper the algorithm was tested on small datasets, but here we will focus on larger datasets, which are expected to be analysed by the system in the production environment. +***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). ***Algorithmic details:***