Identifying Hesitant and Interested Customers for Targeted Social Marketing

Social networks provide unparalleled opportunities for marketing products or services. Along this line, tremendous efforts have been devoted to the research of targeted social marketing, where the marketing efforts could be concentrated on a particular set of users with high utilities. Traditionally, these targeted users are identified based on their potential interests to the given company (product). However, social users are usually influenced simultaneously by multiple companies, and not only the user interest but also these social influences will contribute to the user consumption behaviors. To that end, in this paper, we propose a general approach to figure out the targeted users for social marketing, taking both user interests and multiple social influences into consideration. Specifically, we first formulate it as an Identifying Hesitant and Interested Customers (IHIC) problem, where we argue that these valuable users should have the best balanced influence entropy (being “Hesitant”) and utility scores (being “Interested”). Then, we design a novel framework and propose specific algorithms to solve this problem. Finally, extensive experiments on two real-world datasets validate the effectiveness and the efficiency of our proposed approach.

[1]  Philip S. Yu,et al.  Empirical Evaluation of Profile Characteristics for Gender Classification on Twitter , 2013, 2013 12th International Conference on Machine Learning and Applications.

[2]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[3]  George Karypis,et al.  Item-based top-N recommendation algorithms , 2004, TOIS.

[4]  Bracha Shapira,et al.  Recommender Systems Handbook , 2015, Springer US.

[5]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[6]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[7]  Vahab S. Mirrokni,et al.  Optimal marketing strategies over social networks , 2008, WWW.

[8]  Michael J. Pazzani,et al.  Content-Based Recommendation Systems , 2007, The Adaptive Web.

[9]  Martin Ester,et al.  TrustWalker: a random walk model for combining trust-based and item-based recommendation , 2009, KDD.

[10]  Charu C. Aggarwal,et al.  On Flow Authority Discovery in Social Networks , 2011, SDM.

[11]  Taghi M. Khoshgoftaar,et al.  A Survey of Collaborative Filtering Techniques , 2009, Adv. Artif. Intell..

[12]  Younes Benslimane,et al.  Conducting Efficient and Cost-Effective Targeted Marketing Using Data Mining Techniques , 2013, 2013 Fourth Global Congress on Intelligent Systems.

[13]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

[14]  Enhong Chen,et al.  Diversified social influence maximization , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[15]  Aristides Gionis,et al.  STRIP: stream learning of influence probabilities , 2013, KDD.

[16]  Huan Liu,et al.  Social recommendation: a review , 2013, Social Network Analysis and Mining.

[17]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[18]  Hui Xiong,et al.  PageRank with Priors: An Influence Propagation Perspective , 2013, IJCAI.

[19]  Mark S. Granovetter Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[20]  Laks V. S. Lakshmanan,et al.  Information and Influence Propagation in Social Networks , 2013, Synthesis Lectures on Data Management.

[21]  Hosung Park,et al.  What is Twitter, a social network or a news media? , 2010, WWW '10.

[22]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..