An efficient algorithm for influence maximization under linear threshold model

Zhou, Shengfu; Yue, Kun; Fang, Qiyu; Zhu, Yunlei; Liu, Weiyi

doi:10.1109/ccdc.2014.6852220

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2023

Publication Types

Select...

Article3

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2014 [4] Shengfu Zhou et al says that traditional greedy algorithm is not very efficient for large networks. They proposed a more efficient greedy algorithm.…”

Section: Related Workmentioning

confidence: 99%

Maximization Influence Flow Using Modified Greedy Algorithm

Ran¹

2017

ijecs

View full text Add to dashboard Cite

Abstract:The influence maximization problem is of finding a set of seed nodes in social network through which we can maximize the spread of influence. These seed nodes can be used in online marketing so as to maximize the profit. Marketers can get particular group of customers through online market. In this paper we are modifying greedy algorithm so as to maximize results of influence maximization.

show abstract

“…In 2014 [4] Shengfu Zhou et al says that traditional greedy algorithm is not very efficient for large networks. They proposed a more efficient greedy algorithm.…”

Section: Related Workmentioning

confidence: 99%