Skip to main content

Enhancing Graph-Based Keywords Extraction with Node Association

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

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

Abstract

In this paper, we present an enhancing graph-based keywords extraction method with node association (GKENA), which strengths graph-based keywords extraction approaches by applying strong association rule mining and unifying three different node attributes into a single framework. Specifically, we regard one single document as a sequential transaction dataset, and apply an efficient algorithm to exploit closed frequent sets and the strong association rules are generated to represent the correlations among multiple terms for association graph construction. Each graph node represents combinations of two or more terms and three node attributes (i.e. graph structure, node semantics and associations) are unified to transfer extra node information into a Markov chain model to obtain the ranking. Besides, in order to avoid the semantic overlapping among top ranked candidate words, a trustworthy clustering algorithm is employed and the center word in each cluster is selected to construct the keywords sets. Our experiments on both Chinese and English datasets indicate that GKENA can boost the quality of keywords in graph-based keywords extraction techniques.

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

References

  1. Xie, F., Wu, X.D., Zhou, X.: Efficient sequential pattern mining with wildcards for keyphrase extraction. Knowl. Based Syst. 115, 27–39 (2017)

    Article  Google Scholar 

  2. Doen, Y., Murata, M., Otake, R., Tokuhisa, M.: Construction of concept network from large numbers of texts for information examination using TF-IDF and deletion of unrelated words. In: 8th International Symposium on Soft Computing and Intelligent Systems, pp. 1108–1113. IEEE Computer Society (2014)

    Google Scholar 

  3. Mehri, A., Jamaati, M., Mehri, H.: Word ranking in a single document by Jensen-Shannon divergence. Phys. Lett. A 379(28–29), 1627–1632 (2015)

    Article  Google Scholar 

  4. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. J. Mach. Learn. Res. 3(6), 993–1022 (2012)

    MATH  Google Scholar 

  5. Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825–3833 (2012)

    Article  Google Scholar 

  6. Li, W., Zhao, J.: TextRank algorithm by exploiting wikipedia for short text keywords extraction. In: 3rd International Conference on Information Science and Control Engineering, pp. 683–686. IEEE, Beijing (2016)

    Google Scholar 

  7. Baralis, E., Cagliero, L., Mahoto, N., Fiori, A.: GraphSum: discovering correlations among multiple terms for graph-based summarization. Inf. Sci. 249(16), 96–109 (2013)

    Article  MathSciNet  Google Scholar 

  8. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24(1), 25–46 (1999)

    Article  Google Scholar 

  9. Li, P.P., Wang, H., Zhu, K.Q., Wang, Z.: A large probabilistic semantic network based approach to compute term similarity. IEEE Trans. Knowl. Data Eng. 27(10), 2604–2617 (2015)

    Article  Google Scholar 

  10. Mehri, A., Darooneh, A.H.: The role of entropy in word ranking. Physica A 390(18–19), 3157–3163 (2011)

    Article  Google Scholar 

  11. Yang, Z., Lei, J., Fan, K., Lai, Y.: Keyword extraction by entropy difference between the intrinsic and extrinsic mode. Physica A 392(19), 4523–4531 (2013)

    Article  Google Scholar 

  12. Lv, X., El-Gohary, N.M.: Semantic annotation for context-aware information retrieval for supporting the environmental review of transportation projects. J. Comput. Civil Eng. 30(6), 332–338 (2016)

    Article  Google Scholar 

  13. Liu, M., Xu, C., Luo, Y., Wen, Y.: Cost-sensitive feature selection by optimizing F-measures. IEEE Trans. Image Process. 27(3), 1323–1335 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The work is supported by the National Natural Science Foundation of China (No. 61762078, 61363058, 61802404, 61702508) Guangxi Key Laboratory of Trusted Software (No. kx201910) and Research Fund of Guangxi Key Lab of Multi-source Information Mining & Security (MIMS18-08), Key Research Program of Beijing Municipal Science & Technology Commission (Grant No. D18110100060000).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huifang Ma .

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, H., Wang, S., Li, M., Li, N. (2019). Enhancing Graph-Based Keywords Extraction with Node Association. 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_45

Download citation

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

  • 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