Skip to main content

Measuring the Dynamic Relatedness between Chinese Entities Orienting to News Corpus

  • Conference paper
Machine Learning and Data Mining in Pattern Recognition (MLDM 2012)

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

  • 5842 Accesses

Abstract

The related applications are limited due to the static characteristics on existing relatedness calculation algorithms. We proposed a method aiming to efficiently compute the dynamic relatedness between Chinese entity-pairs, which changes over time. Our method consists of three components: using co-occurrence statistics method to mine the co-occurrence information of entities from the news texts, inducing the development law of dynamic relatedness between entity-pairs, taking the development law as basis and consulting the existing relatedness measures to design a dynamic relatedness measure algorithm. We evaluate the proposed method on the relatedness value and related entity ranking. Experimental results on a dynamic news corpus covering seven domains show a statistically significant improvement over the classical relatedness measure.

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. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C. (1993)

    Google Scholar 

  2. Silberschatz, A., Tuzhilin, A.: What makes patterns interesting in knowledge discovery systems. IEEE Transcations on Knowledge and Data Engineering 8 (1996)

    Google Scholar 

  3. Liu, J., Yao, T.-F.: Semantic Relevancy Computing Based on Wikipedia. Computer Engineering 36(19), 42–43 (2010)

    Google Scholar 

  4. Wettler, M., Rapp, R.: Computation of word associations based on the co-occurrences of words in large corpora, http://acl.ldc.upenn.edu/W/W93/W93-0310.pdf (accessed December 9, 2005)

  5. Miller, G., Beckwith, R., Fellbaum, C., Gross, D., Miller, K.: Introduction to Wordnet: An on-line lexical database. International Journal of Lexicography 3, 238–244 (1990)

    Google Scholar 

  6. Chen, X.-Y., Guo, L., Fang, J.: Semantic relatedness based on searching engines. Computer Engineering and Applications 46(30), 128–130 (2010)

    Google Scholar 

  7. Liu, J., He, L., et al.: A specific word relatedness computation algorithm for news corpus. In: 2010 2nd International Workshop on Intelligent Systems and Applications, ISA (2010)

    Google Scholar 

  8. Baidu Wikipedia, http://baike.baidu.com/view/6306108.htm

  9. Google Insights, http://www.google.com/insights/search

  10. Dagan, I., Lee, L., Pereira, P.C.N.: Similarity-Based Models of Word Cooccurrence Probabilities. Maehine Learning (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Z., Yang, J., Lin, X. (2012). Measuring the Dynamic Relatedness between Chinese Entities Orienting to News Corpus. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2012. Lecture Notes in Computer Science(), vol 7376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31537-4_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31537-4_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31536-7

  • Online ISBN: 978-3-642-31537-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics