Skip to main content

Mining Inter-Entity Semantic Relations Using Improved Transductive Learning

  • Conference paper
  • 1544 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3651))

Abstract

This paper studies the problem of mining relational data hidden in natural language text. In particular, it approaches the relation classification problem with the strategy of transductive learning. Different algorithms are presented and empirically evaluated on the ACE corpus. We show that transductive learners exploiting various lexical and syntactic features can achieve promising classification performance. More importantly, transductive learning performance can be significantly improved by using an induced similarity function.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agichtein, E., Gravano, L.: Snowball: Extracting relations from large plain-text collections. In: Proceedings of the Fifth ACM International Conference on Digital Libraries (2000)

    Google Scholar 

  2. Brin, S.: Extracting patterns and relations from the world wide web. In: WebDB Workshop at 6th International Conference on Extending Database Technology, EDBT 1998 (1998)

    Google Scholar 

  3. Zelenko, D., Aone, C., Richardella, A.: Kernel methods for relation extraction. J. Mach. Learn. Res. 3, 1083–1106 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Zhang, Z.: Weakly-supervised relation classification for information extraction. In: Proceedings of the 13th International Conference on Information and Knowledge Management CIKM 2004, Washington DC (2004)

    Google Scholar 

  5. Rosario, B., Hearst, M.: Classifying semantic relations in bioscience text. In: Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (2004)

    Google Scholar 

  6. Abney, S.: Understanding the Yarowsky algorithm. Computational Linguistics 30 (2004)

    Google Scholar 

  7. Vapnik, V.N.: Statistical learning theory. John Wiley, NY (1998)

    MATH  Google Scholar 

  8. Joachims, T.: Transductive inference for text classification using support vector machines. In: Bratko, I., Dzeroski, S. (eds.) Proceedings of ICML-1999, 16th International Conference on Machine Learning, Bled, SL, pp. 200–209. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  9. Bennett, K.: Combining support vector and mathematical programming methods for classification. In: Schölkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning. MIT-Press, Cambridge (1999)

    Google Scholar 

  10. Blum, A., Chawla, S.: Learning from labeled and unlabeled data using graph mincuts. In: ICML 2001: Proceedings of the Eighteenth International Conference on Machine Learning, San Francisco, CA, USA, pp. 19–26. Morgan Kaufmann Publishers Inc., San Francisco (2001)

    Google Scholar 

  11. Blum, A., Lafferty, J., Rwebangira, M.R., Reddy, R.: Semi-supervised learning using randomized mincuts. In: ICML 2004: Twenty-first international conference on Machine learning. ACM Press, New York (2004)

    Google Scholar 

  12. Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 14–23 (1999)

    Google Scholar 

  13. Joachims, T.: Transductive learning via spectral graph partitioning. In: Proceedings of The Twentieth International Conference on Machine Learning (ICML) (2003)

    Google Scholar 

  14. Charniak, E.: A maximum-entropy-inspired parser. Technical Report CS-99-12, Computer Scicence Department, Brown University (1999)

    Google Scholar 

  15. Buchholz, S.: The chunklink script, (2000), Software available at http://ilk.uvt.nl/~sabine/chunklink/

  16. Joachims, T.: Making large-scale support vector machine learning practical. In: Advances in kernel methods: support vector learning, pp. 169–184. MIT Press, Cambridge (1999)

    Google Scholar 

  17. Carlson, A., Cumby, C., Rosen, J., Roth, D.: The SNoW learning architecture. Technical Report UIUCDCS-R-99-2101, UIUC Computer Science Department (1999)

    Google Scholar 

  18. Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn. 2, 285–318 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Z. (2005). Mining Inter-Entity Semantic Relations Using Improved Transductive Learning. In: Dale, R., Wong, KF., Su, J., Kwong, O.Y. (eds) Natural Language Processing – IJCNLP 2005. IJCNLP 2005. Lecture Notes in Computer Science(), vol 3651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562214_36

Download citation

  • DOI: https://doi.org/10.1007/11562214_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29172-5

  • Online ISBN: 978-3-540-31724-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics