Journal Article10.1016/j.amc.2022.127721
Influence maximization through exploring structural information
30
TL;DR: Wang et al. as discussed by the authors proposed a layered gravity bridge algorithm (LGB) to address the influence maximization problem, which emphasizes the local structural information of networks and combines community detection algorithms with an improved gravity model.
read more
About: This article is published in Applied Mathematics and Computation. The article was published on 01 Apr 2023. The article focuses on the topics: Computer science & Maximization.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multimodal fake news detection through data augmentation-based contrastive learning
TL;DR: The authors proposed a novel machine learning based framework, i.e., BERT-based back-translation Text and Entire-image multimodal model with Contrastive learning (TTEC).
54
A novel higher-order neural network framework based on motifs attention for identifying critical nodes
Xiuming Zhao,Hongtao Yu,Ruiyang Huang,Shuxin Liu,Nan Hu,Xiaochun Cao +5 more
- 01 Sep 2023
TL;DR: This study proposes HONNMA, a novel higher-order neural network framework that leverages motif-attention to identify critical nodes in networks by encoding higher-order interactions and learning attention weights, outperforming state-of-the-art methods on four real-world datasets.
6
Influence Maximization in social networks using discretized Harris’ Hawks Optimization algorithm
TL;DR: This paper proposes a discretized Harris' Hawks Optimization algorithm, DHHO, for Influence Maximization in social networks, outperforming competing meta-heuristic and heuristic approaches across five metrics on eight social networks with reduced computational cost.
6
Efficient approaches for attaining epidemic-free networks with minimum edge removal set
Yang Liu,Guangbo Liang,Xi Wang,Zhuoyu Wang,Peican Zhu,Zhen Wang +5 more
TL;DR: This paper proposes three novel methods to find the minimum edge removal set for epidemic-free networks, balancing transmission characteristics and network topology, and outperforming state-of-the-art methods with improved efficiency and scalability.
5
References
Fast unfolding of communities in large networks
Vincent D. Blondel,Jean-Loup Guillaume,Jean-Loup Guillaume,Renaud Lambiotte,Renaud Lambiotte,Etienne Lefebvre +5 more
TL;DR: This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
•Proceedings Article
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence Page,Sergey Brin,Rajeev Motwani,Terry Winograd +3 more
- 11 Nov 1999
TL;DR: This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
16.4K
A Set of Measures of Centrality Based on Betweenness
Linton C. Freeman
- 01 Mar 1977
TL;DR: A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced in this paper, which define centrality in terms of the degree to which a point falls on the shortest path between others and there fore has a potential for control of communication.
10.1K
Maximizing the Spread of Influence through a Social Network
TL;DR: The problem of finding the most influential nodes in a social network is NP-hard as mentioned in this paper, and the first provable approximation guarantees for efficient algorithms were provided by Domingos et al. using an analysis framework based on submodular functions.
Epidemic Spreading in Scale-Free Networks
TL;DR: A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.
6.4K