Dec 16, 2012 · While in this paper we show that through supervised sampling, we can efficiently estimate the influence spread at only negligible cost of ...

While in this paper we show that through supervised sampling, we can efficiently estimate the influence spread at only negligible cost of precision, thus ...

Mar 15, 2023 · Bibliographic details on Know by a handful the whole sack: efficient sampling for top-k influential user identification in large graphs.

Abstract Influence Maximization aims to find the top-K influential individuals to maximize the influence spread within a social network, which remains an ...

2018. Know by a handful the whole sack: efficient sampling for top-k influential user identification in large graphs. X Liu, S Li, X Liao, S Peng, L Wang, Z ...

2018. Know by a handful the whole sack: efficient sampling for top-k influential user identification in large graphs. X Liu, S Li, X Liao, S Peng, L Wang, Z ...

Know by a handful the whole sack: efficient sampling for top-k influential user identification in large graphs ... users based on local features of the graph ...

2014. doi dblp · Know by a handful the whole sack: efficient sampling for top-k influential user identification in large graphs · Xiaodong Liu | Shanshan Li ...

2012: Know by a handful the whole sack: efficient sampling for top-k influential user identification in large graphs World Wide Web 17(4): 627-647 · Boting ...

Know by a handful the whole sack: efficient sampling for top-k influential user identification in large graphs · Xiaodong LiuShanshan LiXiangke LiaoShaoliang ...