This work constructs multiple entity co-occurrence networks using two tools (Fast Entity Linker and DBpedia Spotlight) and numerous confidence thresholds for each and proves that standard network analysis metrics, such as size, connectivity, and centrality are all heavily influenced by the choice of entity linking tool.
To combat query drift resulting from the large volume of text, either in the source news article itself or in social media utterances explicitly linked to it, a graph-based term selection method is shown to help improve both effectiveness andency.
A fragment retrieval method for document corpora in which the meaning of a fragment is determined by its local content, position in the document hierarchy and links to other fragments, based on a joint representation of the corpus as a tree of structural units and a directed link graph.
M. Ulizko, A. Beresnev, V. V. Zhukov et al.· Scientific and Technical Jou...· 0 citations
The results show that the proposed methodology is not limited to a single algorithm and permits the combination of direct extraction, specialized models, multi-stage pipelines, and OWL ontologies, which can be applied to the analysis of scientific, technical, and regulatory texts in a secure local environment.
O. I. Zakharova, K. N. Ivanov, S. P. Levashkin et al.· COMPUTATIONAL MATHEMATICS AN...· 0 citations
An information workflow, i.e., inc-LPCDAG (\underline{inc}remental Link Prediction and Community Detection in Attributed Graphs) is proposed, and results demonstrate the effectiveness of the proposed workflow by analysing and understanding structural and behavioural processes.
Interaction-finder is a tool that automates the identification of interactions between biological entities, given a topic string and user-defined entity types, it discovers relevant literature through llm-guided iterative search, extracts candidate associations from full-text articles, and produces a ranked list where...
Source localization aims to locate the origin of failures and rumors in complex graphs, which has broad implications for financial systems. However, previous methods commonly assume that the propagation graph is known in advance. In practice, the graph on which failures or information propagate depends on relationships...
