Name
Abstract | ||
|---|---|---|
Influence maximization is a classic problem in Online Social Networks (OSNs) especially for viral markets. It has been proposed to help a company to select a set of seed users for promotion given a predefined budget (e.g., the set size k). The budget-making is of challenging due to the difficulty in trade off between profit and expense. Moreover, the current studies on influence maximization focus on the independent product promotion without considering the impacts of other products that users already have. In this paper, we define a general influence maximization problem in a practical context of coexistence of multiple products. To capture the impacts of existing products, we present a new measurement of influence between users. Besides, the objective of our general problem is to maximize the profit/cost ratio which can reflects maximization effects better and meanwhile avoids the difficulty of budget-making. We propose an approximate algorithm for ratio maximization. Evaluations with two real world datasets validate the efficiency of our proposed solution. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/CBD.2017.47 | 2017 Fifth International Conference on Advanced Cloud and Big Data (CBD) |
Keywords | Field | DocType |
influence maximization,online social networks,submodular maximization,approximation | Mathematical optimization,Social network,Computer science,Submodular maximization,Maximization,Cost efficiency | Conference |
ISSN | ISBN | Citations |
2573-301X | 978-1-5386-1073-2 | 1 |
PageRank | References | Authors |
0.35 | 15 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing-Ya Zhou | 1 | 64 | 16.35 |
| Jianxi Fan | 2 | 718 | 60.15 |
| Jin Wang | 3 | 121 | 17.02 |
| Xi Wang | 4 | 85 | 6.56 |
| Baolei Cheng | 5 | 34 | 6.94 |