Skip to main content

Entity Linking Based on Graph Model and Semantic Representation

  • Conference paper
  • First Online:
Knowledge Science, Engineering and Management (KSEM 2019)

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

  • 2688 Accesses

Abstract

A large number of applications which bridge web data with knowledge bases have led to an increase in the entity linking research. Candidate entity disambiguation plays an important role in the typical entity linking systems. Generally, graph-based candidate disambiguation approaches applied document-level topical coherence of candidate entities. Nevertheless, they do not make full use of abundant unambiguous entities to enrich semantic information during the disambiguation. To solve this problem, we propose a graph-based model combining semantic representation learning for entity linking. Specifically, we construct a referent graph based on semantic vectors trained from RDF data, in which we introduce the dynamic PageRank algorithm with unambiguous entities to enhance the performance of entity linking. Primary experiments show that this model outperforms state-of-the-art on benchmark datasets.

N. Ma and X. Liu—Contributed equally.

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 EPUB and 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

Notes

  1. 1.

    https://catalog.ldc.upenn.edu/LDC2005T09.

  2. 2.

    https://catalog.ldc.upenn.edu/ldc2002t31.

  3. 3.

    http://kdd.ics.uci.edu/databases/msnbc/msnbc.html.

References

  1. Shen, W., Wang, J., Han, J.: Entity linking with a knowledge base: issues, techniques, and solutions. IEEE Trans. Knowl. Data Eng. 30, 443–460 (2015)

    Article  Google Scholar 

  2. Gattani, A.: Entity extraction, linking, classification, and tagging for social media: a wikipedia-based approach. In: Proceedings PVLDB (2013)

    Google Scholar 

  3. Welty, C., Murdock, J.W., Kalyanpur, A., Fan, J.: A comparison of hard filters and soft evidence for answer typing in Watson. In: Cudré-Mauroux, P., et al. (eds.) ISWC 2012. LNCS, vol. 7650, pp. 243–256. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-35173-0_16

    Chapter  Google Scholar 

  4. Lin, T., Mausam, Etzioni, O.: Entity linking at web scale. In: Proceedings of NAACL, pp. 84–88 (2012)

    Google Scholar 

  5. Nakashole, N., Weikum, G., Suchanek, F.M.: PATTY: a taxonomy of relational patterns with semantic types. In: Proceedings of EMNLP, pp. 1135–1145 (2012)

    Google Scholar 

  6. Cheng, T., Yan, X., Chen-Chuan Chang, K.: EntityRank: searching entities directly and holistically. In: Proceedings of VLDB, pp. 387–398 (2007)

    Google Scholar 

  7. Bordino, I., Mejova, Y., Lalmas, M.: Penguins in sweaters, or serendipitous entity search on user-generated content. In: Proceedings of CIKM, pp. 109–118 (2013)

    Google Scholar 

  8. Han, X., Sun, L., Zhao, J.: Collective entity linking in web text: a graph-based method. In: Proceedings of SIGIR, pp. 765–774 (2011)

    Google Scholar 

  9. Zhang, J., Li, J.: Graph-based jointly modeling entity detection and linking in domain-specific area. In: Chen, H., Ji, H., Sun, L., Wang, H., Qian, T., Ruan, T. (eds.) CCKS 2016. CCIS, vol. 650, pp. 146–159. Springer, Singapore (2016). https://doi.org/10.1007/978-981-10-3168-7_15

    Chapter  Google Scholar 

  10. Gentile, A.L., Zhang, Z., Xia, L., Iria, J.: Graph-based semantic relatedness for named entity disambiguation (2009)

    Google Scholar 

  11. Alhelbawy, A., Gaizauskas, R.J.: Graph ranking for collective named entity disambiguation. In: Proceedings of ACL, pp. 75–80 (2014)

    Google Scholar 

  12. Zhang, H., Lofgren, P., Goel, A.: Approximate personalized pagerank on dynamic graphs. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 13–17 August 2016, pp. 1315–1324 (2016)

    Google Scholar 

  13. Usbeck, R., et al.: AGDISTIS - graph-based disambiguation of named entities using linked data. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 457–471. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11964-9_29

    Chapter  Google Scholar 

  14. Ganea, O.-E., Ganea, M., Lucchi, A., Eickhoff, C., Hofmann, T.: Probabilistic bag-of-hyperlinks model for entity linking. In: Proceedings of WWW, pp. 927–938 (2016)

    Google Scholar 

  15. Ristoski, P., Paulheim, H.: RDF2Vec: RDF graph embeddings for data mining. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 498–514. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46523-4_30

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yulun Gao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ma, N., Liu, X., Gao, Y. (2019). Entity Linking Based on Graph Model and Semantic Representation. In: Douligeris, C., Karagiannis, D., Apostolou, D. (eds) Knowledge Science, Engineering and Management. KSEM 2019. Lecture Notes in Computer Science(), vol 11775. Springer, Cham. https://doi.org/10.1007/978-3-030-29551-6_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29551-6_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29550-9

  • Online ISBN: 978-3-030-29551-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics