Proceedings of the 13th International Conference on Web Search and Data Mining 2020
DOI: 10.1145/3336191.3371834
|View full text |Cite
|
Sign up to set email alerts
|

Popularity Prediction on Social Platforms with Coupled Graph Neural Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
93
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 117 publications
(93 citation statements)
references
References 29 publications
0
93
0
Order By: Relevance
“…• CoupledGNN [27] applies two coupled graph neural networks to iteratively model and predicts the network-aware popularity.…”
Section: ) Baselinesmentioning
confidence: 99%
“…• CoupledGNN [27] applies two coupled graph neural networks to iteratively model and predicts the network-aware popularity.…”
Section: ) Baselinesmentioning
confidence: 99%
“…(1) Compared with TAP [12], TwitterRank [15] and TS-SRW that directly identify influencers in rare topics from the massive social messages, DID outperforms by iteratively learning an accurate subject filter. (2) As combination models, Filter+ReF [13], Filter+RR-LT [17] and Fil-ter+CoupledGNN [3] train the influencer detection model with fixed social message filters. In contrast, our proposed DID can adaptively update the subject filter for better influencer detection performance.…”
Section: Experiments 31 Experimental Setupmentioning
confidence: 99%
“…To take full advantage of multiple interactions in social networks, we integrate them with trainable weight functions. The influence propagation is modeled by GNNs with a loss function considering neighborhood and topic [3,13,17], while several studies aim to identify topic-specific influencers [12,14,15]. Although some approaches [1,2,7] also integrate topic discovery and social influence analysis, the influencers are restricted to popular topics in social media only.…”
Section: Introductionmentioning
confidence: 99%
“…Consequently, the elements of % refer to buckets or lines, each containing a list of entries. Each % [8] contains the address of the i-th bucket. Since entries have a similar size, i.e., a user 83 and a set of positions with a number of elements between 1 and f 1, we can store in a block with size ⌫ between ⌫/(|83 |+(f 1).|?…”
Section: =3mentioning
confidence: 99%
“…These dierent characteristics make these platforms a tool particularly used to communicate information to a large number of people. In these networks, the most popular and inuential users have quickly been the center of attention for many applications, since they will accelerate the spread of information to the greatest number of users [8]. For instance, for online advertising campaigns on social networks or on the Web, advertisers seek to place their advertisements among the users who have the most visibility in order to reach a maximum of people [2,5,9].…”
Section: Introductionmentioning
confidence: 99%