Inductive Learning on Heterogeneous Graphs Enhanced by LLMs for Software Mention Detection
This paper explores the synergy between Knowledge Graphs (KGs), Graph Machine Learning (Graph ML), and Large Language Models (LLMs) for multilingual Named Entity Recognition (NER) and Relation Extraction (RE), specifically targeting software mentions within the SOMD 2025 challenge.We propose a methodology where documents are first transformed into heterogeneous KGs enriched with linguistic features (Universal Dependencies) and external knowledge (entity linking).An inductive GraphSAGE model, operating on PyTorch Geometric's 'HeteroData' structure with dynamically generated multilingual embeddings, performs node classification tasks.For NER, Graph ML identifies candidate entities and types, with an Large Language Model (LLM) (DeepSeek v3) acting as a validation layer.For RE, Graph ML predicts dependency path convergence points indicative of relations, while the LLM classifies the relation type and direction based on entity context.Our results demonstrate the potential of this hybrid approach, showing significant performance gains post-competition (NER Phase 2 Macro F1 improved to 43.6% from 29.5%, RE Phase 1 33.6%Macro F1), which are already described in this paper, and highlighting the benefits of integrating structured graph learning with LLM reasoning for information extraction.
Authors
- Gabriel Silva (ORCID: https://orcid.org/0000-0001-6798-9827)
- Marlene Amorim (ORCID: https://orcid.org/0000-0002-0901-0614)
- António Teixeira (ORCID: https://orcid.org/0000-0002-7675-1236)
- Mário Rodriges
Publication Details
- Published
- 2025-01-01
- DOI
- https://doi.org/10.18653/v1/2025.sdp-1.16
- Primary Topic
- Software Reliability and Analysis Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Fundação para a Ciência e a Tecnologia