Recruiting the K-most influential prospective workers for crowdsourcing platforms

被引:0
|
作者
Maryam Shahsavari
Alireza Hashemi Golpayegani
Morteza Saberi
Farookh Khadeer Hussain
机构
[1] Amirkabir University of Technology,Department of Computer Engineering and Information Technology
[2] University of New South Wales Canberra,School of Business, Australian Defence Forces Academy
[3] University of Technology Sydney,Faculty of Engineering and Information Technology, School of Software and Centre for Artificial Intelligence
关键词
Social networks; Social influence; Information propagation; Information maximization; -most influential nodes;
D O I
10.1007/s11761-018-0247-z
中图分类号
学科分类号
摘要
Viral marketing is widely used by businesses to achieve their marketing objectives using social media. In this work, we propose a customized crowdsourcing approach for viral marketing which aims at efficient marketing based on information propagation through a social network. We term this approach the social community-based crowdsourcing platform and integrate it with an information diffusion model to find the most efficient crowd workers. We propose an intelligent viral marketing framework (IVMF) comprising two modules to achieve this end. The first module identifies the K-most influential users in a given social network for the platform using a novel linear threshold diffusion model. The proposed model considers the different propagation behaviors of the network users in relation to different contexts. Being able to consider multiple topics in the information propagation model as opposed to only one topic makes our model more applicable to a diverse population base. Additionally, the proposed content-based improved greedy (CBIG) algorithm enhances the basic greedy algorithm by decreasing the total amount of computations required in the greedy algorithm (the total influence propagation of a unique node in any step of the greedy algorithm). The highest computational cost of the basic greedy algorithm is incurred on computing the total influence propagation of each node. The results of the experiments reveal that the number of iterations in our CBIG algorithm is much less than the basic greedy algorithm, while the precision in choosing the K influential nodes in a social network is close to the greedy algorithm. The second module of the IVMF framework, the multi-objective integer optimization model, is used to determine which social network should be targeted for viral marketing, taking into account the marketing budget. The overall IVMF framework can be used to select a social network and recruit the K-most influential crowd workers. In this paper, IVMF is exemplified in the domain of personal care industry to show its importance through a real-life case.
引用
收藏
页码:247 / 257
页数:10
相关论文
共 38 条
  • [1] Recruiting the K-most influential prospective workers for crowdsourcing platforms
    Shahsavari, Maryam
    Golpayegani, Alireza Hashemi
    Saberi, Morteza
    Hussain, Farookh Khadeer
    [J]. SERVICE ORIENTED COMPUTING AND APPLICATIONS, 2018, 12 (3-4) : 247 - 257
  • [2] k-most suitable locations selection
    Yu-Chi Chung
    I-Fang Su
    Chiang Lee
    [J]. GeoInformatica, 2018, 22 : 661 - 692
  • [3] k-most suitable locations selection
    Chung, Yu-Chi
    Su, I-Fang
    Lee, Chiang
    [J]. GEOINFORMATICA, 2018, 22 (04) : 661 - 692
  • [4] Mining the K-most interesting frequent patterns sequentially
    Minh, Quang Tran
    Oyanagi, Shigeru
    Yamazaki, Katsuhiro
    [J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2006, PROCEEDINGS, 2006, 4224 : 620 - 628
  • [5] Finding K-most influential users in social networks for information diffusion based on network structure and different user behavioral patterns
    Shahsavari, Maryam
    Golpayegani, Alireza Hashemi
    [J]. 2017 IEEE 14TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE 2017), 2017, : 220 - 225
  • [6] Finding the k-Most Abnormal Subgraphs from a Single Graph
    Wang, JianBin
    Chou, Bin-Hui
    Suzuki, Einoshin
    [J]. DISCOVERY SCIENCE, PROCEEDINGS, 2009, 5808 : 441 - 448
  • [7] k-most suitable locations problem: greedy search approach
    Mirghaderi S.-H.
    Hassanizadeh B.
    [J]. International Journal of Industrial and Systems Engineering, 2022, 42 (01): : 80 - 95
  • [8] AN ALGORITHM DIRECTLY FINDING THE K-MOST PROBABLE CONFIGURATIONS IN BAYESIAN NETWORKS
    SEROUSSI, B
    GOLMARD, JL
    [J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 1994, 11 (03) : 205 - 233
  • [9] Determining K-most Demanding Products using Data Mining Technique
    Bang, Sonal
    Kalavadekar, P. N.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2014, 14 (06): : 18 - 23
  • [10] EFFICIENT ALGORITHMS FOR EXTRACTING THE K-MOST CRITICAL PATHS IN TIMING ANALYSIS
    YEN, SHC
    DU, DHC
    GHANTA, S
    [J]. 26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, 1989, : 649 - 654