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

An Approach Based on Semantic Relationship Embeddings for Text Classification

Author

Listed:
  • Ana Laura Lezama-Sánchez

    (Faculty of Computer Science, Benemerita Universidad Autonoma de Puebla, Puebla 72570, Mexico
    These authors contributed equally to this work.)

  • Mireya Tovar Vidal

    (Faculty of Computer Science, Benemerita Universidad Autonoma de Puebla, Puebla 72570, Mexico
    These authors contributed equally to this work.)

  • José A. Reyes-Ortiz

    (System Department, Universidad Autonoma Metropolitana, Azcapotzalco 02200, Mexico
    These authors contributed equally to this work.)

Abstract

Semantic relationships between words provide relevant information about the whole idea in the texts. Existing embedding representation models characterize each word as a vector of numbers with a fixed length. These models have been used in tasks involving text classification, such as recommendation and question–answer systems. However, the embedded information provided by semantic relationships has been neglected. Therefore, this paper proposes an approach that involves semantic relationships in embedding models for text classification, which is evaluated. Three embedding models based on semantic relations extracted from Wikipedia are presented and compared with existing word-based models. Our approach considers the following relationships: synonymy, hyponymy, and hyperonymy. They were considered since previous experiments have shown that they provide semantic knowledge. The relationships are extracted from Wikipedia using lexical-syntactic patterns identified in the literature. The extracted relationships are embedded as a vector: synonymy, hyponymy–hyperonymy, and a combination of all relationships. A Convolutional Neural Network using semantic relationship embeddings was trained for text classification. An evaluation was carried out for the proposed relationship embedding configurations and existing word-based models to compare them based on two corpora. The results were obtained with the metrics of precision, accuracy, recall, and F 1 -measure. The best results for the 20-Newsgroup corpus were obtained with the hyponymy–hyperonymy embeddings, achieving an accuracy of 0.79. For the Reuters corpus, F 1 -measure and recall of 0.87 were obtained using synonymy–hyponymy–hyperonymy.

Suggested Citation

  • Ana Laura Lezama-Sánchez & Mireya Tovar Vidal & José A. Reyes-Ortiz, 2022. "An Approach Based on Semantic Relationship Embeddings for Text Classification," Mathematics, MDPI, vol. 10(21), pages 1-15, November.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:21:p:4161-:d:965586
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Leonardo Ranaldi & Francesca Fallucchi & Fabio Massimo Zanzotto, 2021. "Dis-Cover AI Minds to Preserve Human Knowledge," Future Internet, MDPI, vol. 14(1), pages 1-15, December.
    2. Korawit Orkphol & Wu Yang, 2019. "Word Sense Disambiguation Using Cosine Similarity Collaborates with Word2vec and WordNet," Future Internet, MDPI, vol. 11(5), pages 1-16, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Yu Wang & Yuan Wang & Zhenwan Peng & Feifan Zhang & Fei Yang, 2023. "A Concise Relation Extraction Method Based on the Fusion of Sequential and Structural Features Using ERNIE," Mathematics, MDPI, vol. 11(6), pages 1-20, March.

    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. Chanjun Park & Jaehyung Seo & Seolhwa Lee & Chanhee Lee & Heuiseok Lim, 2022. "The ASR Post-Processor Performance Challenges of BackTranScription (BTS): Data-Centric and Model-Centric Approaches," Mathematics, MDPI, vol. 10(19), pages 1-8, October.
    2. Gugulica, Madalina & Burghardt, Dirk, 2023. "Mapping indicators of cultural ecosystem services use in urban green spaces based on text classification of geosocial media data," Ecosystem Services, Elsevier, vol. 60(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:jmathe:v:10:y:2022:i:21:p:4161-:d:965586. 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.