Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study
The influence maximization (IM) problem identifies the subset of influential users in the
network to provide solutions for real-world problems like outbreak detection, viral marketing …
network to provide solutions for real-world problems like outbreak detection, viral marketing …
New trends in influence maximization models
The growing popularity of social networks is providing a promising opportunity for different
practical applications. The influence analysis is an essential technique supporting the …
practical applications. The influence analysis is an essential technique supporting the …
Influence maximization on social graphs: A survey
Influence Maximization (IM), which selects a set of k users (called seed set) from a social
network to maximize the expected number of influenced users (called influence spread), is a …
network to maximize the expected number of influenced users (called influence spread), is a …
Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks
Influence Maximization (IM), that seeks a small set of key users who spread the influence
widely into the network, is a core problem in multiple domains. It finds applications in viral …
widely into the network, is a core problem in multiple domains. It finds applications in viral …
A survey on influence maximization in a social network
Given a social network with diffusion probabilities as edge weights and a positive integer k,
which k nodes should be chosen for initial injection of information to maximize the influence …
which k nodes should be chosen for initial injection of information to maximize the influence …
A survey on influence maximization: From an ml-based combinatorial optimization
Influence Maximization (IM) is a classical combinatorial optimization problem, which can be
widely used in mobile networks, social computing, and recommendation systems. It aims at …
widely used in mobile networks, social computing, and recommendation systems. It aims at …
Online processing algorithms for influence maximization
J Tang, X Tang, X ** algorithm to identify influential nodes for influence maximization in social networks
Influence maximization problem aims to select a subset of k most influential nodes from a
given network such that the spread of influence triggered by the seed set will be maximum …
given network such that the spread of influence triggered by the seed set will be maximum …
Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs
There has been an increased interest in discovering heuristics for combinatorial problems
on graphs through machine learning. While existing techniques have primarily focused on …
on graphs through machine learning. While existing techniques have primarily focused on …