Cited by 587Complex Network Analysis TechniquesRecommender Systems and TechniquesDigital Marketing and Social Media

DeepInf: Social Influence Prediction with Deep Learning

Open access
Qiu, Jiezhong, Tang, Jian, Ma, Hao, Dong, Yuxiao, Wang, Kuansan, Tang, Jie·2018·Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Abstract

Social and information networking activities such as on Facebook, Twitter, WeChat, and Weibo have become an indispensable part of our everyday life, where we can easily access friends' behaviors and are in turn influenced by them. Consequently, an effective social influence prediction for each user is critical for a variety of applications such as online recommendation and advertising.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3219819.3220077

Cites

63 of 63 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • This argument has been pointed out in several papers, where it is proposed to improve conventional graph attention mechanisms by projecting the concatenated features once onto the learning matrix.

    “This argument has already been pointed out in several papers, e.g., in [91][92][93], where it is proposed to improve the performance of conventional graph attention mechanisms by projecting the concatenated features once onto the learning matrix.”

    From TVGeAN: Tensor Visibility Graph-Enhanced Attention Network for Versatile Multivariant Time Series Learning Tasks (2024) · cites this paper as [91]

    Section 3.2 (p. 4) describes attention computed from concatenated, transformed node features, so the source supports the claim’s reference to a concatenation-based graph-attention mechanism. It presents this as following Veličković et al., however, and does not propose projecting concatenated features once as an improvement over conventional GAT. Section 5.2 (p. 7) instead reports that the concatenation-based mechanism outperformed the alternative attention mechanisms the authors tried. (LLM, conf=0.84)

    Experimental — accuracy not yet measured
  • Several GAT variants have been developed to overcome GAT limitations using strategies such as multi-headed attention, restricting aggregation to top-K neighbors, and reordering GAT operations.

    “Some notable examples are the use of multi-headed attention mechanisms at each node of the GNN [91], the restriction of aggregation to the neighbors with the highest K-attention scores [92], and the reordering of GAT operations [93].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. [25][25] Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. ICLR '17 (2017). -
  2. [31][31] Andrew L Maas, Awni Y Hannun, and Andrew Y Ng. 2013. Rectifier nonlinearities improve neural network acoustic models. In ICML '13 . 3. -
  3. [43][43] Jie Tang, Sen Wu, and Jimeng Sun. 2013. Confluence: Conformity influence in large social networks. In KDD '13 . ACM, 347-355. -
  4. [44][44] Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. Arnetminer: extraction and mining of academic social networks. In KDD '08 . 990-998. -

Cited by

Sorted by citations

Authors
Qiu, J., Tang, J., Ma, H., Dong, Y., Wang, K., & Tang, J.
Affiliations
  • Tsinghua University (CN)
  • HEC Montréal (CA)
  • Microsoft (United States) (US)
Venue
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2018-07-19
Pages
2110-2119
OpenAlex
W2809583854
Cited by
587
References
63
Citations by year
2026: 31 · 2025: 78 · 2024: 76 · 2023: 74 · 2022: 87 · 2021: 133 · 2020: 79 · 2019: 27 · 2018: 2
FWCI
88.40
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
Funders
  • NSFC (61561130160)
  • National Basic Research Program of China (2015CB358700)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Social Sciences › Sociology and Political Science › Digital Marketing and Social Media
Keywords
social networks, information dissemination, social media, user behavior, online recommendation, advertising

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review