IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v18y2024i1p1-21.html
   My bibliography  Save this article

VCGERG: Vulnerability Classification With Graph Embedding Algorithm on Vulnerability Report Graphs

Author

Listed:
  • Yashu Liu

    (Beijing University of Civil Engineering and Architecture, China)

  • Xiaoyi Zhao

    (Beijing University of Civil Engineering and Architecture, China)

  • Xiaohua Qiu

    (Beijing University of Civil Engineering and Architecture, China)

  • Han-Bing Yan

    (National Computer Network Emergency Response Technical Team, China)

Abstract

Vulnerability can lead to data loss, privacy leakage and financial loss. Accurate detection and identification of vulnerabilities is essential to prevent information leakage and APT attacks. This paper explores the possibility of digging the valuable information in vulnerability reports deeply. We propose a new model, VCGERG, which products a graph using key information from vulnerability reports and embeds the graph into the vector space using a keywords-LINE graph embedding algorithm based on the attention of neighboring nodes. VCGERG model uses the OVR random forest algorithm to classify vulnerabilities. Our model can get the complicated local and global information of the graph in large-scale dataset and achieve better results. In order to verify the effectiveness of our model, it is evaluated on many experiments. Compared with other models, our method has a higher accuracy rate of 0.975.

Suggested Citation

  • Yashu Liu & Xiaoyi Zhao & Xiaohua Qiu & Han-Bing Yan, 2024. "VCGERG: Vulnerability Classification With Graph Embedding Algorithm on Vulnerability Report Graphs," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 18(1), pages 1-21, January.
    • Handle: RePEc:igg:jisp00:v:18:y:2024:i:1:p:1-21
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISP.342596
    Download Restriction: no
    ---><---

    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:igg:jisp00:v:18:y:2024:i:1:p:1-21. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.