Exploring the Choice Under Conflict for Social Event Participation

Recent years have witnessed the booming of event driven SNS, which allow cyber strangers to get connected in physical world. This new business model imposes challenges for event organizers to draw event plan and predict attendance. Intuitively, these services rely on the accurate estimation of users’ preferences. However, due to various motivation of historical participation(i.e. attendance may not definitely indicate interests), traditional recommender techniques may fail to reveal the reliable user profiles. At the same time, motivated by the phenomenon that user may face to conflict of invitation (i.e. multiple invitations received simultaneously, in which only a few could be accepted), we realize that these choices may reflect real preference. Along this line, in this paper, we develop a novel conflict-choice-based model to reconstruct the decision-making process of users when facing to conflict. To be specific, in the perspective of utility in choice model, we formulate users’ tendency with integrating content, social and cost-based factors, thus topical interests as well as latent social interactions could be both captured. Furthermore, we transfer the choice of conflict-choice triples into the pairwise ranking task, and a learning-to-rank based optimization scheme is introduced to solve the problem. Comprehensive experiments on real-world data set show that our framework could outperform the state-of-the-art baselines with significant margin, which validates the hypothesis that conflict and choice could better explain user’s real preference.

[1]  Einat Minkov,et al.  Collaborative future event recommendation , 2010, CIKM.

[2]  Hui Xiong,et al.  Mining Indecisiveness in Customer Behaviors , 2015, 2015 IEEE International Conference on Data Mining.

[3]  Florian Heiss,et al.  Discrete Choice Methods with Simulation , 2016 .

[4]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

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

[6]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[7]  Raphaël Troncy,et al.  Hybrid event recommendation using linked data and user diversity , 2013, RecSys.

[8]  Shuang-Hong Yang,et al.  Collaborative competitive filtering: learning recommender using context of user choice , 2011, SIGIR.

[9]  Yuan Tian,et al.  Exploring personal impact for group recommendation , 2012, CIKM.

[10]  Falk Scholer,et al.  User performance versus precision measures for simple search tasks , 2006, SIGIR.

[11]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[12]  C. D. Kemp,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[13]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[14]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[15]  Yuanyuan Tian,et al.  Event-based social networks: linking the online and offline social worlds , 2012, KDD.

[16]  Hui Xiong,et al.  Exploring the Impact of Dynamic Mutual Influence on Social Event Participation , 2015, SDM.

[17]  Toon De Pessemier,et al.  Social Recommendations for Events , 2013, RSWeb@RecSys.

[18]  Enhong Chen,et al.  Towards Annotating Media Contents through Social Diffusion Analysis , 2012, 2012 IEEE 12th International Conference on Data Mining.

[19]  Gregory N. Hullender,et al.  Learning to rank using gradient descent , 2005, ICML.

[20]  Mao Ye,et al.  From face-to-face gathering to social structure , 2012, CIKM.

[21]  Christopher J. C. Burges,et al.  From RankNet to LambdaRank to LambdaMART: An Overview , 2010 .

[22]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.