Skip to main content

A Multi-view Approach for Relation Extraction

  • Conference paper
Web Information Systems and Mining (WISM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5854))

Included in the following conference series:

Abstract

Relation extraction is an important problem in information extraction. In this paper, we explore a multi-view strategy for relation extracting task. Motivated by the fact, as in work of Jiang and Zhai’s [1], that combining different feature subspaces into a single view does not generate much improvement, we propose a two-stage multi-view learning approach. First, we learn two different classifiers from two different views of relation instances: sequence representation and syntactic parse tree representation, respectively. Then, a meta-learner is trained using the meta data constructed along with other contextual information to achieve a strong predictive performance, as the final classification model. The experimental results conducted on ACE 2005 corpus show that the multi-view approach outperforms each single-view one for relation extraction task.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jiang, J., Zhai, C.: A Systematic Exploration of the Feature Space for Relation Extraction. In: Proceedings of NAACL/HLT, pp. 113–120. Association for Computational Linguistics, New York (2007)

    Google Scholar 

  2. Zhou, G., Su, J., Zhang, J., Zhang, M.: Exploring various knowledge in relation extraction. In: Proceedings of ACL, pp. 427–434. Association for Computational Linguistics, Michigan (2005)

    Google Scholar 

  3. Zhao, S., Grishman, R.: Extracting relations with integrated information using kernel methods. In: Proceedings of ACL, pp. 419–426. Association for Computational Linguistics, Michigan (2005)

    Google Scholar 

  4. Zelenko, D., Aone, C., Richardella, A.: Kernel methods for relation extraction. Journal of Machine Learning Research 3, 1083–1106 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Culotta, A., Sorensen, J.: Dependency tree kernels for relation extraction. In: Proceedings of ACL, pp. 423–429. Association for Computational Linguistics, Spain (2004)

    Chapter  Google Scholar 

  6. Bunescu, R.C., Mooney, R.J.: A shortest path dependency kenrel for relation extraction. In: Proceedings of HLT/EMNLP, pp. 724–731. Association for Computational Linguistics, Canada (2005)

    Google Scholar 

  7. Bunescu, R.C., Mooney, R.J.: Subsequence kernels for relation extraction. In: Proceedings of NIPS, pp. 171–178. MIT Press, Cambridge (2005)

    Google Scholar 

  8. Zhang, M., Zhang, J., Su, J.: Exploring syntactic features for relation extraction using a convolution tree kernel. In: Proceedings of HLT/NAACL, pp. 288–295. Association for Computational Linguistics, New York (2006)

    Google Scholar 

  9. Zhang, M., Zhang, J., Su, J., Zhou, G.: A composite kernel to extract relations between entities with both flat and structured features. In: Proceedings of ACL, pp. 825–832. Association for Computational Linguistics, Sydney (2006)

    Chapter  Google Scholar 

  10. Zhou, G., Zhang, M., Ji, D., Zhu, Q.: Tree Kernel-based Relation Extraction with Context-Sensitive Structured Parse Tree Information. In: Proceedings of EMNLP/CoNLL, pp. 728–736. Association for Computational Linguistics, Prague (2007)

    Google Scholar 

  11. Miller, S., Fox, H., Ramshaw, L., Weischedel, R.: A novel use of statistical parsing to extract information from text. In: Proceedings of NAACL, pp. 226–233 (2000)

    Google Scholar 

  12. de Sa, V.R., Ballard, D.: Category learning through multi-modality sensing. Neural Comput. 10(5), 1097–1117 (1998)

    Article  Google Scholar 

  13. Ando, R.K., Zhang, T.: Two-view feature generation model for semi-supervised learning. In: Proceedings of ICML, pp. 25–32. Morgan Kaufmann Publishers, San Francisco (2007)

    Chapter  Google Scholar 

  14. IA Muslea: Active learning with multiple views. Ph.D. thesis, Department of Computer Science, University of Southern California (2002)

    Google Scholar 

  15. Christoudias, C.M., Saenko, K., Morency, L.-P., Darrell, T.: Co-adaptation of audio-visual speech and gesture classifiers. In: Proceedings of ICMI, pp. 84–91. ACM, Alberta (2006)

    Chapter  Google Scholar 

  16. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123–140 (1996)

    MATH  MathSciNet  Google Scholar 

  17. Wolpert, D.H.: Stacked generalization. Neural Networks 5(2), 241–259 (1992)

    Article  Google Scholar 

  18. Freund, Y.: RE Schapire: Experiments with a new boosting algorithm. In: Proceedings of ICML, pp. 148–156 (1996)

    Google Scholar 

  19. Witten, I.H., Frank, E.: Data mining: practical machine learning tools and techniques with Java implementations. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, J., Xu, Q., Chen, J., Qu, W. (2009). A Multi-view Approach for Relation Extraction. In: Liu, W., Luo, X., Wang, F.L., Lei, J. (eds) Web Information Systems and Mining. WISM 2009. Lecture Notes in Computer Science, vol 5854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05250-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05250-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05249-1

  • Online ISBN: 978-3-642-05250-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics