Skip to main content
SpringerLink
Log in

Maximizing the earned benefit in an incentivized social networking environment: a community-based approach

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Given a social network of users represented as a directed graph with edge weight as diffusion probability, the Social Influence Maximization Problem asks for selecting a set of highly influential users for initial activation to maximize the influence in the network. In this paper, we study a variant of this problem, where nodes are associated with a selection cost signifying the incentive demand; a fixed budget is allocated for the seed set selection process; a subset of the nodes is designated as the target nodes, and each of them is associated with a benefit value that can be earned by influencing the corresponding target user; and the goal is to choose a seed set within the allocated budget for maximizing the earned benefit. Formally, we call this problem as the Earned Benefit Maximization in Incentivized Social Networking Environment or Earned Benefit Maximization Problem (EBM Problem), in short. For this problem, we develop a priority-based ranking methodology having three steps. First, marking the effective nodes for the given target nodes; second, priority computation of the effective nodes and the third is to choose the seed nodes based on this priority value within the budget. We implement the proposed methodology with two publicly available social network datasets and observe that the proposed methodology can achieve more benefit compared to the baseline methods. To improve the proposed methodology, we exploit the community structure of the network. Experimental results show that the incorporation of community structure helps the proposed methodology to achieve more benefit without much increase in computational burden.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Algesheimer R, Dholakia UM, Herrmann A (2005) The social influence of brand community: evidence from european car clubs. J Mark 69(3):19–34

    Article  Google Scholar 

  • Alon N, Gamzu I, Tennenholtz M (2012) Optimizing budget allocation among channels and influencers. In: Proceedings of the 21st international conference on World Wide Web, ACM, pp 381–388

  • Angell R, Schoenebeck G (2017) Dont be greedy: leveraging community structure to find high quality seed sets for influence maximization. In: International conference on web and internet economics. Springer, pp 16–29

  • Aslay C, Bonchi F, Lakshmanan LV, Lu W (2017) Revenue maximization in incentivized social advertising. Proc VLDB Endow 10(11):1238–1249

    Article  Google Scholar 

  • Bakshy E, Rosenn I, Marlow C, Adamic L (2012) The role of social networks in information diffusion. In: Proceedings of the 21st international conference on World Wide Web, ACM, pp 519–528

  • Banerjee S, Jenamani M, Pratihar DK (2018a) A survey on influence maximization in a social network. arXiv preprint arXiv:180805502

  • Banerjee S, Jenamani M, Pratihar DK, Sirohi A (2018b) A priority-based ranking approach for maximizing the earned benefit in an incentivized social network. In: International conference on intelligent systems design and applications. Springer, Berlin, pp 717–726

    Google Scholar 

  • Banerjee S, Jenamani M, Pratihar DK (2019) Maximizing the earned benefit in an incentivized social networking environment: An integer programming-based approach. In: Proceedings of the ACM India joint international conference on data science and management of data, ACM, pp 322–325

  • Bozorgi A, Haghighi H, Zahedi MS, Rezvani M (2016) Incim: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188–1199

    Article  Google Scholar 

  • Caliò A, Interdonato R, Pulice C, Tagarelli A (2018) Topology-driven diversity for targeted influence maximization with application to user engagement in social networks. IEEE Trans Knowl Data Eng

  • Cha M, Mislove A, Gummadi KP (2009) A measurement-driven analysis of information propagation in the flickr social network. In: Proceedings of the 18th international conference on World wide web, ACM, pp 721–730

  • Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 1029–1038

  • Chen Y, Chang S, Chou C, Peng W, Lee S (2012) Exploring community structures for influence maximization in social networks. In: Proceedings of the 6th SNA-KDD Workshop on social network mining and analysis held in conjunction with KDD12 (SNA-KDD12), pp 1–6

  • Chen YC, Zhu WY, Peng WC, Lee WC, Lee SY (2014) Cim: community-based influence maximization in social networks. ACM Trans Intell Syst Technolgy (TIST) 5(2):25

    Google Scholar 

  • Cheng C, Yang H, King I, Lyu MR (2012) Fused matrix factorization with geographical and social influence in location-based social networks. Aaai 12:17–23

    Google Scholar 

  • Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM international conference on information and knowledge management, ACM, pp 509–518

  • Cui L, Hu H, Yu S, Yan Q, Ming Z, Wen Z, Lu N (2018) Ddse: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119–130

    Article  Google Scholar 

  • De Bruyn A, Lilien GL (2008) A multi-stage model of word-of-mouth influence through viral marketing. Int J Res Mark 25(3):151–163

    Article  Google Scholar 

  • Doerr B, Fouz M, Friedrich T (2012) Why rumors spread so quickly in social networks. Commun ACM 55(6):70–75

    Article  Google Scholar 

  • Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 57–66

  • Goel S, Watts DJ, Goldstein DG (2012) The structure of online diffusion networks. In: Proceedings of the 13th ACM conference on electronic commerce, ACM, pp 623–638

  • Goyal A, Lu W, Lakshmanan LV (2011a) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web, ACM, pp 47–48

  • Goyal A, Lu W, Lakshmanan LV (2011b) Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining (ICDM), IEEE, pp 211–220

  • Güney E (2017) On the optimal solution of budgeted influence maximization problem in social networks. Oper Res 1–15

  • Han S, Zhuang F, He Q, Shi Z (2014) Balanced seed selection for budgeted influence maximization in social networks. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 65–77

    Chapter  Google Scholar 

  • Ibrahim RA, Hefny HA, Hassanien AE (2016) Group impact: local influence maximization in social networks. In: International conference on advanced intelligent systems and informatics. Springer, Berlin, pp 447–455

    Google Scholar 

  • Jung K, Heo W, Chen W (2012) Irie: Scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining (ICDM), IEEE, pp 918–923

  • Ke X, Khan A, Cong G (2018) Finding seeds and relevant tags jointly: For targeted influence maximization in social networks. In: Proceedings of the 2018 international conference on management of data, ACM, pp 1097–1111

  • Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 137–146

  • Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539–547

  • Li M, Sun Y, Jiang Y, Tian Z (2018a) Answering the min-cost quality-aware query on multi-sources in sensor-cloud systems. Sensors 18(12):4486

    Article  Google Scholar 

  • Li Y, Fan J, Wang Y, Tan KL (2018b) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng

  • Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130–147

    Article  Google Scholar 

  • Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Select Areas Commun 31(6):1084–1094

    Article  Google Scholar 

  • Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 international conference on management of data, ACM, pp 695–710

  • Nguyen HT, Thai MT, Dinh TN (2017) A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE/ACM Trans Netw (TON) 25(4):2419–2429

    Article  Google Scholar 

  • Ni Y, Shi Q, Wei Z (2017) Optimizing influence diffusion in a social network with fuzzy costs for targeting nodes. J Ambient Intell Hum Comput 8(5):819–826

    Article  Google Scholar 

  • Pan Y, Li DH, Liu JG, Liang JZ (2010) Detecting community structure in complex networks via node similarity. Phys A Stat Mech Appl 389(14):2849–2857

    Article  Google Scholar 

  • Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 61–70

  • Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: International semantic web conference. Springer, Berlin, pp 351–368

    Google Scholar 

  • Samper JJ, Castillo PA, Araujo L, Merelo J (2006) Nectarss, an rss feed ranking system that implicitly learns user preferences. arXiv preprint arXiv:cs/0610019

  • Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88–100

    Article  Google Scholar 

  • Su S, Li X, Cheng X, Sun C (2018) Location-aware targeted influence maximization in social networks. J Assoc Inf Sci Technol 69(2):229–241

    Article  Google Scholar 

  • Tan Q, Gao Y, Shi J, Wang X, Fang B, Tian ZH (2018) Towards a comprehensive insight into the eclipse attacks of tor hidden services. IEEE Internet Things J

  • Tang J, Tang X, Yuan J (2018a) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):10

    Article  Google Scholar 

  • Tang J, Zhang R, Yao Y, Zhao Z, Wang P, Li H, Yuan J (2018b) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl Based Syst 160:88–103

    Article  Google Scholar 

  • Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, ACM, pp 75–86

  • Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, ACM, pp 1539–1554

  • Tian Z, Su S, Shi W, Du X, Guizani M, Yu X (2019) A data-driven method for future internet route decision modeling. Future Gen Comput Syst 95:212–220

    Article  Google Scholar 

  • Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowle Discov 25(3):545–576

    Article  MathSciNet  Google Scholar 

  • Wang X, Deng K, Li J, Yu JX, Jensen CS, Yang X (2018) Targeted influence minimization in social networks. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 689–700

    Chapter  Google Scholar 

  • Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 1039–1048

  • Wen YT, Peng WC, Shuai HH (2018) Maximizing social influence on target users. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp 701–712

    Chapter  Google Scholar 

  • Ye M, Liu X, Lee WC (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, ACM, pp 671–680

  • Zhang K, Du H, Feldman MW (2017) Maximizing influence in a social network: Improved results using a genetic algorithm. Phys A Stat Mech Appl 478:20–30

    Article  Google Scholar 

Download references

Acknowledgements

Authors thank Ministry of Human Resource and Development, Government of India, for the project E-business Center of Excellence, Grant No. F.No.5-5/2014-TS.VII.

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, IIT Kharagpur, Kharagpur, India

    Suman Banerjee & Mamata Jenamani

  2. Department of Mechanical Engineering, IIT Kharagpur, Kharagpur, India

    Dilip Kumar Pratihar

Authors
  1. Suman Banerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mamata Jenamani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dilip Kumar Pratihar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suman Banerjee.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Banerjee, S., Jenamani, M. & Pratihar, D.K. Maximizing the earned benefit in an incentivized social networking environment: a community-based approach. J Ambient Intell Human Comput 11, 2539–2555 (2020). https://doi.org/10.1007/s12652-019-01308-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-019-01308-z

Keywords

Search

Navigation