Hierarchical Single-Linkage Clustering for Community Detection with Overlaps and Outliers

Ryan DeWolfe

Home/Archive/arXiv

arXiv · 2509.02334

Hierarchical Single-Linkage Clustering for Community Detection with Overlaps and Outliers

Ryan DeWolfe

View original source ↗Read source document ↗Export metadata ↓

Abstract

Most community detection approaches make very strong assumptions about communities in the data, such as every vertex must belong to exactly one community (the communities form a partition). For vector data, Hierarchical Density Based Spatial Clustering for Applications with Noise (HDBSCAN) has emerged as a leading clustering algorithm that allows for outlier points that do not belong to any cluster. The first step in HDBSCAN is to redefine the distance between vectors in such a way that single-linkage clustering is effective and robust to noise. Many community detection algorithms start with a similar step that attempts to increase the weight of edges between similar nodes and decrease weights of noisy edges. In this paper, we apply the hierarchical single-linkage clustering algorithm from HDBSCAN to a variety of node/edge similarity scores to see if there is an algorithm that can effectively detect clusters while allowing for outliers. In experiments on synthetic and real world data sets, we find that no single method is optimal for every type of graph, but the admirable performance indicates that hierarchical single-linkage clustering is a viable paradigm for graph clustering.

Explore related subjects

cs.SI

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ryan DeWolfe. 2025-09-02. Hierarchical Single-Linkage Clustering for Community Detection with Overlaps and Outliers. https://arxiv.org/abs/2509.02334

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

User Influence Analysis Based on Blogs

Rumor and word of mouth spread at the same speed as the highway of information diffusion in the age of the internet. Social networks play quite an important role in the huge internet. Nowadays, social networks have become indispensable in our lives, especially for the government and enterprises. A social network becomes a complex information diffusion network with users working as nodes and the relationships between users working as the vehicle. In this paper, we propose three kinds of algorithms for computing user influence based on the behavior of a user's forwarding microblogs and the symbol of @ in microblogs. We evaluate the effectiveness of the algorithms by comparing the results of our work with the training data in the dataset, and in the end, it proves that our algorithms work well.

cs.SI↗

arXiv2026

Location transparency reduces activity by accounts misrepresenting their location on X

Concerns about inauthentic accounts, including foreign actors posing as domestic voices, are central to debates about online discourse. Yet, little is known about accounts with inaccurate location claims and how they behave when discrepancies between their claimed and actual locations become publicly visible. In November 2025, X introduced an "About this account" feature that discloses each account's platform-inferred location of operation. We leverage this intervention in a large-scale quasi-experimental study of 8,200 politically engaged accounts claiming a U.S. location, comparing accounts whose disclosed locations matched versus contradicted their claims across 1.3 million posts and 3.6 million replies over 21 weeks. Before disclosure, location-mismatched accounts posted more misleading, scam-related, and cryptocurrency-related content, but showed no distinctive partisan leaning. Difference-in-differences estimates show that disclosure reduced the posting activity of location-mismatched accounts by 13.1% with the largest declines among accounts revealed to be in Africa (29.2%) and Asia (24.4%), and among accounts with VPN flags, username changes, or scam- and crypto-heavy content. Additionally, the decline in their replies was concentrated in interactions with U.S.-based recipients (10.3%), whereas replies to non-U.S.-based recipients showed no statistically significant change. Conversely, there was no significant change in average audience engagement with their posts. Location transparency thus works primarily by inducing restraint among the disclosed accounts rather than by shifting audience behaviour, and the accounts it constrains look at least as much like cross-border fraud as foreign political influence.

cs.SI↗

arXiv2026

Diffusion-Induced Spatial Attention Overlapping Community Detection

Detection of overlapping communities is essential for modelling networks in which nodes participate simultaneously in multiple structural or functional groups. Existing graph neural network approaches commonly rely on local message passing, which can obscure community boundaries through smoothing and limit the representation of structurally relevant long-range dependencies. We introduce Diffusion-Induced Spatial Attention Community Detection (DISCO), a deep-learning framework that combines a structural prior derived from influence spreading dynamics, sparse multi-head attention, and non-negative community-affiliation learning. The prior identifies candidate interactions beyond immediate graph neighbours and biases attention according to their structural proximity, while a Bernoulli-Poisson edge-reconstruction objective enables overlapping community inference from node attributes and structural profiles, or both. Benchmark experiments show that DISCO performs competitively against established graph convolutional and graph attention approaches across different input configurations. To demonstrate its practical applicability, we present a proof-of-concept cybersecurity use case in which changes between community assignments inferred from consecutive communication-network snapshots provide an interpretable anomaly signal. Temporal community similarity identifies structural deviations, while node-level contributions help locate the devices associated with them. DISCO therefore provides both a flexible method for overlapping community detection and a foundation for analysing structural change in dynamic networks.

cs.SI↗