Incorporating Relation Paths in Neural Relation Extraction
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Distantly supervised relation extraction has been widely used to find novel relational facts from plain text.To predict the relation between a pair of two target entities, existing methods solely rely on those direct sentences containing both entities.In fact, there are also many sentences containing only one of the target entities, which also provide rich useful information but not yet employed by relation extraction.To address this issue, we build inference chains between two target entities via intermediate entities, and propose a path-based neural relation extraction model to encode the relational semantics from both direct sentences and inference chains.Experimental results on realworld datasets show that, our model can make full use of those sentences containing only one target entity, and achieves significant and consistent improvements on relation extraction as compared with strong baselines.The source code of this paper can be obtained from https:// github.com/thunlp/PathNRE.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Freebase: a collaboratively created graph database for structuring human knowledge
Bollacker, K., Evans, C., Paritosh, P., Sturge, T., & Taylor, J. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376746 · Cited by 4,852 · cited 9×
“Typical KBs such as Freebase (Bollacker et al., 2008), DBpedia (Auer et al., 2007) and YAGO (Suchanek et al., 2007) usually describe knowledge as multirelational data and represent them as triple facts.”
BackgroundInfluentialModeling Relation Paths for Representation Learning of Knowledge Bases
Lin, Y., Liu, Z., Luan, H., Sun, M., Rao, S., & Liu, S. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1082 · Cited by 657 · cited 4×
“Inspired by work on relation path representation learning (Lin et al., 2015), our model first transforms relation r to its distributed”
BackgroundMethodInfluentialSelf-citation
Cited by
A Survey on Knowledge Graphs: Representation, Acquisition, and Applications
Ji, S., Pan, S., Cambria, E., Marttinen, P., & Yu, P. S. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3070843 · Cited by 2,947
Han, X., Zhu, H., Yu, P., Wang, Z., Yao, Y., Liu, Z., & Sun, M. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1514 · Cited by 914
Self-citationModeling Relation Paths for Knowledge Graph Completion
Shen, Y., Ding, N., Zheng, H.-T., Li, Y., & Yang, M. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2970044 · Cited by 153
Nguyen, D. Q., & Verspoor, K. (2018) · Proceedings of the BioNLP 2018 workshop · doi:10.18653/v1/w18-2314 · Cited by 67
Automated clinical knowledge graph generation framework for evidence based medicine.
Alam, F., Giglou, H. B., & Malik, K. M. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120964 · Cited by 27
Metadata
- Authors
- Zeng, W., Lin, Y., Liu, Z., & Sun, M.
- Venue
- Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing
- Published
- 2017
- Pages
- 1768-1777
- OpenAlex
- W2963454301
- Cited by
- 93
- References
- 2
- FWCI
- 7.24
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Incorporating Relation Paths in Neural Relation Extraction. https://app.cochat.ai/papers/10.18653/v1/d17-1186
- The paper
- Zeng, W., Lin, Y., Liu, Z., & Sun, M. (2017). Incorporating Relation Paths in Neural Relation Extraction. Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing. https://doi.org/10.18653/v1/d17-1186
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.