IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2021i1p226-d711542.html
   My bibliography  Save this article

Topic Extraction and Interactive Knowledge Graphs for Learning Resources

Author

Listed:
  • Ahmed Badawy

    (Telematic Engineering Department, University Carlos III de Madrid, 28911 Legane, Spain
    Computer Science Department, Faculty of Science, Minia University, EL-Minia 61519, Egypt)

  • Jesus A. Fisteus

    (Telematic Engineering Department, University Carlos III de Madrid, 28911 Legane, Spain)

  • Tarek M. Mahmoud

    (Computer Science Department, Faculty of Science, Minia University, EL-Minia 61519, Egypt
    Faculty of Computers and Artificial Intelligence, Sadat City University, Sadat City 32897, Egypt)

  • Tarek Abd El-Hafeez

    (Computer Science Department, Faculty of Science, Minia University, EL-Minia 61519, Egypt
    Computer Science Unit, Deraya University, EL-Minia 61765, Egypt)

Abstract

Humanity development through education is an important method of sustainable development. This guarantees community development at present time without any negative effects in the future and also provides prosperity for future generations. E-learning is a natural development of the educational tools in this era and current circumstances. Thanks to the rapid development of computer sciences and telecommunication technologies, this has evolved impressively. In spite of facilitating the educational process, this development has also provided a massive amount of learning resources, which makes the task of searching and extracting useful learning resources difficult. Therefore, new tools need to be advanced to facilitate this development. In this paper we present a new algorithm that has the ability to extract the main topics from textual learning resources, link related resources and generate interactive dynamic knowledge graphs. This algorithm accurately and efficiently accomplishes those tasks no matter how big or small the texts are. We used Wikipedia Miner, TextRank, and Gensim within our algorithm. Our algorithm’s accuracy was evaluated against Gensim, largely improving its accuracy. This could be a step towards strengthening self-learning and supporting the sustainable development of communities, and more broadly of humanity, across different generations.

Suggested Citation

  • Ahmed Badawy & Jesus A. Fisteus & Tarek M. Mahmoud & Tarek Abd El-Hafeez, 2021. "Topic Extraction and Interactive Knowledge Graphs for Learning Resources," Sustainability, MDPI, vol. 14(1), pages 1-21, December.
    • Handle: RePEc:gam:jsusta:v:14:y:2021:i:1:p:226-:d:711542
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/1/226/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/1/226/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Muhammad Aamir & Muhammad Awais Yousaf & Abdul Razaq & Elena Guardo, 2021. "Number of Distinct Homomorphic Images in Coset Diagrams," Journal of Mathematics, Hindawi, vol. 2021, pages 1-39, August.
    2. Ard H. J. den Reijer & Jan P. A. M. Jacobs & Pieter W. Otter, 2021. "A criterion for the number of factors," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(18), pages 4293-4299, August.
    3. Lin, Hongying & Zhou, Bo, 2021. "Which numbers are status differences?," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    4. Qin, Zhongmei & Li, Shasha & Lan, Yongxin & Yue, Jun, 2021. "Rainbow numbers for paths in planar graphs," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    5. Li, Jiayun & Yin, Jianhua, 2021. "Some new results on the Turán number of star forests," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    6. Wang, Ye & Li, Yusheng & Li, Yan, 2021. "Bipartite Ramsey numbers of Kt,s in many colors," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    7. Li, Zhonghua & Wu, Baoyindureng, 2021. "The k-independence number of t-connected graphs," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    8. Wen-Wei Li & Zhong-Lin Cheng & Jia-Bao Liu & Gaetano Luciano, 2021. "On the Number of Conjugate Classes of Derangements," Journal of Mathematics, Hindawi, vol. 2021, pages 1-20, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gaspoz, Sébastien & Maffucci, Riccardo W., 2024. "Independence numbers of polyhedral graphs," Applied Mathematics and Computation, Elsevier, vol. 462(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:14:y:2021:i:1:p:226-:d:711542. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.