An unsupervised entity disambiguation method using Group Steiner Trees over knowledge graph subgraphs reports over 40% average improvement in Precision@1 over prior unsupervised baselines on four domain-specific datasets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unsupervised Named Entity Disambiguation for Low Resource Domains
An unsupervised entity disambiguation method using Group Steiner Trees over knowledge graph subgraphs reports over 40% average improvement in Precision@1 over prior unsupervised baselines on four domain-specific datasets.