---
title: "Attention Guided Graph Convolutional Networks for — Guo 2019"
description: "The paper addresses relation extraction, which means identifying how entities in text are related."
authors: ["Zhijiang Guo", "Yan Zhang", "Wei Lu"]
year: 2019
venue: "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics"
source: "https://aclanthology.org/P19-1024/"
doi: "10.18653/v1/p19-1024"
licence: "CC BY 4.0 (ACL Anthology)"
licence_url: "https://creativecommons.org/licenses/by/4.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/guo-2019-attention-guided-graph-convolutional-networks/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/guo-2019-attention-guided-graph-convolutional-networks/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2019](https://md.research.elamur.ai/free/en/papers/2019/) / Attention Guided Graph Convolutional Networks for Relation Extraction

# Attention Guided Graph Convolutional Networks for Relation Extraction

**Authors:** [Zhijiang Guo](https://md.research.elamur.ai/free/en/authors/zhijiang-guo/), [Yan Zhang](https://md.research.elamur.ai/free/en/authors/yan-zhang/), [Wei Lu](https://md.research.elamur.ai/free/en/authors/wei-lu/) · **Year:** 2019 · **Venue:** Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · **Licence:** [CC BY 4.0 (ACL Anthology)](https://creativecommons.org/licenses/by/4.0/)

**Links:** [Publisher's page](https://aclanthology.org/P19-1024/) · [PDF](https://aclanthology.org/P19-1024.pdf) · [DOI 10.18653/v1/p19-1024](https://doi.org/10.18653/v1/p19-1024) · [OpenAlex](https://openalex.org/W2952768212)

**Citations:** 522 citations (openalex-snapshot · 2026-10-14) · [75](#cited-by) in our library, of the 140884 papers whose bibliographies we read

## Summary
The paper addresses relation extraction, which means identifying how entities in text are related. Dependency trees help with this task, but earlier systems relied on fixed pruning rules, such as keeping only the shortest dependency path, the LCA subtree, or tokens within distance K of that path. These rules can discard words that matter. The authors propose Attention Guided Graph Convolutional Networks (AGGCNs), which take the complete dependency tree as input. Multi-head self-attention turns the tree into several fully connected graphs with learned edge weights. This acts as a learned "soft pruning" that decides how much each connection matters. Dense connections make deep GCN stacks trainable, so the model can capture both nearby and distant dependencies. On cross-sentence n-ary relation extraction, AGGCN beats the previous best accuracy on multi-class ternary and binary settings by about 8% and 6%. It also outperforms earlier models on the large sentence-level TACRED benchmark. The work suggests that learning to weight syntactic structure is more effective than hand-crafted pruning, and it adds no computational overhead compared with earlier GCNs.

## Key points
- **Architecture:** AGGCN stacks M identical blocks. Each block has an attention guided layer, which builds N weighted adjacency matrices via multi-head attention. It also has N densely connected GCN layers and a linear combination layer. The original tree adjacency serves as initialization, and attention is applied from the second block onward.
- **Efficiency:** The attention-derived matrices are the same n × n size as the original adjacency matrix. As a result, the model costs no more to compute than previous GCNs and, unlike Tree-LSTM, can run in parallel.
- **Pruning experiments:** C-AGGCN outperforms the prior state-of-the-art C-GCN (Zhang et al., 2018) even when given pruned trees with various K values. Its advantage over C-GCN grows with sentence length.
- **Data efficiency:** Trained on only 80% of the training data, C-AGGCN reaches 66.5 F1, which beats C-GCN trained on the full set.
- **Ablation and code:** Removing the attention guided or densely connected layers hurts results, and the attention layer matters more. Dropping the feed-forward layer lowers F1 to 67.8. The code is PyTorch-based and released at statnlp.org.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

Fields: [Natural language processing](https://md.research.elamur.ai/free/en/shelves/nlp/)

## Cited by

Cited by

75 papers of our library cite it (of the 140884 whose bibliographies we read); 1 of them have a page here, 74 not yet.

- [Reasoning with Latent Structure Refinement for Document-Level Relation Extraction](https://md.research.elamur.ai/free/en/papers/nan-2020-reasoning-latent-structure-refinement-document/)

## Cite

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@inproceedings{guo2019attention,
  title = {{Attention Guided Graph Convolutional Networks for Relation Extraction}},
  author = {Guo, Zhijiang and Zhang, Yan and Lu, Wei},
  booktitle = {Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics},
  year = {2019},
  doi = {10.18653/v1/p19-1024},
  url = {https://doi.org/10.18653/v1/p19-1024}
}
```

- [← previous Assessing BERT's Syntactic Abilities](https://md.research.elamur.ai/free/en/papers/goldberg-2019-assessing-bert-s-syntactic-abilities/)
- [next → Attention is not Explanation](https://md.research.elamur.ai/free/en/papers/jain-2019-attention-is-not-explanation/)
- [↑ back to papers of 2019](https://md.research.elamur.ai/free/en/papers/2019/)

## References

43 references, 21 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Ryan T. McDonald, Fernando Pereira, Seth Kulick, R. Scott Winters, Yang Jin, and Peter S. White. 2005. Simple algorithms for complex relation extraction with applications to biomedical ie. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Ryan+T%2E+McDonald%2C+Fernando+Pereira%2C+Seth+Kulick%2C+R%2E+Scott+Winters%2C+Yang+Jin%2C+and+Peter+S%2E+White%2E+2005%2E+Simple+algorithms+for+complex+relation+extraction+with+applications+to+biomedical+ie%2E+In+Proc%2E+of)
2. Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2015. Neural machine translation by jointly learning to align and translate. In Proc. of ICLR. [find](https://scholar.google.com/scholar?q=Dzmitry+Bahdanau%2C+Kyunghyun+Cho%2C+and+Yoshua+Bengio%2E+2015%2E+Neural+machine+translation+by+jointly+learning+to+align+and+translate%2E+In+Proc%2E+of+ICLR%2E) [our card](https://md.research.elamur.ai/free/en/papers/bahdanau-2014-neural-machine-translation-jointly-learning/)
3. Joost Bastings, Ivan Titov, Wilker Aziz, Diego Marcheggiani, and Khalil Sima’an. 2017. Graph convolutional encoders for syntax-aware neural machine translation. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Joost+Bastings%2C+Ivan+Titov%2C+Wilker+Aziz%2C+Diego+Marcheggiani%2C+and+Khalil+Sima%E2%80%99an%2E+2017%2E+Graph+convolutional+encoders+for+syntax%2Daware+neural+machine+translation%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/bastings-2017-graph-convolutional-encoders-syntax-aware/)
4. Mike Mintz, Steven Bills, Rion Snow, and Daniel Jurafsky. 2009. Distant supervision for relation extraction without labeled data. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Mike+Mintz%2C+Steven+Bills%2C+Rion+Snow%2C+and+Daniel+Jurafsky%2E+2009%2E+Distant+supervision+for+relation+extraction+without+labeled+data%2E+In+Proc%2E+of+ACL%2E)
5. Joan Bruna. 2014. Spectral networks and deep locally connected networks on graphs. In Proc. of ICLR. [find](https://scholar.google.com/scholar?q=Joan+Bruna%2E+2014%2E+Spectral+networks+and+deep+locally+connected+networks+on+graphs%2E+In+Proc%2E+of+ICLR%2E)
6. Makoto Miwa and Mohit Bansal. 2016. End-to-end relation extraction using lstms on sequences and tree structures. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Makoto+Miwa+and+Mohit+Bansal%2E+2016%2E+End%2Dto%2Dend+relation+extraction+using+lstms+on+sequences+and+tree+structures%2E+In+Proc%2E+of+ACL%2E) [our card](https://md.research.elamur.ai/free/en/papers/miwa-2016-end-end-relation-extraction-lstms/)
7. Razvan C. Bunescu and Raymond J. Mooney. 2005. A shortest path dependency kernel for relation extraction. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Razvan+C%2E+Bunescu+and+Raymond+J%2E+Mooney%2E+2005%2E+A+shortest+path+dependency+kernel+for+relation+extraction%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/bunescu-2005-shortest-path-dependency-kernel-relation/)
8. Thien Huu Nguyen and Ralph Grishman. 2015. Relation extraction: Perspective from convolutional neural networks. In Proc. of VS@NAACL-HLT. [find](https://scholar.google.com/scholar?q=Thien+Huu+Nguyen+and+Ralph+Grishman%2E+2015%2E+Relation+extraction%3A+Perspective+from+convolutional+neural+networks%2E+In+Proc%2E+of+VS%40NAACL%2DHLT%2E) [our card](https://md.research.elamur.ai/free/en/papers/nguyen-2015-relation-extraction-perspective-convolutional-neural/)
9. Jianpeng Cheng, Li Dong, and Mirella Lapata. 2016. Long short-term memory-networks for machine reading. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Jianpeng+Cheng%2C+Li+Dong%2C+and+Mirella+Lapata%2E+2016%2E+Long+short%2Dterm+memory%2Dnetworks+for+machine+reading%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/cheng-2016-long-short-term-memory-networks/)
10. Adam Paszke, Sam Gross, and Adam Lerer. 2017. Automatic differentiation in pytorch. In Proc. of workshop on NeurIPS. [find](https://scholar.google.com/scholar?q=Adam+Paszke%2C+Sam+Gross%2C+and+Adam+Lerer%2E+2017%2E+Automatic+differentiation+in+pytorch%2E+In+Proc%2E+of+workshop+on+NeurIPS%2E)
11. Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In Proc. of NeurIPS. [find](https://scholar.google.com/scholar?q=Michae%CC%88l+Defferrard%2C+Xavier+Bresson%2C+and+Pierre+Vandergheynst%2E+2016%2E+Convolutional+neural+networks+on+graphs+with+fast+localized+spectral+filtering%2E+In+Proc%2E+of+NeurIPS%2E) [our card](https://md.research.elamur.ai/free/en/papers/defferrard-2016-convolutional-neural-networks-graphs-fast/)
12. Nanyun Peng, Hoifung Poon, Chris Quirk, Kristina Toutanova, and Wen tau Yih. 2017. Cross-sentence n-ary relation extraction with graph lstms. Transactions of the Association for Computational Linguistics, 5:101–115. [find](https://scholar.google.com/scholar?q=Nanyun+Peng%2C+Hoifung+Poon%2C+Chris+Quirk%2C+Kristina+Toutanova%2C+and+Wen+tau+Yih%2E+2017%2E+Cross%2Dsentence+n%2Dary+relation+extraction+with+graph+lstms%2E+Transactions+of+the+Association+for+Computational+Linguist) [our card](https://md.research.elamur.ai/free/en/papers/peng-2017-cross-sentence-n-ary-relation/)
13. Michele Gori, Gabriele Monfardini, and Franco Scarselli. 2005. A new model for learning in graph domains. In Proc. of IJCNN. [find](https://scholar.google.com/scholar?q=Michele+Gori%2C+Gabriele+Monfardini%2C+and+Franco+Scarselli%2E+2005%2E+A+new+model+for+learning+in+graph+domains%2E+In+Proc%2E+of+IJCNN%2E)
14. Jeffrey Pennington, Richard Socher, and Christopher D. Manning. 2014. Glove: Global vectors for word representation. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Jeffrey+Pennington%2C+Richard+Socher%2C+and+Christopher+D%2E+Manning%2E+2014%2E+Glove%3A+Global+vectors+for+word+representation%2E+In+Proc%2E+of+EMNLP%2E)
15. Zhijiang Guo, Yan Zhang, Zhiyang Teng, and Wei Lu. 2019. Densely connected graph convolutional networks for graph-to-sequence learning. Transactions of the Association of Computational Linguistics. [find](https://scholar.google.com/scholar?q=Zhijiang+Guo%2C+Yan+Zhang%2C+Zhiyang+Teng%2C+and+Wei+Lu%2E+2019%2E+Densely+connected+graph+convolutional+networks+for+graph%2Dto%2Dsequence+learning%2E+Transactions+of+the+Association+of+Computational+Linguistics%2E)
16. Chris Quirk and Hoifung Poon. 2017. Distant supervision for relation extraction beyond the sentence boundary. In Proc. of EACL. [find](https://scholar.google.com/scholar?q=Chris+Quirk+and+Hoifung+Poon%2E+2017%2E+Distant+supervision+for+relation+extraction+beyond+the+sentence+boundary%2E+In+Proc%2E+of+EACL%2E)
17. Mikael Henaff, Joan Bruna, and Yann LeCun. 2015. Deep convolutional networks on graph-structured data. arXiv preprint. [find](https://scholar.google.com/scholar?q=Mikael+Henaff%2C+Joan+Bruna%2C+and+Yann+LeCun%2E+2015%2E+Deep+convolutional+networks+on+graph%2Dstructured+data%2E+arXiv+preprint%2E)
18. Bryan Rink and Sanda M. Harabagiu. 2010. Utd: Classifying semantic relations by combining lexical and semantic resources. In SemEval@ACL. [find](https://scholar.google.com/scholar?q=Bryan+Rink+and+Sanda+M%2E+Harabagiu%2E+2010%2E+Utd%3A+Classifying+semantic+relations+by+combining+lexical+and+semantic+resources%2E+In+SemEval%40ACL%2E)
19. Iris Hendrickx, Su Nam Kim, Zornitsa Kozareva, Preslav Nakov, Diarmuid Ó Séaghdha, Sebastian Padó, Marco Pennacchiotti, Lorenza Romano, and Stan Szpakowicz. 2010. Semeval-2010 task 8: Multi-way classification of semantic relations between pairs of nominals. In SemEval@ACL. [find](https://scholar.google.com/scholar?q=Iris+Hendrickx%2C+Su+Nam+Kim%2C+Zornitsa+Kozareva%2C+Preslav+Nakov%2C+Diarmuid+O%CC%81+Se%CC%81aghdha%2C+Sebastian+Pado%CC%81%2C+Marco+Pennacchiotti%2C+Lorenza+Romano%2C+and+Stan+Szpakowicz%2E+2010%2E+Semeval%2D2010+task+8%3A+Multi%2Dway+cla) [our card](https://md.research.elamur.ai/free/en/papers/hendrickx-2010-semeval-2010-task-8-multi/)
20. Adam Santoro, David Raposo, David G. T. Barrett, Mateusz Malinowski, Razvan Pascanu, Peter W. Battaglia, and Timothy P. Lillicrap. 2017. A simple neural network module for relational reasoning. In Proc. of NeurIPS. [find](https://scholar.google.com/scholar?q=Adam+Santoro%2C+David+Raposo%2C+David+G%2E+T%2E+Barrett%2C+Mateusz+Malinowski%2C+Razvan+Pascanu%2C+Peter+W%2E+Battaglia%2C+and+Timothy+P%2E+Lillicrap%2E+2017%2E+A+simple+neural+network+module+for+relational+reasoning%2E+In+Pro) [our card](https://md.research.elamur.ai/free/en/papers/santoro-2017-simple-neural-network-module-relational/)
21. Linfeng Song, Yue Zhang, Zhiguo Wang, and Daniel Gildea. 2018a. A graph-to-sequence model for amr-to-text generation. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Linfeng+Song%2C+Yue+Zhang%2C+Zhiguo+Wang%2C+and+Daniel+Gildea%2E+2018a%2E+A+graph%2Dto%2Dsequence+model+for+amr%2Dto%2Dtext+generation%2E+In+Proc%2E+of+ACL%2E) [our card](https://md.research.elamur.ai/free/en/papers/song-2018-graph-sequence-model-amr-text/)
22. Gao Huang, Zhuang Liu, Laurens van der Maaten, and Kilian Q. Weinberger. 2017. Densely connected convolutional networks. In Proc. of CVPR. [find](https://scholar.google.com/scholar?q=Gao+Huang%2C+Zhuang+Liu%2C+Laurens+van+der+Maaten%2C+and+Kilian+Q%2E+Weinberger%2E+2017%2E+Densely+connected+convolutional+networks%2E+In+Proc%2E+of+CVPR%2E)
23. Linfeng Song, Yue Zhang, Zhiguo Wang, and Daniel Gildea. 2018b. N-ary relation extraction using graph state lstm. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Linfeng+Song%2C+Yue+Zhang%2C+Zhiguo+Wang%2C+and+Daniel+Gildea%2E+2018b%2E+N%2Dary+relation+extraction+using+graph+state+lstm%2E+In+Proc%2E+of+EMNLP%2E)
24. Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In Proc. of ICLR. [find](https://scholar.google.com/scholar?q=Thomas+N%2E+Kipf+and+Max+Welling%2E+2017%2E+Semi%2Dsupervised+classification+with+graph+convolutional+networks%2E+In+Proc%2E+of+ICLR%2E) [our card](https://md.research.elamur.ai/free/en/papers/kipf-2016-semi-supervised-classification-graph-convolutional/)
25. Kenton Lee, Luheng He, Mike Lewis, and Luke S. Zettlemoyer. 2017. End-to-end neural coreference resolution. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Kenton+Lee%2C+Luheng+He%2C+Mike+Lewis%2C+and+Luke+S%2E+Zettlemoyer%2E+2017%2E+End%2Dto%2Dend+neural+coreference+resolution%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/lee-2017-end-end-neural-coreference-resolution/)
26. Kai Sheng Tai, Richard Socher, and Christopher D. Manning. 2015. Improved semantic representations from tree-structured long short-term memory networks. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Kai+Sheng+Tai%2C+Richard+Socher%2C+and+Christopher+D%2E+Manning%2E+2015%2E+Improved+semantic+representations+from+tree%2Dstructured+long+short%2Dterm+memory+networks%2E+In+Proc%2E+of+ACL%2E)
27. Yang Liu, Furu Wei, Sujian Li, Heng Ji, Ming Zhou, and Houfeng Wang. 2015. A dependency-based neural network for relation classification. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Yang+Liu%2C+Furu+Wei%2C+Sujian+Li%2C+Heng+Ji%2C+Ming+Zhou%2C+and+Houfeng+Wang%2E+2015%2E+A+dependency%2Dbased+neural+network+for+relation+classification%2E+In+Proc%2E+of+ACL%2E)
28. Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Proc. of NeurIPS. [find](https://scholar.google.com/scholar?q=Ashish+Vaswani%2C+Noam+Shazeer%2C+Niki+Parmar%2C+Jakob+Uszkoreit%2C+Llion+Jones%2C+Aidan+N%2E+Gomez%2C+Lukasz+Kaiser%2C+and+Illia+Polosukhin%2E+2017%2E+Attention+is+all+you+need%2E+In+Proc%2E+of+NeurIPS%2E)
29. Diego Marcheggiani and Ivan Titov. 2017. Encoding sentences with graph convolutional networks for semantic role labeling. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Diego+Marcheggiani+and+Ivan+Titov%2E+2017%2E+Encoding+sentences+with+graph+convolutional+networks+for+semantic+role+labeling%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/marcheggiani-2017-encoding-sentences-graph-convolutional-networks/)
30. Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio. 2018. Graph attention networks. In Proc. of ICLR. [find](https://scholar.google.com/scholar?q=Petar+Velickovic%2C+Guillem+Cucurull%2C+Arantxa+Casanova%2C+Adriana+Romero%2C+Pietro+Lio%CC%80%2C+and+Yoshua+Bengio%2E+2018%2E+Graph+attention+networks%2E+In+Proc%2E+of+ICLR%2E)
31. Patrick Verga, Emma Strubell, and Andrew McCallum. 2018. Simultaneously self-attending to all mentions for full-abstract biological relation extraction. In Proc. of NAACL-HLT. [find](https://scholar.google.com/scholar?q=Patrick+Verga%2C+Emma+Strubell%2C+and+Andrew+McCallum%2E+2018%2E+Simultaneously+self%2Dattending+to+all+mentions+for+full%2Dabstract+biological+relation+extraction%2E+In+Proc%2E+of+NAACL%2DHLT%2E)
32. Ngoc Thang Vu, Heike Adel, Pankaj Gupta, and Hinrich Schütze. 2016. Combining recurrent and convolutional neural networks for relation classification. In Proc. of NAACL-HLT. [find](https://scholar.google.com/scholar?q=Ngoc+Thang+Vu%2C+Heike+Adel%2C+Pankaj+Gupta%2C+and+Hinrich+Schu%CC%88tze%2E+2016%2E+Combining+recurrent+and+convolutional+neural+networks+for+relation+classification%2E+In+Proc%2E+of+NAACL%2DHLT%2E)
33. Linlin Wang, Zhu Cao, Gerard de Melo, and Zhiyuan Liu. 2016. Relation classification via multi-level attention cnns. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Linlin+Wang%2C+Zhu+Cao%2C+Gerard+de+Melo%2C+and+Zhiyuan+Liu%2E+2016%2E+Relation+classification+via+multi%2Dlevel+attention+cnns%2E+In+Proc%2E+of+ACL%2E) [our card](https://md.research.elamur.ai/free/en/papers/wang-2016-relation-classification-multi-level-attention/)
34. Kelvin Xu, Jimmy Ba, Ryan Kiros, Kyunghyun Cho, Aaron C. Courville, Ruslan Salakhutdinov, Richard S. Zemel, and Yoshua Bengio. 2015a. Show, attend and tell: Neural image caption generation with visual attention. In Proc. of ICML. [find](https://scholar.google.com/scholar?q=Kelvin+Xu%2C+Jimmy+Ba%2C+Ryan+Kiros%2C+Kyunghyun+Cho%2C+Aaron+C%2E+Courville%2C+Ruslan+Salakhutdinov%2C+Richard+S%2E+Zemel%2C+and+Yoshua+Bengio%2E+2015a%2E+Show%2C+attend+and+tell%3A+Neural+image+caption+generation+with+visual) [our card](https://md.research.elamur.ai/free/en/papers/xu-2015-show-attend-tell-neural-image/)
35. Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken ichi Kawarabayashi, and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In Proc. of ICML. [find](https://scholar.google.com/scholar?q=Keyulu+Xu%2C+Chengtao+Li%2C+Yonglong+Tian%2C+Tomohiro+Sonobe%2C+Ken+ichi+Kawarabayashi%2C+and+Stefanie+Jegelka%2E+2018%2E+Representation+learning+on+graphs+with+jumping+knowledge+networks%2E+In+Proc%2E+of+ICML%2E)
36. Kun Xu, Yansong Feng, Songfang Huang, and Dongyan Zhao. 2015b. Semantic relation classification via convolutional neural networks with simple negative sampling. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Kun+Xu%2C+Yansong+Feng%2C+Songfang+Huang%2C+and+Dongyan+Zhao%2E+2015b%2E+Semantic+relation+classification+via+convolutional+neural+networks+with+simple+negative+sampling%2E+In+Proc%2E+of+EMNLP%2E)
37. Yan Xu, Lili Mou, Ge Li, Yunchuan Chen, Hao Peng, and Zhi Jin. 2015c. Classifying relations via long short term memory networks along shortest dependency paths. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Yan+Xu%2C+Lili+Mou%2C+Ge+Li%2C+Yunchuan+Chen%2C+Hao+Peng%2C+and+Zhi+Jin%2E+2015c%2E+Classifying+relations+via+long+short+term+memory+networks+along+shortest+dependency+paths%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/xu-2015-classifying-relations-long-short-term/)
38. Mo Yu, Wenpeng Yin, Kazi Saidul Hasan, Cı́cero Nogueira dos Santos, Bing Xiang, and Bowen Zhou. 2017. Improved neural relation detection for knowledge base question answering. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Mo+Yu%2C+Wenpeng+Yin%2C+Kazi+Saidul+Hasan%2C+C%C4%B1%CC%81cero+Nogueira+dos+Santos%2C+Bing+Xiang%2C+and+Bowen+Zhou%2E+2017%2E+Improved+neural+relation+detection+for+knowledge+base+question+answering%2E+In+Proc%2E+of+ACL%2E)
39. Dmitry Zelenko, Chinatsu Aone, and Anthony Richardella. 2002. Kernel methods for relation extraction. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Dmitry+Zelenko%2C+Chinatsu+Aone%2C+and+Anthony+Richardella%2E+2002%2E+Kernel+methods+for+relation+extraction%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/zelenko-2002-kernel-methods-relation-extraction/)
40. Daojian Zeng, Kang Liu, Siwei Lai, Guangyou Zhou, and Jian Zhao. 2014. Relation classification via convolutional deep neural network. In Proc. of COL-ING. [find](https://scholar.google.com/scholar?q=Daojian+Zeng%2C+Kang+Liu%2C+Siwei+Lai%2C+Guangyou+Zhou%2C+and+Jian+Zhao%2E+2014%2E+Relation+classification+via+convolutional+deep+neural+network%2E+In+Proc%2E+of+COL%2DING%2E) [our card](https://md.research.elamur.ai/free/en/papers/zeng-2014-relation-classification-convolutional-deep-neural/)
41. Yuhao Zhang, Peng Qi, and Christopher D. Manning. 2018. Graph convolution over pruned dependency trees improves relation extraction. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Yuhao+Zhang%2C+Peng+Qi%2C+and+Christopher+D%2E+Manning%2E+2018%2E+Graph+convolution+over+pruned+dependency+trees+improves+relation+extraction%2E+In+Proc%2E+of+EMNLP%2E) [our card](https://md.research.elamur.ai/free/en/papers/zhang-2018-graph-convolution-over-pruned-dependency/)
42. Yuhao Zhang, Victor Zhong, Danqi Chen, Gabor Angeli, and Christopher D. Manning. 2017. Position-aware attention and supervised data improve slot filling. In Proc. of EMNLP. [find](https://scholar.google.com/scholar?q=Yuhao+Zhang%2C+Victor+Zhong%2C+Danqi+Chen%2C+Gabor+Angeli%2C+and+Christopher+D%2E+Manning%2E+2017%2E+Position%2Daware+attention+and+supervised+data+improve+slot+filling%2E+In+Proc%2E+of+EMNLP%2E)
43. Peng Zhou, Wei Shi, Jun Tian, Zhenyu Qi, Bingchen Li, Hongwei Hao, and Bo Xu. 2016. Attention-based bidirectional long short-term memory networks for relation classification. In Proc. of ACL. [find](https://scholar.google.com/scholar?q=Peng+Zhou%2C+Wei+Shi%2C+Jun+Tian%2C+Zhenyu+Qi%2C+Bingchen+Li%2C+Hongwei+Hao%2C+and+Bo+Xu%2E+2016%2E+Attention%2Dbased+bidirectional+long+short%2Dterm+memory+networks+for+relation+classification%2E+In+Proc%2E+of+ACL%2E) [our card](https://md.research.elamur.ai/free/en/papers/zhou-2016-attention-based-bidirectional-long-short/)
