{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:40:01Z","timestamp":1749944401737,"version":"3.41.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10618-017-0491-4","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T13:08:22Z","timestamp":1486040902000},"page":"1189-1217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Micro-review synthesis for multi-entity summarization"],"prefix":"10.1007","volume":"31","author":[{"given":"Thanh-Son","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hady W.","family":"Lauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panayiotis","family":"Tsaparas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"key":"491_CR1","doi-asserted-by":"crossref","unstructured":"Abello J, Resende MG, Sudarsky S (2002) Massive quasi-clique detection. In: Latin American symposium on theoretical informatics, pp 598\u2013612. Springer","DOI":"10.1007\/3-540-45995-2_51"},{"issue":"1","key":"491_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"E Akkoyunlu","year":"1973","unstructured":"Akkoyunlu E (1973) The enumeration of maximal cliques of large graphs. SIAM J Comput 2(1):1\u20136","journal-title":"SIAM J Comput"},{"issue":"Jan","key":"491_CR3","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei DM, Ng AY, Jordan MI (2003) Latent dirichlet allocation. J Mach Learn Res 3(Jan):993\u20131022","journal-title":"J Mach Learn Res"},{"key":"491_CR4","doi-asserted-by":"crossref","unstructured":"Bogdanov P, Baumer B, Basu P, Bar-Noy A, Singh AK (2013) As strong as the weakest link: mining diverse cliques in weighted graphs. In: Joint European conference on machine learning and knowledge discovery in databases, pp 525\u2013540. Springer","DOI":"10.1007\/978-3-642-40988-2_34"},{"key":"491_CR5","doi-asserted-by":"crossref","unstructured":"Brunato M, Hoos HH, Battiti R (2007) On effectively finding maximal quasi-cliques in graphs. In: International conference on learning and intelligent optimization, pp 41\u201355. Springer","DOI":"10.1007\/978-3-540-92695-5_4"},{"key":"491_CR6","doi-asserted-by":"crossref","unstructured":"Chong W-H, Dai BT, Lim E-P (2015) Did you expect your users to say this? Distilling unexpected micro-reviews for venue owners. In: Proceedings of the 26th ACM conference on hypertext and social media, pp 13\u201322. ACM","DOI":"10.1145\/2700171.2791024"},{"issue":"1","key":"491_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ipl.2008.03.017","volume":"108","author":"R Cohen","year":"2008","unstructured":"Cohen R, Katzir L (2008) The generalized maximum coverage problem. Inf Process Lett 108(1):15\u201322","journal-title":"Inf Process Lett"},{"key":"491_CR8","unstructured":"Cornu\u00e9jols G, Nemhauser GL, Wolsey LA (1983) The uncapacitated facility location problem. Technical report, Defense Technical Information Center (DTIC) Document"},{"issue":"2","key":"491_CR9","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1006\/jagm.2001.1199","volume":"41","author":"M Dawande","year":"2001","unstructured":"Dawande M, Keskinocak P, Swaminathan JM, Tayur S (2001) On bipartite and multipartite clique problems. J Algorithms 41(2):388\u2013403","journal-title":"J Algorithms"},{"key":"491_CR10","doi-asserted-by":"crossref","unstructured":"Ference G, Ye M, Lee W-C (2013) Location recommendation for out-of-town users in location-based social networks. In: Proceedings of the 22nd ACM international conference on information and knowledge management, pp 721\u2013726. ACM","DOI":"10.1145\/2505515.2505637"},{"key":"491_CR11","unstructured":"Filippova K (2010) Multi-sentence compression: finding shortest paths in word graphs. In: Proceedings of the 23rd international conference on computational linguistics, pp 322\u2013330. Association for Computational Linguistics"},{"key":"491_CR12","unstructured":"Ganesan K, Zhai C, Han J (2010) Opinosis: a graph-based approach to abstractive summarization of highly redundant opinions. In: Proceedings of the 23rd international conference on computational linguistics, pp 340\u2013348. Association for Computational Linguistics"},{"issue":"1","key":"491_CR13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum DS (1982) Heuristics for the fixed cost median problem. Math Program 22(1):148\u2013162","journal-title":"Math Program"},{"issue":"4","key":"491_CR14","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1460797.1460799","volume":"2","author":"D Jiang","year":"2009","unstructured":"Jiang D, Pei J (2009) Mining frequent cross-graph quasi-cliques. ACM Trans Knowl Discov Data 2(4):16","journal-title":"ACM Trans Knowl Discov Data"},{"key":"491_CR15","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Springer US, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"491_CR16","doi-asserted-by":"crossref","unstructured":"Kim HD, Zhai C (2009) Generating comparative summaries of contradictory opinions in text. In: Proceedings of the 18th ACM conference on information and knowledge management, pp 385\u2013394. ACM","DOI":"10.1145\/1645953.1646004"},{"issue":"4598","key":"491_CR17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP et al (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"491_CR18","doi-asserted-by":"crossref","unstructured":"Lappas T, Crovella M, Terzi E (2012) Selecting a characteristic set of reviews. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp 832\u2013840. ACM","DOI":"10.1145\/2339530.2339663"},{"key":"491_CR19","doi-asserted-by":"crossref","unstructured":"Lappas T, Gunopulos D (2010) Efficient confident search in large review corpora. In: Joint European conference on machine learning and knowledge discovery in databases, pp 195\u2013210. Springer","DOI":"10.1007\/978-3-642-15883-4_13"},{"key":"491_CR20","doi-asserted-by":"crossref","unstructured":"Lindqvist J, Cranshaw J, Wiese J, Hong J, Zimmerman J (2011) I\u2019m the mayor of my house: examining why people use foursquare\u2014a social-driven location sharing application. In: Proceedings of the SIGCHI conference on human factors in computing systems, pp 2409\u20132418. ACM","DOI":"10.1145\/1978942.1979295"},{"key":"491_CR21","doi-asserted-by":"crossref","unstructured":"Liu G, Wong L (2008) Effective pruning techniques for mining quasi-cliques. In: Joint European conference on machine learning and knowledge discovery in databases, pp 33\u201349. Springer","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"491_CR22","doi-asserted-by":"crossref","unstructured":"Lu Y, Tsaparas P, Ntoulas A, Polanyi L (2010) Exploiting social context for review quality prediction. In: Proceedings of the 19th international conference on world wide web, pp 691\u2013700. ACM","DOI":"10.1145\/1772690.1772761"},{"key":"491_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning CD, Raghavan P, Sch\u00fctze H et al (2008) Introduction to information retrieval, vol 1. Cambridge University Press, Cambridge"},{"key":"491_CR24","doi-asserted-by":"crossref","unstructured":"Mihalcea R, Tarau P (2004) Textrank: bringing order into texts. In: Proceedings of the conference on empirical methods in natural language processing, pp 404\u2013411. Association for Computational Linguistics","DOI":"10.3115\/1220575.1220627"},{"issue":"4","key":"491_CR25","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/TKDE.2014.2356456","volume":"27","author":"T-S Nguyen","year":"2015","unstructured":"Nguyen T-S, Lauw HW, Tsaparas P (2015) Review selection using micro\u2014reviews. IEEE Trans Knowl Data Eng 27(4):1098\u20131111","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"491_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen T-S, Lauw HW, Tsaparas P (2015) Review synthesis for micro-review summarization. In: Proceedings of the eighth ACM international conference on web search and data mining, pp 169\u2013178. ACM","DOI":"10.1145\/2684822.2685321"},{"key":"491_CR27","first-page":"70","volume":"11","author":"A Noulas","year":"2011","unstructured":"Noulas A, Scellato S, Mascolo C, Pontil M (2011) An empirical study of geographic user activity patterns in Foursquare. Int Conf Weblogs Soc Media 11:70\u2013573","journal-title":"Int Conf Weblogs Soc Media"},{"issue":"1","key":"491_CR28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10479-012-1242-y","volume":"216","author":"FM Pajouh","year":"2014","unstructured":"Pajouh FM, Miao Z, Balasundaram B (2014) A branch-and-bound approach for maximum quasi-cliques. Ann Oper Res 216(1):145\u2013161","journal-title":"Ann Oper Res"},{"issue":"1","key":"491_CR29","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo J, Veremyev A, Butenko S, Boginski V (2013) On the maximum quasi-clique problem. Discrete Appl Math 161(1):244\u2013257","journal-title":"Discrete Appl Math"},{"key":"491_CR30","unstructured":"Paul MJ, Zhai C, Girju R (2010) Summarizing contrastive viewpoints in opinionated text. In: Proceedings of the 2010 conference on empirical methods in natural language processing, pp 66\u201376. Association for Computational Linguistics"},{"key":"491_CR31","doi-asserted-by":"crossref","unstructured":"Pontes T, Vasconcelos M, Almeida J, Kumaraguru P, Almeida V (2012) We know where you live: privacy characterization of foursquare behavior. In: Proceedings of the 2012 ACM conference on ubiquitous computing, pp 898\u2013905. ACM","DOI":"10.1145\/2370216.2370419"},{"issue":"6","key":"491_CR32","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.ipm.2003.10.006","volume":"40","author":"DR Radev","year":"2004","unstructured":"Radev DR, Jing H, Sty\u015b M, Tam D (2004) Centroid-based summarization of multiple documents. Inf Process Manag 40(6):919\u2013938","journal-title":"Inf Process Manag"},{"key":"491_CR33","doi-asserted-by":"crossref","unstructured":"Shmoys DB, Tardos \u00c9, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, pp 265\u2013274. ACM","DOI":"10.1145\/258533.258600"},{"key":"491_CR34","doi-asserted-by":"crossref","unstructured":"Sipos R, Joachims T (2013) Generating comparative summaries from reviews. In: Proceedings of the 22nd ACM international conference on conference on information and knowledge management, pp 1853\u20131856. ACM","DOI":"10.1145\/2505515.2507879"},{"key":"491_CR35","doi-asserted-by":"crossref","unstructured":"Sun H, Morales A, Yan X (2013) Synthetic review spamming and defense. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1088\u20131096. ACM","DOI":"10.1145\/2487575.2487688"},{"key":"491_CR36","doi-asserted-by":"crossref","unstructured":"Titov I, McDonald R (2008) Modeling online reviews with multi-grain topic models. In: Proceedings of the 17th international conference on World Wide Web, pp 111\u2013120. ACM","DOI":"10.1145\/1367497.1367513"},{"key":"491_CR37","doi-asserted-by":"crossref","unstructured":"Tsaparas P, Ntoulas A, Terzi E (2011) Selecting a comprehensive set of reviews. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp 168\u2013176. ACM","DOI":"10.1145\/2020408.2020440"},{"key":"491_CR38","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, pp 104\u2013112. ACM","DOI":"10.1145\/2487575.2487645"},{"issue":"1","key":"491_CR39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T Uno","year":"2010","unstructured":"Uno T (2010) An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica 56(1):3\u201316","journal-title":"Algorithmica"},{"key":"491_CR40","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.ins.2015.07.001","volume":"325","author":"M Vasconcelos","year":"2015","unstructured":"Vasconcelos M, Almeida JM, Gon\u00e7alves MA (2015) Predicting the popularity of micro-reviews: a foursquare case study. Inf Sci 325:355\u2013374","journal-title":"Inf Sci"},{"key":"491_CR41","first-page":"552","volume":"7","author":"X Wan","year":"2007","unstructured":"Wan X, Yang J, Xiao J (2007) Towards an iterative reinforcement approach for simultaneous document summarization and keyword extraction. Assoc Comput Linguist 7:552\u2013559","journal-title":"Assoc Comput Linguist"},{"key":"491_CR42","doi-asserted-by":"crossref","unstructured":"Wang J, Cheng J, Fu AW-C (2013) Redundancy-aware maximal cliques. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, pp 122\u2013130. ACM","DOI":"10.1145\/2487575.2487689"},{"key":"491_CR43","unstructured":"Yerva SR, Grosan FA, Tandrau AO, Aberer K (2013) Tripeneer: User-based travel plan recommendation application. In: 7th international AAAI conference on weblogs and social media, number EPFL-CONF-185877"},{"issue":"8","key":"491_CR44","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/MCOM.2014.6871670","volume":"52","author":"Z Yu","year":"2014","unstructured":"Yu Z, Feng Y, Xu H, Zhou X (2014) Recommending travel packages based on mobile crowdsourced data. IEEE Commun Mag 52(8):56\u201362","journal-title":"IEEE Commun Mag"},{"key":"491_CR45","doi-asserted-by":"crossref","unstructured":"Zeng Z, Wang J, Zhou L, Karypis G (2006) Coherent closed quasi-clique discovery from large dense graph databases. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 797\u2013802. ACM","DOI":"10.1145\/1150402.1150506"},{"key":"491_CR46","doi-asserted-by":"crossref","unstructured":"Zhai C, Velivelli A, Yu B (2004) A cross-collection mixture model for comparative text mining. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, pp 743\u2013748. ACM","DOI":"10.1145\/1014052.1014150"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-017-0491-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0491-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0491-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:13:45Z","timestamp":1749942825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-017-0491-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":46,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s10618-017-0491-4","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2017,2,2]]}}}