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

Two-Stage Mining of Linkage Risk for Data Release

Author

Listed:
  • Runshan Hu

    (School of Computer Engineering, Jimei University, Xiamen 361021, China
    These authors contributed equally to this work.)

  • Yuanguo Lin

    (School of Computer Engineering, Jimei University, Xiamen 361021, China
    These authors contributed equally to this work.)

  • Mu Yang

    (Birkbeck, University of London, London WC1E 7HX, UK)

  • Yuanhui Yu

    (School of Computer Engineering, Jimei University, Xiamen 361021, China)

  • Vladimiro Sassone

    (School of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, UK)

Abstract

Privacy risk mining, a crucial domain in data privacy protection, endeavors to uncover potential information among datasets that could be linked to individuals’ sensitive data. Existing anonymization and privacy assessment techniques either lack quantitative granularity or fail to adapt to dynamic, heterogeneous data environments. In this work, we propose a unified two-phase linkability quantification framework that systematically measures privacy risks at both the inter-dataset and intra-dataset levels. Our approach integrates unsupervised clustering on attribute distributions with record-level matching to compute interpretable, fine-grained risk scores. By aligning risk measurement with regulatory standards such as the GDPR, our framework provides a practical, scalable solution for safeguarding user privacy in evolving data-sharing ecosystems. Extensive experiments on real-world and synthetic datasets show that our method achieves up to 96.7% precision in identifying true linkage risks, outperforming the compared baseline by 13 percentage points under identical experimental settings. Ablation studies further demonstrate that the hierarchical risk fusion strategy improves sensitivity to latent vulnerabilities, providing more actionable insights than previous privacy gain-based metrics.

Suggested Citation

  • Runshan Hu & Yuanguo Lin & Mu Yang & Yuanhui Yu & Vladimiro Sassone, 2025. "Two-Stage Mining of Linkage Risk for Data Release," Mathematics, MDPI, vol. 13(17), pages 1-30, August.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2731-:d:1732276
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/17/2731/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/17/2731/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:gam:jmathe:v:13:y:2025:i:17:p:2731-:d:1732276. 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.