A Walk-based Model on Entity Graphs for Relation Extraction
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We present a novel graph-based neural network model for relation extraction.Our model treats multiple pairs in a sentence simultaneously and considers interactions among them.All the entities in a sentence are placed as nodes in a fully-connected graph structure.The edges are represented with position-aware contexts around the entity pairs.In order to consider different relation paths between two entities, we construct up to l-length walks between each pair.The resulting walks are merged and iteratively used to update the edge representations into longer walks representations.We show that the model achieves performance comparable to the state-ofthe-art systems on the ACE 2005 dataset without using any external tools.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Knowledge Graph Embedding: A Survey of Approaches and Applications
Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2754499 · Cited by 2,654 · cited 2×
“, 2017) and the creation of knowledge graph embeddings (Wang et al., 2017; Shi and Weninger, 2017).”
BackgroundProjE: Embedding Projection for Knowledge Graph Completion
Shi, B., & Weninger, T. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10677 · Cited by 218
Cited by
Entity, Relation, and Event Extraction with Contextualized Span Representations
Wadden, D., Wennberg, U., Luan, Y., & Hajishirzi, H. (2019) · arXiv · doi:10.48550/arxiv.1909.03546 · Cited by 612
Entity, Relation, and Event Extraction with Contextualized Span Representations
Wadden, D., Wennberg, U., Luan, Y., & Hajishirzi, H. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1585 · Cited by 564
DocRED: A Large-Scale Document-Level Relation Extraction Dataset
Yao, Y., Ye, D., Li, P., Han, X., Lin, Y., Liu, Z., Liu, Z., Huang, L., Zhou, J., & Sun, M. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1074 · Cited by 550
“As a result, RE systems that model context information with algorithms of quadratic or even higher computational complexity such as (Sorokin and Gurevych, 2017; Christopoulou et al., 2018) are not efficient enough for document-level RE.”
BackgroundHow Does NLP Benefit Legal System: A Summary of Legal Artificial Intelligence
Zhong, H., Xiao, C., Tu, C., Zhang, T., Liu, Z., & Sun, M. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.466 · Cited by 367
Document-Level Relation Extraction with Adaptive Thresholding and Localized Context Pooling
Zhou, W., Huang, K., Ma, T., & Huang, J. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i16.17717 · Cited by 316
Metadata
- Authors
- Christopoulou, F., Miwa, M., & Ananiadou, S.
- Venue
- Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
- Published
- 2018
- Pages
- 81-88
- OpenAlex
- W2798393196
- Cited by
- 100
- References
- 3
- FWCI
- 6.97
- 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
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.