Abstract: There is significant current interest in the problem of influence maximization: given a directed social network with influence weights on edges and a number k, find k seed nodes such that ...
We use the Simpath similarity matrix in a heterogeneous network as the importance weight between neighboring nodes, which is more interpretable than training with a neural network. After using the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback