{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:49:11Z","timestamp":1761598151733,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T00:00:00Z","timestamp":1575936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The MOE Project of Key Research Institute of Humanities and Social Sciences at Universities","award":["17JJD630006"],"award-info":[{"award-number":["17JJD630006"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71771131, 71490724, and U1711262"],"award-info":[{"award-number":["71771131, 71490724, and U1711262"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2019,12,31]]},"abstract":"<jats:p>Consumers increasingly make informed buying decisions based on reading online reviews for products and services. Due to the large volume of available online reviews, consumers hardly have the time and patience to read them all. This article aims to select a compact set of high-quality reviews that can cover a specific set of product features and related consumer sentiments. Selecting such a subset of reviews can significantly save the time spent on reading reviews while preserving the information needed. A unique review selection problem is defined and modeled as a bi-objective combinatorial optimization problem, which is then transformed into a minimum-cost set cover problem that is NP-complete. Several approximation algorithms are then designed, which can sustain performance guarantees in polynomial time. Our effective selection algorithms can also be upgraded to handle dynamic situations. Comprehensive experiments conducted on twelve real datasets demonstrate that the proposed algorithms significantly outperform benchmark methods by generating a more compact review set with much lower computational cost. The number of reviews selected is much smaller compared to the quantity of all available reviews, and the selection efficiency is deeply increased by accelerating strategies, making it very practical to adopt the methods in real-world online applications.<\/jats:p>","DOI":"10.1145\/3369395","type":"journal-article","created":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T13:27:18Z","timestamp":1576070838000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Effective Selection of a Compact and High-Quality Review Set with Information Preservation"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6116-7232","authenticated-orcid":false,"given":"Jiawei","family":"Chen","sequence":"first","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"given":"Hongyan","family":"Liu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Yinghui (Catherine)","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California, Davis, CA"}]},{"given":"Jun","family":"He","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"volume-title":"Aggarwal and ChengXiang Zhai","year":"2012","author":"Charu","key":"e_1_2_2_1_1"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914855"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.02.006"},{"volume-title":"Design and Analysis of Approximation Algorithms","author":"Du Dingzhu","key":"e_1_2_2_4_1"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121732"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002910000046"},{"key":"e_1_2_2_7_1","unstructured":"eMarketer. 2016. Consumers like reading online reviews not writing them. https:\/\/www.emarketer.com\/Article\/Consumers-Like-Reading-Online-Reviews-Not-Writing-Them\/1014242.  eMarketer. 2016. Consumers like reading online reviews not writing them. https:\/\/www.emarketer.com\/Article\/Consumers-Like-Reading-Online-Reviews-Not-Writing-Them\/1014242."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-016-9475-9"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.188"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.25300\/MISQ\/2017\/41.4.05"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2017.06.007"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804034"},{"volume-title":"Complexity of Computer Computations","author":"Karp Richard M.","key":"e_1_2_2_13_1"},{"key":"e_1_2_2_14_1","first-page":"1","article-title":"Developing a framework for assessing information quality on the World Wide Web","volume":"8","author":"Knight Shirlee-Ann","year":"2005","journal-title":"Informing Science"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339663"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929865"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.94"},{"volume-title":"Retrieved","year":"2018","author":"Loria Steven","key":"e_1_2_2_18_1"},{"volume-title":"Content and structure coverage: Extracting a diverse information subset. INFORMS J.ournal on Computing 29, 4","year":"2017","author":"Ma Baojun","key":"e_1_2_2_19_1"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2356456"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0491-4"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109901"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2485209"},{"key":"e_1_2_2_25_1","volume-title":"Proceedings of the 27th International Conference on Very Large Data Bases (VLDB\u201901)","volume":"1","author":"Tan Kian Lee","year":"2001"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020440"},{"volume-title":"Approximation Algorithms","author":"Vazirani Vijay V.","key":"e_1_2_2_27_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04565-7"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.56"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37401-2_70"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3214720.3214724"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369395","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3369395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:30Z","timestamp":1750202610000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,10]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12,31]]}},"alternative-id":["10.1145\/3369395"],"URL":"https:\/\/doi.org\/10.1145\/3369395","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"type":"print","value":"2158-656X"},{"type":"electronic","value":"2158-6578"}],"subject":[],"published":{"date-parts":[[2019,12,10]]},"assertion":[{"value":"2018-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}