{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T19:08:06Z","timestamp":1762542486419},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_46","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T10:47:27Z","timestamp":1452163647000},"page":"569-579","source":"Crossref","is-referenced-by-count":4,"title":["Summarizing Online User Reviews Using Bicliques"],"prefix":"10.1007","author":[{"given":"Azam Sheikh","family":"Muhammad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Damaschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olof","family":"Mogren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discr. Appl. Math. 145, 11\u201321 (2004)","journal-title":"Discr. Appl. Math."},{"key":"46_CR2","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: Dayal, U. et al. (eds.) VLDB 2006, pp. 918\u2013929, ACM (2006)"},{"key":"46_CR3","unstructured":"Bogren, E., Toft, J.: Finding top-\n                      \n                        \n                      \n                      $$k$$\n                     similar document pairs - speeding up a multi-document summarization approach. Master\u2019s thesis, Department of Computer Science and Engineering, Chalmers, G\u00f6teborg (2014)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Bonzanini, M., Martinez-Alvarez, M., Roelleke, T.: Extractive summarisation via sentence removal: condensing relevant sentences into a short summary. In: Jones, G.J.F. et al. (eds.) SIGIR 2013, pp. 893\u2013896, ACM (2013)","DOI":"10.1145\/2484028.2484149"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2015.02.034","volume":"580","author":"P Damaschke","year":"2015","unstructured":"Damaschke, P.: Finding and enumerating large intersections. Theor. Comp. Sci. 580, 75\u201382 (2015)","journal-title":"Theor. Comp. Sci."},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1016\/j.dam.2007.03.017","volume":"155","author":"VMF Dias","year":"2007","unstructured":"Dias, V.M.F., de Figueiredo, C.M.H., Szwarcfiter, J.L.: On the generation of bicliques of a graph. Discr. Appl. Math. 155, 1826\u20131832 (2007)","journal-title":"Discr. Appl. Math."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Elsayed, T., Lin, J., Oard, D.W.: Pairwise document similarity in large collections with MapReduce. In: ACL 2008: HLT, Short Papers (Companion Volume), pp. 265\u2013268, Association for Computational Linguistics (2008)","DOI":"10.3115\/1557690.1557767"},{"key":"46_CR8","unstructured":"Ganesan, K., Zhai, C., Han, J.: Opinosis: a graph based approach to abstractive summarization of highly redundant opinions. In: Huang, C.R., Jurafsky, D. (eds.) COLING 2010, pp. 340\u2013348, Tsinghua University Press (2010)"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1016\/j.dam.2008.10.010","volume":"157","author":"A Gely","year":"2009","unstructured":"Gely, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discr. Appl. Math. 157, 1447\u20131459 (2009)","journal-title":"Discr. Appl. Math."},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1109\/18.165464","volume":"38","author":"W Li","year":"1992","unstructured":"Li, W.: Random texts exhibit Zipf\u2019s-law-like word frequency distribution. IEEE Trans. Inf. Theor. 38, 1842\u20131845 (1992)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/TKDE.2007.190660","volume":"19","author":"J Li","year":"2007","unstructured":"Li, J., Liu, G., Li, H., Wong, L.: Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng. 19, 1625\u20131637 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"46_CR12","unstructured":"Lin, C.Y.: ROUGE: a package for automatic evaluation of summaries. In: Moens, M.F., Szpakowicz (eds.) ACL Workshop \u201cText Summarization Branches Out\u201d, pp. 74\u201381 (2004)"},{"key":"46_CR13","unstructured":"Lin, H., Bilmes, J.A.: A class of submodular functions for document summarization. In: Lin, D., Matsumoto, Y., Mihalcea, R. (eds.) ACL 2011, pp. 510\u2013520, Association for Computational Linguistics (2011)"},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1147\/rd.22.0159","volume":"2","author":"HP Luhn","year":"1958","unstructured":"Luhn, H.P.: The automatic creation of literature abstracts. IBM J. 2, 159\u2013165 (1958)","journal-title":"IBM J."},{"key":"46_CR15","volume-title":"Foundations of Statistical Natural Language Processing","author":"CD Manning","year":"1999","unstructured":"Manning, C.D., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-1-4614-3223-4_3","volume-title":"Mining Text Data","author":"A Nenkova","year":"2012","unstructured":"Nenkova, A., McKeown, K.: A survey of text summarization techniques. In: Aggarwal, C.C., Zhai, C. (eds.) Mining Text Data, pp. 43\u201376. Springer, Berlin (2012)"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"MF Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program 14, 130\u2013137 (1980)","journal-title":"Program"},{"key":"46_CR18","unstructured":"Radev, D.R., Allison, T., Blair-Goldensohn, S., Blitzer, J., Celebi, A., Dimitrov, S., Dr\u00e1bek, E., Hakim, A., Lam, W., Liu, D., Otterbacher, J., Qi, H., Saggion, H., Teufel, S., Topper, M., Winkel, A., Zhang, Z.: MEAD - a platform for multidocument multilingual text summarization. In: LREC(2004)"},{"key":"46_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.eswa.2012.05.070","volume":"40","author":"D Wang","year":"2013","unstructured":"Wang, D., Zhu, S., Li, T.: SumView: a web-based engine for summarizing product reviews and customer opinions. Expert Syst. Appl. 40, 27\u201333 (2013)","journal-title":"Expert Syst. Appl."},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X. Haichuan Shang, H.: Top-\n                      \n                        \n                      \n                      $$k$$\n                     set similarity joins. In: Ioannidis, Y.E., Lee, D.L., Ng, R.T. (eds.) ICDE 2009, pp. 916\u2013927, IEEE (2009)","DOI":"10.1109\/ICDE.2009.111"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:09:34Z","timestamp":1559365774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}