Skip to content

Refining Heuristic-Based Bitcoin Address Clustering with Graph Neural Networks

Sep 2026 · 0 citations · 57 references
Computer Science

TL;DR

This work proposes a method for refining heuristic-obtained clusters by grounding the authors' clustering on contrastive embeddings yielded by graph neural networks, and releases a publicly available dataset of Bitcoin transaction graphs containing a substantial number of clusters.

Abstract

Bitcoin's pseudonymous nature makes it challenging to analyze user-level activity, since a single user may control multiple identifiers (addresses). Existing heuristic-based methods attempt to identify addresses belonging to the same user, but they often produce flat cluster assignments with limited modularity and are prone to errors such as merging different users together. In this work, we propose a method for refining heuristic-obtained clusters by grounding our clustering on contrastive embeddings yielded by graph neural networks. Our contributions are threefold: (i) we release a publicly available dataset of Bitcoin transaction graphs containing a substantial number of clusters; (ii) we propose a methodology for learning address embeddings consistent with heuristics, and back it up with theoretical guiding intuitions; (iii) through hierarchical clustering, we enable a finer analysis of heuristic clusters and provide a quantitative criterion for flagging suspicious merges.

View source

Similar papers

Aug 2026

Identifying key classes using biterm-sensitive PageRank with motif-based coreness

This paper introduces BiMo, a novel approach for identifying key classes in Java projects that significantly outperforms all baselines with significant differences, and is robust against different weighting mechanisms used to assign strengths for different relationship types in the CAN.

Wei-Feng Pan, Xiaoyong Cui, Ming Hua et al. · 0 citations
Open access Aug 2026

Learning with Blacklists on Graphs via Prototype-Guided Dual-Frequency Filtering

A scalable fraud detection framework that integrates prototype-guided graph abstraction with dualfrequency filtering to effectively learn from limited blacklists is proposed, and demonstrates that the proposed method consistently outperforms state-of-the-art approaches.

Hang Yu, Zheng-Yang Liu · 0 citations
Preprint Aug 2026

Disentangling Homophily and Rarity: Explaining Failure in Graph Neural Networks

It is demonstrated that the information needed to classify heterophilic nodes correctly is often recoverable by retraining the classification head of a model, or even just the final linear classification layer.

Preben M. Ness, Fariz Ikhwantri, D. Marijan · 0 citations
#machine learning Preprint Sep 2026

CAESAR: Clustering via Autonomous Embedding-Space Agglomerative Reorganization

CAESAR is a method that reorganizes a pretrained embedding space: a reorganization network is trained to pull mutual nearest neighbors together and push non-neighbors apart, yielding a reorganized embedding space substantially better suited to clustering.

Ilan Bacry, Rémi Devaux, A. Jardin · 0 citations
#graph neural networks Preprint Aug 2026

Rethinking Message Passing as Retrieval for Text-Attributed Graph Learning

This work proposes RTA, a simple MLP-based framework that replaces structural message passing with label-aware retrieval and propagation and provides theoretical insights that connect retrieval-based aggregation to softmax-attention message passing and establish the robustness of retrieved-context supervision to mis-re...

Jintang Li, Yuhong Chen, Ruo-Fan Wu et al. · 0 citations
Sep 2026

Semantic-Aware Heterogeneous Graph Learning for Fake News Detection.

Experimental results on real-world datasets demonstrate that SHEAR significantly outperforms existing methods in fake news detection, showcasing the benefits of incorporating behavioral semantic patterns with network motifs for enhanced classification performance.

Shuo Yu, Yu-Peng Gao, Jing Ren et al. · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.