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

A Unified Graph Theory Approach: Clustering and Learning in Criminal Data

Author

Listed:
  • Haifa Al-Ibrahim

    (Computer Science Department, College of Computer and Information Sciences, King Saud University, Riyadh 11451, Saudi Arabia)

  • Heba Kurdi

    (Computer Science Department, College of Computer and Information Sciences, King Saud University, Riyadh 11451, Saudi Arabia)

Abstract

Crime report clustering plays a critical role in modern law enforcement, enabling the identification of patterns and trends essential for proactive policing. However, traditional clustering approaches face significant challenges with the complex, unstructured nature of crime reports and their inherent sparse relationships. While graph-based clustering shows promise, issues of noise sensitivity and data sparsity persist. This study introduces a unified approach integrating spectral graph-based clustering with Graph Convolutional Networks (GCN) to address these challenges. The proposed approach encompasses data collection, preprocessing, linguistic feature extraction, vectorization, graph construction, graph learning, and clustering to effectively capture the intricate similarities between crime reports. The proposed approach achieved significant improvements over existing methods: a Silhouette Score of 0.77, a Davies–Bouldin Index of 0.51, and consistent performance across varying dataset sizes (100–1000 nodes). These results demonstrate the potential for enhanced crime pattern detection in law enforcement operations.

Suggested Citation

  • Haifa Al-Ibrahim & Heba Kurdi, 2024. "A Unified Graph Theory Approach: Clustering and Learning in Criminal Data," Mathematics, MDPI, vol. 12(23), pages 1-19, December.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3865-:d:1539818
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/23/3865/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/23/3865/
    Download Restriction: no
    ---><---

    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:12:y:2024:i:23:p:3865-:d:1539818. 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.