2019
DOI: 10.1007/s13278-019-0598-2
|View full text |Cite
|
Sign up to set email alerts
|

Influence maximization in graph-based OLAP (GOLAP)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 80 publications
0
4
0
Order By: Relevance
“…The following heuristic algorithm is for the IM-SIP problem which is NP-complete [ 33 ]. The heuristic algorithm is greedy.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The following heuristic algorithm is for the IM-SIP problem which is NP-complete [ 33 ]. The heuristic algorithm is greedy.…”
Section: Methodsmentioning
confidence: 99%
“…The correctness and error bounds of the heuristic are proved in [ 33 ]. In the past, some studies apply network analysis methods to gene regulatory networks to solve the influence maximization problem or develop gene regulatory networks.…”
Section: Methodsmentioning
confidence: 99%
“…It should be note that Jin [34] et al present a comprehensive approach to managing influence networks using extended graph models. They discuss a method to find a Strongest Influence Path (SIP) from a source node to a target node.…”
Section: Golapmentioning
confidence: 99%
“…Figure 1 is the MSNs model. Influence Maximization (IM) [8][9][10][11][12][13][14][15][16] problem is proposed for the study of social networks, and it comes from marketing of economics. Using social network method to analyze the social relations of mobile users in the network can further improve the efficiency of information transmission and forwarding.…”
Section: Introductionmentioning
confidence: 99%