Skip to main content

Automatic Summarization Generation Technology of Network Document Based on Knowledge Graph

  • Conference paper
  • First Online:
Advanced Hybrid Information Processing (ADHIP 2018)

Abstract

The Internet has become one of the important channels for users to access to information and knowledge. It is crucial that how to acquire key content accurately and effectively in the events from huge amount of network information. This paper proposes an algorithm for automatic generation of network document summaries based on knowledge graph and TextRank algorithm which can solve the problem of information overload and resource trek effectively. We run the system in the field of big data application in packaging engineering. The experimental results show that the proposed method KG-TextRank extracts network document summaries more accurately, and automatically generates more readable and coherent natural language text. Therefore, it can help people access information and knowledge more effectively.

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 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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

References

  1. Wu, Y., Liu, Q., Li, C., Wang, G.: Research on cloud storage based network document sharing. J. Chin. Comput. Syst. 36(1), 95–99 (2015)

    Google Scholar 

  2. Mihalcea, R., Tarau, P.: TextRank: bringing order into texts. In: Proceedings of EMNLP 2004, pp. 404–411. ACM, Barcelona (2004)

    Google Scholar 

  3. Amit, S.: Introducing the Knowledge Graph. Official Blog of Google, America (2012)

    Google Scholar 

  4. Gambhir, M., Gupta, V.: Recent automatic text summarization techniques: a survey. Artif. Intell. Rev. 47(1), 1–66 (2016)

    Article  Google Scholar 

  5. Lynn, H.M., Chang, C., Kim, P.: An improved method of automatic text summarization for web contents using lexical chain with semantic-related terms. Soft Comput. 22(12), 4013–4023 (2018)

    Article  Google Scholar 

  6. Antunes, J., Lins, R.D., Lima, R., Oliveira, H., Riss, M., Simske, S.J.: Automatic cohesive summarization with pronominal anaphora resolution. Comput. Speech Lang. (2018). https://doi.org/10.1016/j.csl.2018.05.004

    Article  Google Scholar 

  7. Fang, C., Mu, D., Deng, Z., Wu, Z.: Word-sentence co-ranking for automatic extractive text summarization. Exp. Syst. Appl. Int. J. 72(C), 189–195 (2017)

    Article  Google Scholar 

  8. Blanco, R., Lioma, C.: Graph-based term weighting for information retrieval. Inf. Retrieval 15(20), 54–92 (2012)

    Article  Google Scholar 

  9. Yu, S., Su, J., Li, P.: Improved TextRank-based method for automatic summarization. Comput. Sci. 43(6), 240–247 (2016)

    Google Scholar 

  10. Liu, Q., Li, Y., Duan, H., Liu, Y., Qin, Z.G.: Knowledge graph construction techniques. J. Comput. Res. Dev. 53, 582–600 (2016)

    Google Scholar 

  11. Xu, Z.L., Sheng, Y.P., He, L.R., Wang, Y.F.: Review on knowledge graph techniques. J. Univ. Electron. Sci. Technol. China 45, 589–606 (2016)

    MATH  Google Scholar 

  12. Hu, F.H.: Chinese knowledge graph construction method based on multiple data sources. East China University of Science and Technology, Shanghai (2014)

    Google Scholar 

  13. Li, C., Wu, Y., Hu, F.: Establishment of packaging knowledge graph based on multiple data sources. Revista de la Facultad de Ingeniería 32(14), 231–236 (2017)

    Google Scholar 

  14. Wu, Y., Wang, Z., Chen, S., Wang, G., Li, C.: Automatically semantic annotation of network document based on domain knowledge graph. In: 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications, pp. 715–721 (2017)

    Google Scholar 

Download references

Acknowledgements

This work is supported in part by the National Natural Science Foundation of China under grant number 61502163, in part by the Hunan Provincial Natural Science Foundation of China under grant numbers 2016JJ5035, 2016JJ3051 and 2015JJ3046, in part by the Hunan Provincial Science and Technology Project under grant number 2015TP1003, in part by the Project of China Packaging Federation under Funding Support Numbers 2014GSZJWT001KT010, 17ZBLWT001KT010, in part by the National Packaging Advertising Research Base and Hunan Packaging Advertising Creative Base under grant number 17JDXMA03, in part by the Intelligent Information Perception and Processing Technology Hunan Province Key Laboratory under grant number 2017KF07.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rongrong Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, Y., Chen, R., Li, C., Chen, S., Zou, W. (2019). Automatic Summarization Generation Technology of Network Document Based on Knowledge Graph. In: Liu, S., Yang, G. (eds) Advanced Hybrid Information Processing. ADHIP 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 279. Springer, Cham. https://doi.org/10.1007/978-3-030-19086-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19086-6_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics