[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3308558.3313573acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Learning Dual Retrieval Module for Semi-supervised Relation Extraction

Published: 13 May 2019 Publication History

Abstract

Relation extraction is an important task in structuring content of text data, and becomes especially challenging when learning with weak supervision-where only a limited number of labeled sentences are given and a large number of unlabeled sentences are available. Most existing work exploits unlabeled data based on the ideas of self-training (i.e., bootstrapping a model) and self-ensembling (e.g., ensembling multiple model variants). However, these methods either suffer from the issue of semantic drift, or do not fully capture the problem characteristics of relation extraction. In this paper, we leverage a key insight that retrieving sentences expressing a relation is a dual task of predicting the relation label for a given sentence-two tasks are complementary to each other and can be optimized jointly for mutual enhancement. To model this intuition, we propose DualRE, a principled framework that introduces a retrieval module which is jointly trained with the original relation prediction module. In this way, high-quality samples selected by the retrieval module from unlabeled data can be used to improve the prediction module, and vice versa. Experimental results1 on two public datasets as well as case studies demonstrate the effectiveness of the DualRE approach.

References

[1]
Eugene Agichtein and Luis Gravano. 2000. Snowball: Extracting relations from large plain-text collections. In ACM DL'00. 85-94.
[2]
Avrim Blum and Tom Mitchell. 1998. Combining labeled and unlabeled data with co-training. In COLT'98. 92-100.
[3]
Sergey Brin. 1998. Extracting patterns and relations from the world wide web. In International Workshop on The World Wide Web and Databases. Springer, 172-183.
[4]
Razvan C Bunescu and Raymond J Mooney. 2005. A shortest path dependency kernel for relation extraction. In HLT-EMNLP'05. 724-731.
[5]
Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. 2005. Learning to rank using gradient descent. In Proceedings of the 22nd international conference on Machine learning. ACM, 89-96.
[6]
Yunbo Cao, Jun Xu, Tie-Yan Liu, Hang Li, Yalou Huang, and Hsiao-Wuen Hon. 2006. Adapting ranking SVM to document retrieval. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 186-193.
[7]
David Cossock and Tong Zhang. 2006. Subset ranking using regression. In International Conference on Computational Learning Theory. Springer, 605-619.
[8]
Koby Crammer and Yoram Singer. 2002. Pranking with ranking. In Advances in neural information processing systems. 641-647.
[9]
James R Curran, Tara Murphy, and Bernhard Scholz. 2007. Minimising semantic drift with mutual exclusion bootstrapping. In PACLING'07. 172-180.
[10]
Arthur P Dempster, Nan M Laird, and Donald B Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the royal statistical society. Series B (methodological) (1977), 1-38.
[11]
Anthony Fader, Luke Zettlemoyer, and Oren Etzioni. 2014. Open question answering over curated and extracted knowledge bases. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining.
[12]
Geoffrey French, Michal Mackiewicz, and Mark Fisher. 2017. Self-ensembling for visual domain adaptation. arXiv preprint arXiv:1706.05208(2017).
[13]
Yarin Gal and Zoubin Ghahramani. 2016. A theoretically grounded application of dropout in recurrent neural networks. In Advances in neural information processing systems. 1019-1027.
[14]
Di He, Yingce Xia, Tao Qin, Liwei Wang, Nenghai Yu, Tieyan Liu, and Wei-Ying Ma. 2016. Dual learning for machine translation. In Advances in Neural Information Processing Systems. 820-828.
[15]
Iris Hendrickx, Su Nam Kim, Zornitsa Kozareva, Preslav Nakov, Diarmuid Ó Se´aghdha, Sebastian Padó, Marco Pennacchiotti, Lorenza Romano, and Stan Szpakowicz. 2009. Semeval-2010 task 8: Multi-way classification of semantic relations between pairs of nominals. In Proceedings of the Workshop on Semantic Evaluations: Recent Achievements and Future Directions. Association for Computational Linguistics, 94-99.
[16]
Geoffrey E Hinton, Peter Dayan, Brendan J Frey, and Radford M Neal. 1995. The” wake-sleep” algorithm for unsupervised neural networks. Science 268, 5214 (1995), 1158-1161.
[17]
Sepp Hochreiter and Jürgen Schmidhuber. 1997. Long short-term memory. Neural computation 9, 8 (1997), 1735-1780.
[18]
Ping Li, Qiang Wu, and Christopher J Burges. 2008. Mcrank: Learning to rank using multiple classification and gradient boosting. In Advances in neural information processing systems. 897-904.
[19]
Yankai Lin, Shiqi Shen, Zhiyuan Liu, Huanbo Luan, and Maosong Sun. 2016. Neural Relation Extraction with Selective Attention over Instances. In ACL'16. 2124-2133.
[20]
Tie-Yan Liu 2009. Learning to rank for information retrieval. Foundations and Trends® in Information Retrieval 3, 3(2009), 225-331.
[21]
Christopher Manning, Mihai Surdeanu, John Bauer, Jenny Finkel, Steven Bethard, and David McClosky. 2014. The Stanford CoreNLP natural language processing toolkit. In Proceedings of 52nd annual meeting of the association for computational linguistics: system demonstrations. 55-60.
[22]
Mike Mintz, Steven Bills, Rion Snow, and Dan Jurafsky. 2009. Distant supervision for relation extraction without labeled data. In ACL-IJCNLP'09. 1003-1011.
[23]
Takeru Miyato, Shin-ichi Maeda, Shin Ishii, and Masanori Koyama. 2018. Virtual adversarial training: a regularization method for supervised and semi-supervised learning. IEEE transactions on pattern analysis and machine intelligence (2018).
[24]
Raymond J Mooney and Razvan C Bunescu. 2006. Subsequence kernels for relation extraction. In NIPS'06. MIT Press, 171-178.
[25]
Gerhard Paass. 1993. Assessing and improving neural network predictions by the bootstrap algorithm. In Advances in Neural Information Processing Systems. 196-203.
[26]
Meng Qu, Xiang Ren, and Jiawei Han. 2017. Automatic Synonym Discovery with Knowledge Bases. In KDD'17. 997-1005.
[27]
Antti Rasmus, Mathias Berglund, Mikko Honkala, Harri Valpola, and Tapani Raiko. 2015. Semi-supervised learning with ladder networks. In Advances in Neural Information Processing Systems. 3546-3554.
[28]
Xiang Ren, Zeqiu Wu, Wenqi He, Meng Qu, Clare R Voss, Heng Ji, Tarek F Abdelzaher, and Jiawei Han. 2017. CoType: Joint extraction of typed entities and relations with knowledge bases. In WWW'17. 1015-1024.
[29]
Chuck Rosenberg, Martial Hebert, and Henry Schneiderman. 2005. Semi-Supervised Self-Training of Object Detection Models. In WACV/MOTION. 29-36.
[30]
Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. The Journal of Machine Learning Research 15, 1 (2014), 1929-1958.
[31]
Ang Sun and Ralph Grishman. 2012. Active learning for relation type extension with local and global data views. In Proceedings of the 21st ACM international conference on Information and knowledge management. ACM, 1105-1112.
[32]
Duyu Tang, Nan Duan, Tao Qin, Zhao Yan, and Ming Zhou. 2017. Question answering and question generation as dual tasks. arXiv preprint arXiv:1706.02027(2017).
[33]
Antti Tarvainen and Harri Valpola. 2017. Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results. In Advances in neural information processing systems. 1195-1204.
[34]
Kristina Toutanova, Danqi Chen, Patrick Pantel, Hoifung Poon, Pallavi Choudhury, and Michael Gamon. 2015. Representing Text for Joint Embedding of Text and Knowledge Bases. In EMNLP'15. 1499-1509.
[35]
Yingce Xia, Tao Qin, Wei Chen, Jiang Bian, Nenghai Yu, and Tie-Yan Liu. 2017. Dual supervised learning. arXiv preprint arXiv:1707.00415(2017).
[36]
Dmitry Zelenko, Chinatsu Aone, and Anthony Richardella. 2003. Kernel methods for relation extraction. Journal of machine learning research 3, Feb (2003), 1083-1106.
[37]
Daojian Zeng, Kang Liu, Yubo Chen, and Jun Zhao. 2015. Distant supervision for relation extraction via piecewise convolutional neural networks. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing. 1753-1762.
[38]
Wenyuan Zeng, Yankai Lin, Zhiyuan Liu, and Maosong Sun. 2017. Incorporating relation paths in neural relation extraction. In EMNLP'17. 1769-1778.
[39]
Yuhao Zhang, Victor Zhong, Danqi Chen, Gabor Angeli, and Christopher D Manning. 2017. Position-aware Attention and Supervised Data Improve Slot Filling. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing. 35-45.

Cited By

View all
  • (2024)A New Entity Relationship Extraction Method for Semi-Structured Patent DocumentsElectronics10.3390/electronics1316314413:16(3144)Online publication date: 8-Aug-2024
  • (2024)Combining Semantic and Structural Features for Reasoning on Patent Knowledge GraphsApplied Sciences10.3390/app1415680714:15(6807)Online publication date: 4-Aug-2024
  • (2024)Leveraging shortest dependency paths in low-resource biomedical relation extractionBMC Medical Informatics and Decision Making10.1186/s12911-024-02592-224:1Online publication date: 24-Jul-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
WWW '19: The World Wide Web Conference
May 2019
3620 pages
ISBN:9781450366748
DOI:10.1145/3308558
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • IW3C2: International World Wide Web Conference Committee

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 May 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dual learning
  2. relation extraction
  3. semi-supervised learning

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

WWW '19
WWW '19: The Web Conference
May 13 - 17, 2019
CA, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)21
  • Downloads (Last 6 weeks)5
