Refining Heuristic-Based Bitcoin Address Clustering with Graph Neural Networks

• URL: http://arxiv.org/abs/2609.01942v1
• Date: Tue, 01 Sep 2026 23:15:38 GMT
• Title: Refining Heuristic-Based Bitcoin Address Clustering with Graph Neural Networks
• Abstract summary: Bitcoin's pseudonymous nature makes it challenging to analyze user-level activity.<n>Existing methods attempt to identify addresses belonging to the same user, but they often produce flat cluster assignments.<n>We propose a method for refining-obtained clusters by grounding our clustering on contrastive embeddings.
• Score: 18.35336883877571
• License: http://creativecommons.org/licenses/by-sa/4.0/
• 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.

Related papers

• RCC-PFL: Robust Client Clustering under Noisy Labels in Personalized Federated Learning [8.37314799155978]
  We propose a label-agnostic data similarity-based clustering algorithm, coined RCC-PFL.<n>We show that it outperforms multiple baselines in terms of average accuracy and variance reduction.
  arXiv  Detail & Related papers  (2025-03-25T17:50:54Z)
• Personalized Clustering via Targeted Representation Learning [12.685373069492448]
  Clustering traditionally aims to reveal a natural grouping structure within unlabeled data.<n>We propose a personalized clustering method that explicitly performs targeted representation learning.
  arXiv  Detail & Related papers  (2024-12-18T10:28:51Z)
• A Dirichlet stochastic block model for composition-weighted networks [0.0]
  We propose a block model for composition-weighted networks based on direct modelling of compositional weight vectors.<n>Inference is implemented via an extension of the classification expectation-maximisation algorithm.<n>The model is validated using simulation studies, and showcased on network data from the Erasmus exchange program and a bike sharing network for the city of London.
  arXiv  Detail & Related papers  (2024-08-01T15:41:07Z)
• Cluster-based Graph Collaborative Filtering [55.929052969825825]
  Graph Convolution Networks (GCNs) have succeeded in learning user and item representations for recommendation systems. Most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. We propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF)
  arXiv  Detail & Related papers  (2024-04-16T07:05:16Z)
• Self Supervised Correlation-based Permutations for Multi-View Clustering [7.093692674858257]
  We propose an end-to-end deep learning-based multi-view clustering framework for general data types.<n>Our approach involves generating meaningful fused representations using a novel permutation-based canonical correlation objective.
  arXiv  Detail & Related papers  (2024-02-26T08:08:30Z)
• Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
  We propose a new deep graph clustering method termed Reinforcement Graph Clustering. In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework. In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
  arXiv  Detail & Related papers  (2023-08-13T18:12:28Z)
• Interpretable Deep Clustering for Tabular Data [7.972599673048582]
  Clustering is a fundamental learning task widely used in data analysis. We propose a new deep-learning framework that predicts interpretable cluster assignments at the instance and cluster levels. We show that the proposed method can reliably predict cluster assignments in biological, text, image, and physics datasets.
  arXiv  Detail & Related papers  (2023-06-07T21:08:09Z)
• Hard Regularization to Prevent Deep Online Clustering Collapse without Data Augmentation [65.268245109828]
  Online deep clustering refers to the joint use of a feature extraction network and a clustering model to assign cluster labels to each new data point or batch as it is processed. While faster and more versatile than offline methods, online clustering can easily reach the collapsed solution where the encoder maps all inputs to the same point and all are put into a single cluster. We propose a method that does not require data augmentation, and that, differently from existing methods, regularizes the hard assignments.
  arXiv  Detail & Related papers  (2023-03-29T08:23:26Z)
• Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning [146.11600461034746]
  Method for unsupervised meta-learning, CACTUs, is a clustering-based approach with pseudo-labeling. This approach is model-agnostic and can be combined with supervised algorithms to learn from unlabeled data. We prove that the core reason for this is lack of a clustering-friendly property in the embedding space.
  arXiv  Detail & Related papers  (2022-09-27T19:04:36Z)
• Learning Hierarchical Graph Neural Networks for Image Clustering [81.5841862489509]
  We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level.
  arXiv  Detail & Related papers  (2021-07-03T01:28:42Z)
• Heterogeneous Graph Neural Networks for Malicious Account Detection [64.0046412312209]
  We present GEM, the first heterogeneous graph neural network approach for detecting malicious accounts. We learn discriminative embeddings from heterogeneous account-device graphs based on two fundamental weaknesses of attackers, i.e. device aggregation and activity aggregation. Experiments show that our approaches consistently perform promising results compared with competitive methods over time.
  arXiv  Detail & Related papers  (2020-02-27T18:26:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.