{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T14:52:33Z","timestamp":1673621553648},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T00:00:00Z","timestamp":1426291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-015-9855-0","type":"journal-article","created":{"date-parts":[[2015,3,13]],"date-time":"2015-03-13T13:15:16Z","timestamp":1426252516000},"page":"996-1015","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing word set coverage for multi-event summarization"],"prefix":"10.1007","volume":"30","author":[{"given":"Jihong","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenliang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,14]]},"reference":[{"key":"9855_CR1","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1016\/j.ejor.2010.02.008","volume":"205","author":"Rego Ablanedo-Rosas","year":"2010","unstructured":"Ablanedo-Rosas Rego (2010) Surrogate constraint normalization for the set covering problem. Eur J Oper Res 205:540\u2013551","journal-title":"Eur J Oper Res"},{"key":"9855_CR2","doi-asserted-by":"crossref","first-page":"14514","DOI":"10.1016\/j.eswa.2011.05.033","volume":"38","author":"RM Alguliev","year":"2011","unstructured":"Alguliev RM, Aliguliyev RM, Hajirahimova MS, Mehdiyev CA (2011) Mcmr: maximum coverage and minimum redundant text summarization model. Expert Syst Appl 38:14514\u201314522","journal-title":"Expert Syst Appl"},{"key":"9855_CR3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.orl.2008.09.009","volume":"37","author":"P Avella","year":"2009","unstructured":"Avella P, Boccia M, Vasilyev I (2009) Computational experience with general cutting planes for the set covering problem. Oper Res Lett 37:16\u201320","journal-title":"Oper Res Lett"},{"key":"9855_CR4","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"Carrera Balas","year":"1996","unstructured":"Balas Carrera (1996) A dynamic subgradient-based branch-and-bound procedure for set covering. Oper Res 44:875\u2013890","journal-title":"Oper Res"},{"key":"9855_CR5","doi-asserted-by":"crossref","unstructured":"Becker H, Naaman M, Gravano L (2010) Learning similarity metrics for event identification in social media. In: Proceedings of the third ACM international conference on Web search and data mining, ACM, pp 291\u2013300","DOI":"10.1145\/1718487.1718524"},{"key":"9855_CR6","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:993\u20131022","journal-title":"J Mach Learn Res"},{"key":"9855_CR7","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara A, Fischetti M, Toth P (1999) Aheuristic method for the set covering problem. Oper Res 47:730\u2013743","journal-title":"Oper Res"},{"key":"9855_CR8","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/s10878-012-9464-0","volume":"26","author":"I Caragiannis","year":"2013","unstructured":"Caragiannis I, Kaklamanis C, Kyropoulou M (2013) Tight approximation bounds for combinatorial frugal coverage algorithms. J Comb Optim 26:292\u2013309","journal-title":"J Comb Optim"},{"key":"9855_CR9","unstructured":"Chakrabarti D, Punera K (2011) Event summarization using tweets. In: ICWSM"},{"key":"9855_CR10","unstructured":"Chieu HL, Ng HT (2002) A maximum entropy approach to information extraction from semi-structured and free text. In: Proceedings of the eighteenth national conference on artificial intelligence and fourteenth conference on innovative applications of artificial intelligence, Edmonton, Alberta, Canada. pp 786\u2013791, 28 July\u20131 August 2002"},{"key":"9855_CR11","doi-asserted-by":"crossref","unstructured":"Conroy JM, O\u2019leary DP (2001) Text summarization via hidden markov models. In: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, ACM, pp 406\u2013407","DOI":"10.1145\/383952.384042"},{"key":"9855_CR12","first-page":"192","volume":"4","author":"D Das","year":"2007","unstructured":"Das D, Martins AF (2007) A survey on automatic text summarization. Lit Surv Lang Stat Course CMU 4:192\u2013195","journal-title":"Lit Surv Lang Stat Course CMU"},{"key":"9855_CR13","doi-asserted-by":"crossref","first-page":"5787","DOI":"10.1016\/j.eswa.2010.10.053","volume":"38","author":"G Deng","year":"2011","unstructured":"Deng G, Lin W (2011) Ant colony optimization-based algorithm for airline crew scheduling problem. Expert Syst Appl 38:5787\u2013579","journal-title":"Expert Syst Appl"},{"key":"9855_CR14","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96:226\u2013231","journal-title":"KDD"},{"key":"9855_CR15","first-page":"2008","volume":"37","author":"MA Fattah","year":"2008","unstructured":"Fattah MA, Ren F (2008) Automatic text summarization. World Acad Sci Eng Technol 37:2008","journal-title":"World Acad Sci Eng Technol"},{"key":"9855_CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/mnsc.34.3.263","volume":"34","author":"Kan R Fisher","year":"1988","unstructured":"Fisher Kan R (1988) The design, analysis and implementation of heuristics. Manag Sci 34:263\u2013265","journal-title":"Manag Sci"},{"key":"9855_CR17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1009778005914","volume":"1","author":"JH Friedman","year":"1997","unstructured":"Friedman JH (1997) On bias, variance, 0\/1loss, and the curse-of-dimensionality. Data Min Knowl Discov 1:55\u201377","journal-title":"Data Min Knowl Discov"},{"key":"9855_CR18","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Hern\u00e1ndez RA, Ledeneva Y (2009) Word sequence models for single text summarization. In: Advances in computer-human interactions, 2009. Second International Conferences on ACHI\u201909, IEEE, pp 44\u201348","DOI":"10.1109\/ACHI.2009.58"},{"key":"9855_CR19","first-page":"258","volume":"2","author":"V Gupta","year":"2010","unstructured":"Gupta V, Lehal GS (2010) A survey of text summarization extractive techniques. J Emerg Technol Web Intell 2:258\u2013268","journal-title":"J Emerg Technol Web Intell"},{"key":"9855_CR20","doi-asserted-by":"crossref","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm as 136: a k-means clustering algorithm. Appl Stat 28:100\u2013108","journal-title":"Appl Stat"},{"key":"9855_CR21","doi-asserted-by":"crossref","unstructured":"Kruengkrai C, Jaruskulchai C (2003) Generic text summarization using local and global properties of sentences In: Web intelligence, 2003. WI 2003. Proceedings. International Conference on IEEE\/WIC, IEEE, pp 201\u2013206","DOI":"10.1109\/WI.2003.1241194"},{"key":"9855_CR22","doi-asserted-by":"crossref","unstructured":"Kupiec J, Pedersen J, Chen F (1995) A trainable document summarizer. In: Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, ACM, pp 68\u201373","DOI":"10.1145\/215206.215333"},{"key":"9855_CR23","doi-asserted-by":"crossref","unstructured":"Kyoomarsi F, Khosravi H, Eslami E, Dehkordy PK, Tajoddin A (2008) Optimizing text summarization based on fuzzy logic. In: ACIS-ICIS, pp 347\u2013352","DOI":"10.1109\/ICIS.2008.46"},{"key":"9855_CR24","doi-asserted-by":"crossref","unstructured":"Lin CY (1999) Training a selection function for extraction. In: Proceedings of the eighth international conference on information and knowledge management, ACM, pp 55\u201362","DOI":"10.1145\/319950.319957"},{"key":"9855_CR25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/18.61115","volume":"37","author":"J Lin","year":"1991","unstructured":"Lin J (1991) Divergence measures based on the shannon entropy. IEEE Trans Inf Theory 37:145\u2013151","journal-title":"IEEE Trans Inf Theory"},{"key":"9855_CR26","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1162\/089120102762671927","volume":"28","author":"DR Radev","year":"2002","unstructured":"Radev DR, Hovy E, McKeown K (2002) Introduction to the special issue on summarization. Comput Linguist 28:399\u2013408","journal-title":"Comput Linguist"},{"key":"9855_CR27","doi-asserted-by":"crossref","unstructured":"Sakaki T, Okazaki M, Matsuo Y (2010) Earthquake shakes twitter users: real-time event detection by social sensors. In: Proceedings of the 19th international conference on World wide web, ACM, pp 851\u2013860","DOI":"10.1145\/1772690.1772777"},{"key":"9855_CR28","volume-title":"Introduction to modern information retrieval","author":"G Salton","year":"1984","unstructured":"Salton G, McGill M (1984) Introduction to modern information retrieval. McGraw-Hill Book Company, New York"},{"key":"9855_CR29","unstructured":"Svore KM, Vanderwende L, Burges CJC (2007) Enhancing single-document summarization by combining ranknet and third-party sources In EMNLP-CoNLL 2007, In: Proceedings of the 2007 joint conference on empirical methods in natural language processing and computational natural language learning, Prague, Czech Republic, pp 448\u2013457, 28\u201330 June 2007"},{"key":"9855_CR30","doi-asserted-by":"crossref","unstructured":"Takamura H, Okumura M (2009) Text summarization model based on maximum coverage problem and its variant. In: Proceedings of the 12th conference of the european chapter of the association for computational linguistics, Association for Computational Linguistics, pp 781\u2013789","DOI":"10.3115\/1609067.1609154"},{"key":"9855_CR31","doi-asserted-by":"crossref","unstructured":"Tsolmon B, Lee K (2014) An event extraction model based on timeline and user analysis in latent dirichlet allocation. In: The 37th international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201914, Gold Coast, QLD, Australia, pp 1187\u20131190, 06\u201311 July 2014","DOI":"10.1145\/2600428.2609541"},{"key":"9855_CR32","doi-asserted-by":"crossref","first-page":"350","DOI":"10.15807\/jorsj.50.350","volume":"50","author":"Umetani","year":"2007","unstructured":"Umetani, Yagiura (2007) Relaxation heuristics for the set covering problem. J Oper Res Soc Jpn 50:350\u2013375","journal-title":"J Oper Res Soc Jpn"},{"key":"9855_CR33","unstructured":"Yaghini M, Karimi M, Rahbar M (2013) A set covering approach for multi-depot train driver scheduling. J Comb Optim pp 1\u201319"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9855-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9855-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9855-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:46:20Z","timestamp":1566431180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9855-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,14]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9855"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9855-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,14]]}}}