HANP

Overview

The HANP (Hop Attenuation & Node Preference) algorithm extends the traditional Label Propagation algorithm (LPA) by incorporating a label score attenuation mechanism and considering the influence of neighbor node degree on neighbor label weight. The goal of HANP is to improve the accuracy and robustness of community detection in networks, it was proposed in 2009：

• I.X.Y. Leung, P. Hui, P. Liò, J. Crowcroft, Towards real-time community detection in large networks (2009)

Concepts

Hop Attenuation

HANP associates each label with a score which decreases as it propagates from its origin. All labels are initially given a score of 1. Each time a node adopts new label from its neighborhood, a new attenuated score would be assigned to this new label by subtracting the hop attenuation δ (0 < δ < 1).

The hop attenuation mechanism limits the propagation of labels to nearby nodes and prevents them from spreading too broadly across the network.

Node Preference

In the calculation of the new maximal label, HANP incorporates node preference based on node degree. When node j ∈ N_i propagates its label L to node i, the weight of label L is calculated by:

where,

• s_j(L) is the score of label L in j.
• deg_j is the degree of j. When m > 0, more preference is given to node with high degree; m < 0, more preference is given to node with low degree; m = 0, no node preference is applied.
• w_ij is the sum of edge weights between i and j.

As the edge weights and label scores denoted in the example below, set m = 2 and δ = 0.2, the label of the blue node will be updated from d to a, and the score of label a in the blue node will be attenuated to 0.6.

Considerations

• HANP ignores the direction of edges but calculates them as undirected edges.
• Node with self-loops propagates its current label(s) to itself, and each self-loop is counted twice.
• When the selected label is equal to the current label, let δ = 0.
• HANP follows the synchronous update principle when updating node labels. This means that all nodes update their labels simultaneously based on the labels of their neighbors. The label score mechanism can prevent label oscillations.
• Due to factors such as the order of nodes, the random selection of labels with equal weights, and parallel calculations, the community division results of HANP may vary.

Syntax

• Command: algo(hanp)
• Parameters:

Examples

The example graph is as follows, nodes are of schema user, edges are of schema connect, the value of @connect.strength is shown in the graph:

File Writeback

UQL
algo(hanp).params({ 
  loop_num: 10,
  edge_weight_property: 'strength',
  m: 2, 
  delta: 0.2 
}).write({
  file:{
    filename: 'hanp'
  }
})

Statistics: label_count = 4
Results: File hanp

File
O,13,-0.600000,
N,6,-1.000000,
M,6,-1.000000,
L,13,-0.600000,
K,13,-0.600000,
J,1,-0.200000,
I,1,-0.200000,
H,1,-0.200000,
G,1,-0.200000,
F,14,-1.000000,
E,6,-0.200000,
D,6,-0.200000,
C,6,-0.200000,
B,6,-0.200000,
A,6,-0.400000,

Property Writeback

UQL
algo(hanp).params({ 
  node_label_property: '@user.interest',
  m: 0.1, 
  delta: 0.3
}).write({
  db:{
    property: 'lab'
  }
})

Statistics: label_count = 3
Results: The label and label score of each node is written to new properties lab_1 and score_1

Direct Return

UQL
algo(hanp).params({ 
  loop_num: 12,
  node_label_property: '@user.interest',
  m: 1,
  delta: 0.2
}) as res, stats
return res, stats

Results: res and stats

Stream Return

UQL
algo(hanp).params({ 
  loop_num: 12,
  node_label_property: '@user.interest',
  m: 1,
  delta: 0.2
}).stream() as hanp
group by hanp.label_1
with count(hanp) as labelCount
return table(hanp.label_1, labelCount) 
order by labelCount desc

Results: table(hanp.label_1, labelCount)

Stats Return

UQL
algo(hanp).params({ 
  loop_num: 5,
  node_label_property: 'interest',
  m: 0.6,
  delta: 0.2
}).stats() as count
return count

Results: count