Reflects downloads up to 12 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)A New Entity Relationship Extraction Method for Semi-Structured Patent DocumentsElectronics10.3390/electronics1316314413:16(3144)Online publication date: 8-Aug-2024
  • (2024)Combining Semantic and Structural Features for Reasoning on Patent Knowledge GraphsApplied Sciences10.3390/app1415680714:15(6807)Online publication date: 4-Aug-2024
  • (2024)Leveraging shortest dependency paths in low-resource biomedical relation extractionBMC Medical Informatics and Decision Making10.1186/s12911-024-02592-224:1Online publication date: 24-Jul-2024
  • (2024)HOPE: A Hierarchical Perspective for Semi-Supervised 2D-3D Cross-Modal RetrievalIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2024.341276046:12(8976-8993)Online publication date: Dec-2024
  • (2024)Adversarial Multi-Teacher Distillation for Semi-Supervised Relation ExtractionIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2023.325896735:8(11291-11301)Online publication date: Aug-2024
  • (2024)Defying Forgetting in Continual Relation Extraction via Batch Spectral Norm Regularization2024 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN60899.2024.10651110(1-8)Online publication date: 30-Jun-2024
  • (2024)Incorporating Template-Based Contrastive Learning into Cognitively Inspired, Low-Resource Relation ExtractionCognitive Computation10.1007/s12559-024-10343-816:6(3228-3240)Online publication date: 10-Sep-2024
  • (2024)Weakly Supervised Relation ExtractionInnovative Methods in Computer Science and Computational Applications in the Era of Industry 5.010.1007/978-3-031-56322-5_9(100-112)Online publication date: 6-Apr-2024
  • (2023)SelfLRE: Self-refining Representation Learning for Low-resource Relation ExtractionProceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3539618.3592058(2364-2368)Online publication date: 19-Jul-2023
  • (2023)Interactive Lexical and Semantic Graphs for Semisupervised Relation ExtractionIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2021.313895634:10(7158-7169)Online publication date: Oct-2023
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media