1 citations · 1 across the 4 of their papers we have counts for
4 papers
Sender--Receiver Community Detection in Directed Networks via Node-Role-Constrained Edge Clustering
Duy Hieu Do
Directed community detection is challenging because edge directions encode asymmetric source-target relations. Most directed modularity and random-walk methods assign one label to…
Forward--Backward Green Cosine Geometry for Directed Community Detection and Overlap Expansion
Duy Hieu Do
Community detection in directed graphs is challenging because edge asymmetry induces non-reversible diffusion, direction-dependent accessibility, and distinct source and target rol…
An improvement on the Louvain algorithm using random walks
Duy Hieu Do, Thi Ha Duong Phan
We will present improvements to famous algorithms for community detection, namely Newman's spectral method algorithm and the Louvain algorithm. The Newman algorithm begins by treat…
Overlapping community detection algorithms using Modularity and the cosine
Do Duy Hieu, Phan Thi Ha Duong
The issue of network community detection has been extensively studied across many fields. Most community detection methods assume that nodes belong to only one community. However,…