Skip to main content

An Improved Discriminative Category Matching in Relation Identification

  • Conference paper
Natural Language Processing and Information Systems (NLDB 2013)

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

  • 2354 Accesses

Abstract

This paper describes an improved method for relation identification, which is the last step of unsupervised relation extraction. Similar entity pairs maybe grouped into the same cluster. It is also important to select a key word to describe the relation accurately. Therefore, an improved DF feature selection method is employed to rearrange low-frequency entity pairs’ features in order to get a feature set for each cluster. Then we used an improved Discriminative Category Matching (DCM) method to select typical and discriminative words for entity pairs’ relation. Our experimental results show that Improved DCM method is better than the original DCM method in relation identification.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Hasegawa, T., Sekine, S., Grishman, R.: Discovering Relations among Named Entities from Large Corpora. In: ACL 2004 (2004)

    Google Scholar 

  2. Chen, J., Ji, D., Tan, C.L., Niu, Z.: Unsupervised Feature Selection for Relation Extraction. In: IJCNLP 2005, JejuIsland, Korea (2005)

    Google Scholar 

  3. Benjamin, R., Ronen, F.: Clustering for Unsupervised Relation Identification. In: Proceedings of CIKM 2007 (2007)

    Google Scholar 

  4. Wang, J.: Research on Unsupervised Chinese Entity Relation Extraction Method, East China Normal University (2012)

    Google Scholar 

  5. Yan, Y., Naoaki, O., Yutaka, M., Yang, Z., Mitsuru, I.: Unsupervised relation extraction by mining Wikipedia texts using information from the web. In: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, Suntec, Singapore, August 2-7, vol. 2 (2009)

    Google Scholar 

  6. Zhou, S., Xu, Z., Xu, T.: New method for determining optimal number of clusters in K-means clustering algorithm. Computer Engineering and Applications 46(16), 27–31 (2010)

    Google Scholar 

  7. Dudoit, S., Fridlyand, J.: A prediction-based resampling method for estimating the number of clusters in a dataset. Genome Biology 3(7), 1–21 (2002)

    Article  Google Scholar 

  8. Xu, Y., LI, J., Wang, B., Sun, C.: A study of Feature Selection for Text Categorization Base on Term Frequency. In: Chinese Information Processing Front Progress China Chinese Information Society 25th Anniversary of Academic Conference Proceedings (2006)

    Google Scholar 

  9. Xu, Y., Huai, J., Wang, Z.: Reduction Algorithm Based on Discernibility and Its Applications. Chinese Journal of Computers 26(1) (January 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, Y., Yang, J., Lin, X. (2013). An Improved Discriminative Category Matching in Relation Identification. In: MĂ©tais, E., Meziane, F., Saraee, M., Sugumaran, V., Vadera, S. (eds) Natural Language Processing and Information Systems. NLDB 2013. Lecture Notes in Computer Science, vol 7934. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38824-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38824-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-38824-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics