{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:08:47Z","timestamp":1767035327726,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,21]],"date-time":"2011-08-21T00:00:00Z","timestamp":1313884800000},"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":[[2011,8,21]]},"DOI":"10.1145\/2020408.2020440","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"168-176","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Selecting a comprehensive set of reviews"],"prefix":"10.1145","author":[{"given":"Panayiotis","family":"Tsaparas","sequence":"first","affiliation":[{"name":"Microsoft, Mountain View, CA, USA"}]},{"given":"Alexandros","family":"Ntoulas","sequence":"additional","affiliation":[{"name":"Zynga, San Francisco, CA, USA"}]},{"given":"Evimaria","family":"Terzi","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,8,21]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1498759.1498766"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1536414.1536505"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1806689.1806719"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/978-3-540-72792-7_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/290941.291025"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1088622.1088626"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-3-540-27821-4_7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1148170.1148245"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1526709.1526729"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1282100.1282158"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_3_2_1_12_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum D.","year":"1997","unstructured":"D. Hochbaum , editor. Approximation algorithms for NP-hard problems . PWS Publishing Company , 1997 . D. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1014052.1014073"},{"key":"e_1_3_2_1_14_1","first-page":"755","volume-title":"AAAI","author":"Hu M.","year":"2004","unstructured":"M. Hu and B. Liu . Mining opinion features in customer reviews . In AAAI , pages 755 -- 760 , 2004 . M. Hu and B. Liu. Mining opinion features in customer reviews. In AAAI, pages 755--760, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/1610075.1610135"},{"key":"e_1_3_2_1_16_1","first-page":"195","volume-title":"ECML\/PKDD (2)","author":"Lappas T.","year":"2010","unstructured":"T. Lappas and D. Gunopulos . Efficient confident search in large review corpora . In ECML\/PKDD (2) , pages 195 -- 210 , 2010 . T. Lappas and D. Gunopulos. Efficient confident search in large review corpora. In ECML\/PKDD (2), pages 195--210, 2010."},{"key":"e_1_3_2_1_17_1","first-page":"334","volume-title":"EMNLP-CoNLL","author":"Liu J.","year":"2007","unstructured":"J. Liu , Y. Cao , C.-Y. Lin , Y. Huang , and M. Zhou . Low-quality product review detection in opinion summarization . In EMNLP-CoNLL , pages 334 -- 342 , 2007 . Poster paper. J. Liu, Y. Cao, C.-Y. Lin, Y. Huang, and M. Zhou. Low-quality product review detection in opinion summarization. In EMNLP-CoNLL, pages 334--342, 2007. Poster paper."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1137\/1.9781611972795.47"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/ICDM.2008.94"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1772690.1772761"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1367497.1367514"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1526709.1526728"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.3115\/1225733.1225750"},{"key":"e_1_3_2_1_24_1","volume-title":"LREC 2004","author":"Radev D.","year":"2004","unstructured":"D. Radev , T. Allison , S. Blair-Goldensohn , J. Blitzer , A. \u00c7elebi , S. Dimitrov , E. Drabek , A. Hakim , W. Lam , D. Liu , J. Otterbacher , H. Qi , H. Saggion , S. Teufel , M. Topper , A. Winkel , and Z. Zhang . MEAD - a platform for multidocument multilingual text summarization . In LREC 2004 , Lisbon, Portugal , May 2004 . D. Radev, T. Allison, S. Blair-Goldensohn, J. Blitzer, A. \u00c7elebi, S. Dimitrov, E. Drabek, A. Hakim, W. Lam, D. Liu, J. Otterbacher, H. Qi, H. Saggion, S. Teufel, M. Topper, A. Winkel, and Z. Zhang. MEAD - a platform for multidocument multilingual text summarization. In LREC 2004, Lisbon, Portugal, May 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1670564.1670572"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1390156.1390255"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/1772690.1772770"},{"key":"e_1_3_2_1_28_1","volume-title":"ICML","author":"Slivkins A.","year":"2010","unstructured":"A. Slivkins , F. Radlinski , and S. Gollapudi . Learning optimally diverse rankings over large document collections . In ICML , 2010 . A. Slivkins, F. Radlinski, and S. Gollapudi. Learning optimally diverse rankings over large document collections. In ICML, 2010."},{"key":"e_1_3_2_1_29_1","volume-title":"ICWSM","author":"Tsur O.","year":"2009","unstructured":"O. Tsur and A. Rappoport . Revrank: a fully unsupervised algorithm for selecting the most helpful book reviews . In ICWSM , 2009 . O. Tsur and A. Rappoport. Revrank: a fully unsupervised algorithm for selecting the most helpful book reviews. In ICWSM, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1109\/ICDE.2008.4497431"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/1835804.1835903"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/1183614.1183626"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '11","name":"KDD '11: The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Diego California USA"},"container-title":["Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020440","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2020408.2020440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:15Z","timestamp":1750240095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,21]]},"references-count":32,"alternative-id":["10.1145\/2020408.2020440","10.1145\/2020408"],"URL":"https:\/\/doi.org\/10.1145\/2020408.2020440","relation":{},"subject":[],"published":{"date-parts":[[2011,8,21]]},"assertion":[{"value":"2011-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}