PNP: Fast Path Ensemble Method for Movie Design

How can we design a product or movie that will attract, for example, the interest of Pennsylvania adolescents or liberal newspaper critics? What should be the genre of that movie and who should be in the cast? In this work, we seek to identify how we can design new movies with features tailored to a specific user population. We formulate the movie design as an optimization problem over the inference of user-feature scores and selection of the features that maximize the number of attracted users. Our approach, PNP, is based on a heterogeneous, tripartite graph of users, movies, and features (e.g. actors, directors, genres), where users rate movies and features contribute to movies. We learn the preferences by leveraging user similarities defined through different types of relations, and show that our method outperforms state-of-the-art approaches, including matrix factorization and other heterogeneous graph-based analysis. We evaluate PNP on publicly available real-world data and show that it is highly scalable and effectively provides movie designs oriented towards different groups of users, including men, women, and adolescents.

[1]  David Heckerman,et al.  Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.

[2]  John Riedl,et al.  PolyLens: A recommender system for groups of user , 2001, ECSCW.

[3]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[4]  Raymond J. Mooney,et al.  Content-boosted collaborative filtering for improved recommendations , 2002, AAAI/IAAI.

[5]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[6]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[7]  Greg Linden,et al.  Amazon . com Recommendations Item-to-Item Collaborative Filtering , 2001 .

[8]  Maxim Sviridenko,et al.  Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..

[9]  Vagelis Hristidis,et al.  ObjectRank: Authority-Based Keyword Search in Databases , 2004, VLDB.

[10]  Wei-Ying Ma,et al.  Object-level ranking: bringing order to Web objects , 2005, WWW '05.

[11]  James Bennett,et al.  The Netflix Prize , 2007 .

[12]  Barry Smyth,et al.  Recommendation to Groups , 2007, The Adaptive Web.

[13]  Yifan Hu,et al.  Collaborative Filtering for Implicit Feedback Datasets , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[14]  Juan-Zi Li,et al.  Recommendation over a Heterogeneous Social Network , 2008, 2008 The Ninth International Conference on Web-Age Information Management.

[15]  Michael R. Lyu,et al.  SoRec: social recommendation using probabilistic matrix factorization , 2008, CIKM '08.

[16]  Ilya Mironov,et al.  Differentially private recommender systems: building privacy into the net , 2009, KDD.

[17]  Theodoros Lappas,et al.  Finding a team of experts in social networks , 2009, KDD.

[18]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[19]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[20]  Chris H. Q. Ding,et al.  Collaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs , 2010, SDM.

[21]  Danai Koutra,et al.  Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms , 2011, ECML/PKDD.

[22]  Philip S. Yu,et al.  PathSim , 2011, Proc. VLDB Endow..

[23]  Li Chen,et al.  Factorization vs. regularization: fusing heterogeneous social relationships in top-n recommendation , 2011, RecSys '11.

[24]  Luca Becchetti,et al.  Online team formation in social networks , 2012, WWW.

[25]  Yaron Singer,et al.  How to win friends and influence people, truthfully: influence maximization mechanisms for social networks , 2012, WSDM '12.

[26]  Royi Ronen,et al.  Selecting content-based features for collaborative filtering recommenders , 2013, RecSys.

[27]  Stratis Ioannidis,et al.  Privacy-preserving matrix factorization , 2013, CCS.

[28]  Huan Liu,et al.  Social Media Mining: Data Mining Essentials , 2014 .

[29]  Stratis Ioannidis,et al.  Recommending with an agenda: active learning of private attributes using matrix factorization , 2013, RecSys '14.

[30]  Yizhou Sun,et al.  Personalized entity recommendation: a heterogeneous information network approach , 2014, WSDM.

[31]  Stephen P. Boyd,et al.  Maximizing a Sum of Sigmoids , 2014 .

[32]  Danai Koutra,et al.  Influence Propagation: Patterns, Model and a Case Study , 2014, PAKDD.

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

[34]  Hanghang Tong,et al.  Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation , 2014, WWW.

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

[36]  Franca Garzotto,et al.  Content-Based Video Recommendation System Based on Stylistic Visual Features , 2016, Journal on Data Semantics.

[37]  Christophe Diot,et al.  Cache content-selection policies for streaming video services , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[38]  Danai Koutra,et al.  DeltaCon: Principled Massive-Graph Similarity Function with Attribution , 2016, ACM Trans. Knowl. Discov. Data.