A Novel Social Event Organization Approach for Diverse User Choices
暂无分享,去创建一个
Yu Zhou | Jianbin Huang | Heli Sun | Xiaolin Jia | Jianbin Huang | Heli Sun | Xiaolin Jia | Yu Zhou
[1] Ernesto Damiani,et al. Guest editorial: large-scale Web virtualized environment , 2015, World Wide Web.
[2] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .
[3] Geneva G. Belford,et al. Multi-aspect expertise matching for review assignment , 2008, CIKM '08.
[4] M. Markus,et al. Fluctuation theorem for a deterministic one-particle system. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[5] Nikos Mamoulis,et al. Weighted Coverage based Reviewer Assignment , 2015, SIGMOD Conference.
[6] Theodoros Lappas,et al. Profit-maximizing cluster hires , 2014, KDD.
[7] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[8] Rajeev Rastogi,et al. Recommendations to boost content spread in social networks , 2012, WWW.
[9] Theodoros Lappas,et al. Finding a team of experts in social networks , 2009, KDD.
[10] Samik Datta,et al. Capacitated team formation problem on social networks , 2012, KDD.
[11] Chih-Ya Shen,et al. Maximizing Friend-Making Likelihood for Social Activity Organization , 2015, PAKDD.
[12] Sourav S. Bhowmick,et al. In search of influential event organizers in online social networks , 2014, SIGMOD Conference.
[13] Jiawei Han,et al. gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration , 2010, 2010 IEEE International Conference on Data Mining.
[14] L. Bécu,et al. Evidence for three-dimensional unstable flows in shear-banding wormlike micelles. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[15] Aristides Gionis,et al. The community-search problem and how to plan a successful cocktail party , 2010, KDD.
[16] Lei Chen,et al. Utility-Aware Social Event-Participant Planning , 2015, SIGMOD Conference.
[17] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[18] Jon Kleinberg,et al. Authoritative sources in a hyperlinked environment , 1999, SODA '98.
[19] Martin Rosvall,et al. Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.
[20] Jeffrey Xu Yu,et al. Influential Community Search in Large Networks , 2015, Proc. VLDB Endow..
[21] Laks V. S. Lakshmanan,et al. On social event organization , 2014, KDD.
[22] Cheng-Te Li,et al. Composing activity groups in social networks , 2012, CIKM.
[23] Luca Becchetti,et al. Online team formation in social networks , 2012, WWW.
[24] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[25] Laks V. S. Lakshmanan,et al. Approximate Closest Community Search in Networks , 2015, Proc. VLDB Endow..
[26] Lei Chen,et al. Conflict-aware event-participant arrangement , 2015, 2015 IEEE 31st International Conference on Data Engineering.
[27] Dimitris Papadias,et al. Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach , 2015, SIGMOD Conference.
[28] Jakob Nielsen,et al. Automating the assignment of submitted manuscripts to reviewers , 1992, SIGIR '92.
[29] Yizhou Sun,et al. SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks , 2010, CIKM.
[30] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[31] Hanghang Tong,et al. Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation , 2014, WWW.
[32] Philip S. Yu,et al. Willingness Optimization for Social Group Activity , 2013, Proc. VLDB Endow..
[33] Mao Ye,et al. Exploring social influence for recommendation: a generative model approach , 2012, SIGIR '12.
[34] Mao Ye,et al. On bundle configuration for viral marketing in social networks , 2012, CIKM.
[35] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[36] W. Zachary,et al. An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.
[37] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[38] Qinbao Song,et al. Revealing Density-Based Clustering Structure from the Core-Connected Tree of a Network , 2013, IEEE Transactions on Knowledge and Data Engineering.
[39] Réka Albert,et al. Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[40] Konstantin Avrachenkov,et al. Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.
[41] Nicola Barbieri,et al. Efficient and effective community search , 2015, Data Mining and Knowledge Discovery.
[42] Rui Meng,et al. Bottleneck-aware arrangement over event-based social networks: the max-min approach , 2015, World Wide Web.
[43] Luca Becchetti,et al. Power in unity: forming teams in large-scale community systems , 2010, CIKM.
[44] Mark E. J. Newman,et al. Power-Law Distributions in Empirical Data , 2007, SIAM Rev..