IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6631768.html
   My bibliography  Save this article

A Graph Convolutional Network-Based Sensitive Information Detection Algorithm

Author

Listed:
  • Ying Liu
  • Chao-Yu Yang
  • Jie Yang
  • M. Irfan Uddin

Abstract

In the field of natural language processing (NLP), the task of sensitive information detection refers to the procedure of identifying sensitive words for given documents. The majority of existing detection methods are based on the sensitive-word tree, which is usually constructed via the common prefixes of different sensitive words from the given corpus. Yet, these traditional methods suffer from a couple of drawbacks, such as poor generalization and low efficiency. For improvement purposes, this paper proposes a novel self-attention-based detection algorithm using the implementation of graph convolutional network (GCN). The main contribution is twofold. Firstly, we consider a weighted GCN to better encode word pairs from the given documents and corpus. Secondly, a simple, yet effective, attention mechanism is introduced to further integrate the interaction among candidate words and corpus. Experimental results from the benchmarking dataset of THUC news demonstrate a promising detection performance, compared to existing work.

Suggested Citation

  • Ying Liu & Chao-Yu Yang & Jie Yang & M. Irfan Uddin, 2021. "A Graph Convolutional Network-Based Sensitive Information Detection Algorithm," Complexity, Hindawi, vol. 2021, pages 1-8, March.
  • Handle: RePEc:hin:complx:6631768
    DOI: 10.1155/2021/6631768
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6631768.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6631768.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6631768?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:6631768. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.