{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:14Z","timestamp":1750306094239,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,13]]},"DOI":"10.1145\/3097983.3098076","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"1527-1536","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["PNP"],"prefix":"10.1145","author":[{"given":"Danai","family":"Koutra","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhilash","family":"Dighe","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Smriti","family":"Bhagat","sequence":"additional","affiliation":[{"name":"Facebook & Technicolor, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Weinsberg","sequence":"additional","affiliation":[{"name":"Facebook & Technicolor, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Bolot","sequence":"additional","affiliation":[{"name":"Technicolor, Los Altos, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187950"},{"key":"e_1_3_2_2_3_1","volume-title":"Part 4: The only thing that matters","author":"Andreessen Marc","year":"2007","unstructured":"Marc Andreessen . Part 4: The only thing that matters , 2007 . Marc Andreessen. Part 4: The only thing that matters, 2007."},{"key":"e_1_3_2_2_4_1","volume-title":"VLDB","author":"Balmin Andrey","year":"2004","unstructured":"Andrey Balmin , Vagelis Hristidis , and Yannis Papakonstantinou . Objectrank : Authority-based keyword search in databases . In VLDB , 2004 . Andrey Balmin, Vagelis Hristidis, and Yannis Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, 2004."},{"key":"e_1_3_2_2_5_1","volume-title":"KDD Cup","author":"Bennett James","year":"2007","unstructured":"James Bennett and Stan Lanning . The Netflix prize . In KDD Cup , 2007 . James Bennett and Stan Lanning. The Netflix prize. In KDD Cup, 2007."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645747"},{"key":"e_1_3_2_2_7_1","volume-title":"UAI","author":"Breese John S.","year":"1998","unstructured":"John S. Breese , David Heckerman , and Carl Myers Kadie . Empirical Analysis of Predictive Algorithms for Collaborative Filtering . In UAI , 1998 . John S. Breese, David Heckerman, and Carl Myers Kadie. Empirical Analysis of Predictive Algorithms for Collaborative Filtering. In UAI, 1998."},{"key":"e_1_3_2_2_8_1","volume-title":"New York Times","author":"Carr David","year":"2013","unstructured":"David Carr . Giving viewers what they want . New York Times , 2013 . David Carr. Giving viewers what they want. New York Times, 2013."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13740-016-0060-9"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524619"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.18"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72079-9_20"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_2_18_1","volume-title":"Hsing-Kuo Kenneth Pao, and Christos Faloutsos","author":"Koutra Danai","year":"2011","unstructured":"Danai Koutra , Tai-You Ke , U Kang , Duen Horng Chau , Hsing-Kuo Kenneth Pao, and Christos Faloutsos . Unifying Guilt-by-Association Approaches : Theorems and Fast Algorithms. In ECML PKDD, 2011 . Danai Koutra, Tai-You Ke, U Kang, Duen Horng Chau, Hsing-Kuo Kenneth Pao, and Christos Faloutsos. Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms. In ECML PKDD, 2011."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2824443"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_2_21_1","volume-title":"MIT Technology Review","author":"Leber Jessica","year":"2013","unstructured":"Jessica Leber . \" House of Cards\" and our future of algorithmic programming . MIT Technology Review , 2013 . Jessica Leber. \"House of Cards\" and our future of algorithmic programming. MIT Technology Review, 2013."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741132"},{"key":"e_1_3_2_2_23_1","volume-title":"PAKDD","author":"Lin Yibin","year":"2014","unstructured":"Yibin Lin , Agha Ali Raza , Jay Yoon Lee , Danai Koutra , Roni Rosenfeld , and Christos Faloutsos . Influence Propagation : Patterns, Model and a Case Study . In PAKDD , 2014 . Yibin Lin, Agha Ali Raza, Jay Yoon Lee, Danai Koutra, Roni Rosenfeld, and Christos Faloutsos. Influence Propagation: Patterns, Model and a Case Study. In PAKDD, 2014."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458205"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_2_27_1","volume-title":"AAAI","author":"Melville Prem","year":"2002","unstructured":"Prem Melville , Raymod J. Mooney , and Ramadass Nagarajan . Content-boosted Collaborative Filtering for Improved Recommendations . In AAAI , 2002 . Prem Melville, Raymod J. Mooney, and Ramadass Nagarajan. Content-boosted Collaborative Filtering for Improved Recommendations. In AAAI, 2002."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060828"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516751"},{"key":"e_1_3_2_2_30_1","volume-title":"ECSCW","author":"O'Connor Mark","year":"2001","unstructured":"Mark O'Connor , Dan Cosley , Joseph A. Konstan , and John Riedl . Polylens : A recommender system for groups of users . ECSCW , 2001 . Mark O'Connor, Dan Cosley, Joseph A. Konstan, and John Riedl. Polylens: A recommender system for groups of users. ECSCW, 2001."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507203"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124381"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_3_2_2_35_1","volume-title":"http:\/\/www.mgo.com\/","author":"MGO.","year":"2014","unstructured":"Technicolor. MGO. http:\/\/www.mgo.com\/ , 2014 . Technicolor. MGO. http:\/\/www.mgo.com\/, 2014."},{"key":"e_1_3_2_2_36_1","volume-title":"Maximizing a sum of sigmoids","author":"Udell Madeleine","year":"2013","unstructured":"Madeleine Udell and Stephen Boyd . Maximizing a sum of sigmoids , 2013 . Madeleine Udell and Stephen Boyd. Maximizing a sum of sigmoids, 2013."},{"key":"e_1_3_2_2_37_1","volume-title":"Approximation algorithms","author":"Vazirani Vijay V","year":"2013","unstructured":"Vijay V Vazirani . Approximation algorithms . Springer Science & Business Media , 2013 . Vijay V Vazirani. Approximation algorithms. Springer Science & Business Media, 2013."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556259"},{"key":"e_1_3_2_2_39_1","volume-title":"Regularization: Fusing Heterogeneous Social Relationships in Top-n Recommendation. In RecSys","author":"Yuan Quan","year":"2011","unstructured":"Quan Yuan , Li Chen , and Shiwan Zhao . Factorization vs . Regularization: Fusing Heterogeneous Social Relationships in Top-n Recommendation. In RecSys , 2011 . Quan Yuan, Li Chen, and Shiwan Zhao. Factorization vs. Regularization: Fusing Heterogeneous Social Relationships in Top-n Recommendation. In RecSys, 2011."},{"key":"e_1_3_2_2_40_1","volume-title":"Social computing data repository at ASU","author":"Zafarani Reza","year":"2009","unstructured":"Reza Zafarani and Huan Liu . Social computing data repository at ASU , 2009 . Reza Zafarani and Huan Liu. Social computing data repository at ASU, 2009."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/WAIM.2008.71"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Halifax NS Canada","acronym":"KDD '17"},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:26Z","timestamp":1750217426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098076"}},"subtitle":["Fast Path Ensemble Method for Movie Design"],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"references-count":41,"alternative-id":["10.1145\/3097983.3098076","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098076","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]},"assertion":[{"value":"2017-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}