IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i3p488-d741217.html
   My bibliography  Save this article

A New Hybrid Based on Long Short-Term Memory Network with Spotted Hyena Optimization Algorithm for Multi-Label Text Classification

Author

Listed:
  • Hamed Khataei Maragheh

    (Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia 5756151818, Iran)

  • Farhad Soleimanian Gharehchopogh

    (Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia 5756151818, Iran)

  • Kambiz Majidzadeh

    (Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia 5756151818, Iran)

  • Amin Babazadeh Sangar

    (Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia 5756151818, Iran)

Abstract

An essential work in natural language processing is the Multi-Label Text Classification (MLTC). The purpose of the MLTC is to assign multiple labels to each document. Traditional text classification methods, such as machine learning usually involve data scattering and failure to discover relationships between data. With the development of deep learning algorithms, many authors have used deep learning in MLTC. In this paper, a novel model called Spotted Hyena Optimizer (SHO)-Long Short-Term Memory (SHO-LSTM) for MLTC based on LSTM network and SHO algorithm is proposed. In the LSTM network, the Skip-gram method is used to embed words into the vector space. The new model uses the SHO algorithm to optimize the initial weight of the LSTM network. Adjusting the weight matrix in LSTM is a major challenge. If the weight of the neurons to be accurate, then the accuracy of the output will be higher. The SHO algorithm is a population-based meta-heuristic algorithm that works based on the mass hunting behavior of spotted hyenas. In this algorithm, each solution of the problem is coded as a hyena. Then the hyenas are approached to the optimal answer by following the hyena of the leader. Four datasets are used (RCV1-v2, EUR-Lex, Reuters-21578, and Bookmarks) to evaluate the proposed model. The assessments demonstrate that the proposed model has a higher accuracy rate than LSTM, Genetic Algorithm-LSTM (GA-LSTM), Particle Swarm Optimization-LSTM (PSO-LSTM), Artificial Bee Colony-LSTM (ABC-LSTM), Harmony Algorithm Search-LSTM (HAS-LSTM), and Differential Evolution-LSTM (DE-LSTM). The improvement of SHO-LSTM model accuracy for four datasets compared to LSTM is 7.52%, 7.12%, 1.92%, and 4.90%, respectively.

Suggested Citation

  • Hamed Khataei Maragheh & Farhad Soleimanian Gharehchopogh & Kambiz Majidzadeh & Amin Babazadeh Sangar, 2022. "A New Hybrid Based on Long Short-Term Memory Network with Spotted Hyena Optimization Algorithm for Multi-Label Text Classification," Mathematics, MDPI, vol. 10(3), pages 1-24, February.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:3:p:488-:d:741217
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/3/488/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/3/488/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yuwei Mao & Hui Lin & Christina Xuan Yu & Roger Frye & Darren Beckett & Kevin Anderson & Lars Jacquemetton & Fred Carter & Zhangyuan Gao & Wei-keng Liao & Alok N. Choudhary & Kornel Ehmann & Ankit Agr, 2023. "A deep learning framework for layer-wise porosity prediction in metal powder bed fusion using thermal signatures," Journal of Intelligent Manufacturing, Springer, vol. 34(1), pages 315-329, January.

    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:jmathe:v:10:y:2022:i:3:p:488-:d:741217. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.