1 |
DOMINGOS P, RICHARDSON M. Mining the network value of customers [C]// Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2001: 57-66. 10.1145/502512.502525
|
2 |
程苏琦,沈华伟,张国清,等.符号网络研究综述[J].软件学报, 2014, 25(1): 1-15.
|
|
CHENG S Q, SHEN H W, ZHANG G Q, et al. Survey of signed network research[J]. Journal of Software, 2014, 25(1): 1-15.
|
3 |
KEMPE D, KLEINBERG J, TARDOS É. Maximizing the spread of influence through a social network [C]// Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2003: 137-146. 10.1145/956750.956769
|
4 |
LESKOVEC J, KRAUSE A, GUESTRIN C, et al. Cost-effective outbreak detection in networks [C]// Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2007: 420-429. 10.1145/1281192.1281239
|
5 |
GOYAL A, LU W, LAKSHMANAN L V S. CELF++: optimizing the greedy algorithm for influence maximization in social networks [C]// Proceedings of the 20th International Conference Companion on World Wide Web. New York: ACM, 2011: 47-48. 10.1145/1963192.1963217
|
6 |
CHEN W, WANG Y J, YANG S Y. Efficient influence maximization in social networks [C]// Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2009: 199-208. 10.1145/1557019.1557047
|
7 |
BORGS C, BRAUTBAR M, CHAYES J, et al. Maximizing social influence in nearly optimal time [C]// Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014: 946-957. 10.1137/1.9781611973402.70
|
8 |
TANG Y Z, XIAO X K, SHI Y C. Influence maximization: near-optimal time complexity meets practical efficiency [C]// Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. New York: ACM, 2014: 75-86. 10.1145/2588555.2593670
|
9 |
TANG Y Z, SHI Y C, XIAO X K. Influence maximization in near-linear time: a martingale approach [C]// Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. New York: ACM, 2015: 1539-1554. 10.1145/2723372.2723734
|
10 |
LI D, XU Z M, CHAKRABORTY N, et al. Polarity related influence maximization in signed social networks[J]. PLoS ONE, 2014, 9(7): No.e102199. 10.1371/journal.pone.0102199
|
11 |
LI D, WANG C H, ZHANG S P, et al. Positive influence maximization in signed social networks based on simulated annealing[J]. Neurocomputing, 2017, 260: 69-78. 10.1016/j.neucom.2017.03.003
|
12 |
WANG H H, YANG Q, FANG L, et al. Maximizing positive influence in signed social networks [C]// Proceedings of the 2015 International Conference on Cloud Computing and Security, LNCS 9483. Cham: Springer, 2015: 356-367.
|
13 |
HOSSEINI-POZVEH M, ZAMANIFAR K, NAGHSH-NILCHI A R, et al. Maximizing the spread of positive influence in signed social networks[J]. Intelligent Data Analysis, 2016, 20(1): 199-218. 10.3233/ida-150801
|
14 |
JU W J, CHEN L, LI B, et al. A new algorithm for positive influence maximization in signed networks[J]. Information Sciences, 2020, 512: 1571-1591. 10.1016/j.ins.2019.10.061
|
15 |
QIU L Q, ZHANG S, YU J F. Positive influence maximization in the signed social networks considering polarity relationship and propagation probability[J]. International Journal of Software Engineering and Knowledge Engineering, 2021, 31(2): 249-267. 10.1142/s0218194021500078
|
16 |
NGUYEN H T, THAI M T, DINH T N. Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks [C]// Proceedings of the 2016 International Conference on Management of Data. New York: ACM, 2016: 695-710. 10.1145/2882903.2915207
|
17 |
杨书新,梁文,朱凯丽.基于三级邻居的复杂网络节点影响力度量方法[J].电子与信息学报, 2020, 42(5): 1140-1148. 10.11999/JEIT190440
|
|
YANG S X, LIANG W, ZHU K L. Measurement of node influence based on three-level neighbor in complex networks[J]. Journal of Electronics and Information Technology, 2020, 42(5): 1140-1148. 10.11999/JEIT190440
|
18 |
ŞIMŞEK A. A new greedy algorithm for influence maximization on signed social networks[J]. Gazi Journal of Engineering Sciences, 2019, 5(3): 250-257. 10.30855/gmbd.2019.03.06
|
19 |
LIU W, CHEN X, JEON B, et al. Influence maximization on signed networks under independent cascade model[J]. Applied Intelligence, 2019, 49(3): 912-928. 10.1007/s10489-018-1303-2
|
20 |
SRIVASTAVA A, CHELMIS C, PRASANNA V K. Social influence computation and maximization in signed networks with competing cascades [C]// Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. New York: ACM, 2015: 41-48. 10.1145/2808797.2809304
|
21 |
GARIMELLA K, GIONIS A, PAROTSIDIS N, et al. Balancing information exposure in social networks [C]// Proceedings of the 31st International Conference on Neural Information Processing Systems. Red Hook, NY: Curran Associates Inc., 2017: 4666-4674.
|