Abstract
Popularity prediction of online content over social media platforms is a valuable and challenging issue, the core of which lies in how to capture predictive factors from available data. However, existing studies either treat each cascade independently, which neglects the correlation among different cascades, or lack a comprehensive consideration of user behavioral proximity and preference with respect to different messages. Motivated by the above observation, this article proposes a graph neural network-based framework named HeDAN (heterogeneous diffusion attention network), which comprehensively considers various factors affecting information diffusion to provide more accurate prediction results. Specifically, we first construct a heterogeneous diffusion graph with two types of nodes (user and message) and three types of relations (friendship, interaction, and interest). Among them, friendship reflects the strength of social relationships between users, interaction reflects the behavioral proximity between users, and interest reflects user preference for information. Next, a graph neural network model with a hierarchical attention mechanism is proposed to learn from these relations. Specifically, at the node level, we utilize the graph attention network to learn the subgraph structure and generate the representations of users and messages under each specific relationship. At the semantic level, we distinguish the importance of different nodes in different relations via the multi-head self-attention mechanism and fuse them into the final prediction representation. Extensive experimental results on three real diffusion datasets show the superior performance of HeDAN over the state-of-the-art baselines.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.