FineREX: Fine-Tuned NER-RE for Human Smuggling Knowledge Graphs
About
Court proceedings contain valuable evidence about human smuggling networks, but this information is often buried within unstructured, jargon-heavy legal documents. While large language models (LLMs) can support knowledge graph construction through automated information extraction, existing approaches rely on general-purpose models that are not tailored to the entity and relationship definitions required in this domain. We introduce FineREX, a streamlined knowledge graph construction pipeline built around a fine-tuned LLM for named entity recognition and relationship extraction (NER-RE). Using a manually annotated dataset of $512$ text chunks, FineREX achieves absolute improvements of 15.50% and 31.46% in entity and relationship F1-score, respectively, compared to a larger general-purpose baseline. These gains translate into higher-quality knowledge graphs, reducing legal noise by nearly half and lowering node duplication on long documents from 17.78% to 11.17%. By eliminating document rewriting and redundant extraction stages, FineREX also reduces end-to-end processing time by 50.0%. Our results demonstrate that domain-specific fine-tuning can substantially outperform larger general-purpose models while improving both the quality and efficiency of knowledge graph construction for illicit network analysis.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Knowledge Graph Construction | Human smuggling court proceedings | Processing Time (minutes)7.05 | 51 | |
| Entity extraction | Human smuggling court documents (test) | Precision77.6 | 3 | |
| Relationship Extraction | Human smuggling court documents (test) | Precision53.43 | 3 | |
| Knowledge Graph Construction | Short Court Cases | Node Duplication13.91 | 3 | |
| Graph Node Duplication | Long Court Cases (test) | Total Nodes38.67 | 3 | |
| Legal Noise Identification | Long Court Cases (test) | Total Nodes38.67 | 3 |