{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:44Z","timestamp":1740160304021,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:00:00Z","timestamp":1557187200000},"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":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13278-019-0559-9","type":"journal-article","created":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T21:00:06Z","timestamp":1557262806000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving submodular text processing problems using influence graphs"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9342-5272","authenticated-orcid":false,"given":"Ali","family":"Vardasbi","sequence":"first","affiliation":[]},{"given":"Heshaam","family":"Faili","sequence":"additional","affiliation":[]},{"given":"Masoud","family":"Asadpour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"key":"559_CR1","doi-asserted-by":"crossref","unstructured":"Agirre E, Mart\u00ednez D, de Lacalle OL, Soroa A (2006) Two graph-based algorithms for state-of-the-art WSD. In: Proceedings of the 2006 conference on empirical methods in natural language processing. Association for Computational Linguistics, pp 585\u2013593","DOI":"10.3115\/1610075.1610157"},{"key":"559_CR2","unstructured":"Alexandrescu A, Kirchhoff K (2007) Data-driven graph construction for semi-supervised graph-based learning in NLP. In: Proceedings of the main conference human language technologies 2007: the conference of the North American chapter of the association for computational linguistics, pp 204\u2013211"},{"key":"559_CR3","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 1027\u20131035"},{"key":"559_CR4","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Mirzasoleiman B, Karbasi A, Krause A (2014) Streaming submodular maximization. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining\u2014KDD\u201914, pp 671\u2013680","DOI":"10.1145\/2623330.2623637"},{"key":"559_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ins.2013.06.046","volume":"249","author":"E Baralis","year":"2013","unstructured":"Baralis E, Cagliero L, Mahoto N, Fiori A (2013) GRAPHSUM: discovering correlations among multiple terms for graph-based summarization. Inf Sci 249:96\u2013109","journal-title":"Inf Sci"},{"issue":"1","key":"559_CR6","first-page":"1","volume":"39","author":"S Beliga","year":"2015","unstructured":"Beliga S, Mestrovic A, Martincic-Ipsic S (2015) An overview of graph-based keyword extraction methods and approaches. J Inf Organ Sci 39(1):1\u201320","journal-title":"J Inf Organ Sci"},{"key":"559_CR7","doi-asserted-by":"crossref","unstructured":"Berton L, Valverde-Rebaza J, de Andrade Lopes A (2015) Link prediction in graph construction for supervised and semi-supervised learning. In: 2015 international joint conference on neural networks (IJCNN). IEEE, pp 1\u20138","DOI":"10.1109\/IJCNN.2015.7280543"},{"issue":"1\u20137","key":"559_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"issue":"1","key":"559_CR9","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi ME, Kingravi HA, Vela PA (2013) A comparative study of efficient initialization methods for the K-means clustering algorithm. Expert Syst Appl 40(1):200\u2013210","journal-title":"Expert Syst Appl"},{"key":"559_CR10","doi-asserted-by":"crossref","unstructured":"Chekuri C, Jayram TS, Vondrak J (2015) On multiplicative weight updates for concave and submodular function maximization. In: Proceedings of the 2015 conference on innovations in theoretical computer science\u2014ITCS\u201915, pp 201\u2013210","DOI":"10.1145\/2688073.2688086"},{"key":"559_CR11","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"559_CR12","unstructured":"Cieri C, Graff D, Liberman M, Martey N, Strassel S (1999) The TDT-2 text and speech corpus. In: Proceedings of the broadcast news workshop\u201999, p 57"},{"key":"559_CR13","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1613\/jair.1523","volume":"22","author":"G Erkan","year":"2004","unstructured":"Erkan G, Radev DR (2004) LexRank: graph-based lexical centrality as salience in text summarization. J Artif Intell Res 22:457\u2013479","journal-title":"J Artif Intell Res"},{"issue":"9","key":"559_CR14","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1016\/j.sigpro.2011.12.009","volume":"92","author":"L Galluccio","year":"2012","unstructured":"Galluccio L, Michel O, Comon P, Hero AO III (2012) Graph based k-means clustering. Signal Process 92(9):1970\u20131984","journal-title":"Signal Process"},{"issue":"6","key":"559_CR15","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter MS (1973) The strength of weak ties. Am J Sociol 78(6):1360\u20131380","journal-title":"Am J Sociol"},{"key":"559_CR16","doi-asserted-by":"crossref","unstructured":"Herings P, Van der Laan G, Talman D (2001) Measuring the power of nodes in digraphs. Technical report, Tinbergen Institute","DOI":"10.2139\/ssrn.288088"},{"key":"559_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-32115-3_19","volume":"2012","author":"B Huang","year":"2012","unstructured":"Huang B, Yang Y, Mahmood A, Wang H (2012) Microblog topic detection based on LDA model and single-pass clustering. Int Conf Rough Sets Curr Trends Comput 2012:166\u2013171","journal-title":"Int Conf Rough Sets Curr Trends Comput"},{"key":"559_CR18","unstructured":"Kazemi E, Zadimoghaddam M, Karbasi A (2018) Scalable deletion-robust submodular maximization: data summarization with privacy and fairness constraints. In: International conference on machine learning, pp 2549\u20132558"},{"issue":"5","key":"559_CR19","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM) 46(5):604\u2013632","journal-title":"J ACM (JACM)"},{"key":"559_CR20","unstructured":"Klimt B, Yang Y (2004) Introducing the Enron corpus. In: CEAS"},{"issue":"2\u20133","key":"559_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2200000044","volume":"5","author":"A Kulesza","year":"2012","unstructured":"Kulesza A, Taskar B (2012) Determinantal point processes for machine learning. Found Trends\u00ae Mach Learn 5(2\u20133):123\u2013286","journal-title":"Found Trends\u00ae Mach Learn"},{"key":"559_CR22","unstructured":"Leskovec J (2018) Stanford large network dataset collection. https:\/\/snap.stanford.edu\/data\/index.html . Accessed 1 May 2019."},{"key":"559_CR23","unstructured":"Leskovec J, Grobelnik M, Milic-Frayling N (2004) Learning semantic graph mapping for document summarization. In: Proceedings of ECML\/PKDD-2004 workshop on knowledge discovery and ontologies"},{"issue":"2","key":"559_CR24","first-page":"1","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution. ACM Trans Knowl Discov Data 1(2):1\u201339","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1","key":"559_CR25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"559_CR26","unstructured":"Lewis DD (2004) Reuters-21578 text categorization test collection. http:\/\/www.daviddlewis.com\/resources\/testcollections\/reuters21578\/ . Accessed 1 May 2019"},{"issue":"2","key":"559_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/TMM.2016.2616279","volume":"19","author":"W Li","year":"2017","unstructured":"Li W, Joo J, Qi H, Zhu S-C (2017) Joint image-text news topic detection and tracking by multimodal topic and-or graph. IEEE Trans Multimed 19(2):367\u2013381","journal-title":"IEEE Trans Multimed"},{"key":"559_CR28","unstructured":"Lin C-Y (2004) ROUGE: a package for automatic evaluation of summaries. In: Proceedings of the workshop on text summarization branches out (WAS 2004), Barcelona, Spain, July 25\u201326"},{"key":"559_CR29","unstructured":"Lin H, Bilmes J (2010) Multi-document summarization via budgeted maximization of submodular functions. In: HLT\u201910 human language technologies: the 2010 annual conference of the North American chapter of the association for computational linguistics, pp 912\u2013920"},{"key":"559_CR30","first-page":"510","volume":"1","author":"H Lin","year":"2011","unstructured":"Lin H, Bilmes J (2011) A class of submodular functions for document summarization. Comput Linguist 1:510\u2013520","journal-title":"Comput Linguist"},{"key":"559_CR31","unstructured":"Lin H, Bilmes J (2012) Learning mixtures of submodular shells with application to document summarization. arXiv preprint arXiv:1210.4871"},{"key":"559_CR32","doi-asserted-by":"crossref","unstructured":"Matsuo Y, Sakaki T, Uchiyama K, Ishizuka M (2006) Graph-based word clustering using a web search engine. In: Proceedings of the 2006 conference on empirical methods in natural language processing. Association for Computational Linguistics, pp 542\u2013550","DOI":"10.3115\/1610075.1610150"},{"key":"559_CR33","doi-asserted-by":"crossref","unstructured":"Mei Q, Guo J, Radev D (2010) DivRank: the interplay of prestige and diversity in information networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1009\u20131018","DOI":"10.1145\/1835804.1835931"},{"key":"559_CR34","doi-asserted-by":"crossref","unstructured":"Mihalcea R (2004) Graph-based ranking algorithms for sentence extraction, applied to text summarization. In: Proceedings of the ACL 2004 on interactive poster and demonstration sessions. Association for Computational Linguistics, p 20","DOI":"10.3115\/1219044.1219064"},{"key":"559_CR35","first-page":"404","volume":"85","author":"R Mihalcea","year":"2004","unstructured":"Mihalcea R, Tarau P (2004) TextRank: bringing order into texts. Proc EMNLP 85:404\u2013411","journal-title":"Proc EMNLP"},{"key":"559_CR36","first-page":"2049","volume":"26","author":"B Mirzasoleiman","year":"2013","unstructured":"Mirzasoleiman B, Sarkar R, Krause A (2013) Distributed submodular maximization: identifying representative elements in massive data. Adv Neural Inf Process Syst 26:2049\u20132057","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"559_CR37","first-page":"8330","volume":"17","author":"B Mirzasoleiman","year":"2016","unstructured":"Mirzasoleiman B, Karbasi A, Sarkar R, Krause A (2016) Distributed submodular maximization. J Mach Learn Res 17(1):8330\u20138373","journal-title":"J Mach Learn Res"},{"key":"559_CR38","doi-asserted-by":"crossref","unstructured":"Mirzasoleiman B, Jegelka S, Krause A (2018) Streaming non-monotone submodular maximization: personalized video summarization on the fly. In: Thirty-second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11529"},{"issue":"1","key":"559_CR39","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2014I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"559_CR40","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.artint.2015.07.005","volume":"228","author":"MT Pilehvar","year":"2015","unstructured":"Pilehvar MT, Navigli R (2015) From senses to texts: an all-in-one graph-based approach for measuring semantic similarity. Artif Intell 228:95\u2013128","journal-title":"Artif Intell"},{"key":"559_CR41","unstructured":"Rosen-Zvi M, Griffiths T, Steyvers M, Smyth P (2004) The author-topic model for authors and documents. In: Proceedings of the 20th conference on uncertainty in artificial intelligence, pp 487\u2013494"},{"key":"559_CR42","doi-asserted-by":"crossref","unstructured":"Spina D, Gonzalo J, Amig\u00f3 E (2014) Learning similarity functions for topic detection in online reputation monitoring. In: Proceedings of the 37th international ACM SIGIR conference on research and development in information retrieval\u2014SIGIR\u201914, pp 527\u2013536","DOI":"10.1145\/2600428.2609621"},{"key":"559_CR43","first-page":"75","volume":"2014","author":"Y Tang","year":"2014","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. Kdd 2014:75\u201386","journal-title":"Kdd"},{"key":"559_CR44","doi-asserted-by":"crossref","unstructured":"Tixier AJ, Meladianos P, Vazirgiannis M (2017) Combining graph degeneracy and submodularity for unsupervised extractive summarization. In: Proceedings of the workshop on new frontiers in summarization, pp 48\u201358","DOI":"10.18653\/v1\/W17-4507"},{"issue":"1","key":"559_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3072652","volume":"36","author":"A Vardasbi","year":"2017","unstructured":"Vardasbi A, Faili H, Asadpour M (2017) SWIM: stepped weighted shell decomposition influence maximization for large-scale networks. ACM Trans Inf Syst 36(1):1\u201333","journal-title":"ACM Trans Inf Syst"},{"issue":"3","key":"559_CR46","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.csl.2004.05.002","volume":"18","author":"J V\u00e9ronis","year":"2004","unstructured":"V\u00e9ronis J (2004) Hyperlex: lexical cartography for information retrieval. Comput Speech Lang 18(3):223\u2013252","journal-title":"Comput Speech Lang"},{"key":"559_CR47","doi-asserted-by":"crossref","unstructured":"Wang D, Zhu S, Li T, Gong Y (2009) Multi-document summarization using sentence-based topic models. In: Proceedings of the ACL-IJCNLP 2009 conference short papers, pp 297\u2013300","DOI":"10.3115\/1667583.1667675"},{"key":"559_CR48","doi-asserted-by":"crossref","unstructured":"Wang C, Yu X, Li Y, Zhai C, Han J (2013) Content coverage maximization on word networks for hierarchical topic summarization. In: Proceedings of the 22nd ACM international conference on conference on information and knowledge management\u2014CIKM\u201913, pp 249\u2013258","DOI":"10.1145\/2505515.2505585"},{"issue":"6684","key":"559_CR49","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"key":"559_CR50","unstructured":"Weng, J, Yao Y, Leonardi E, Lee F (2011) Event detection in Twitter. Development, pp 401\u2013408"},{"key":"559_CR51","unstructured":"Xie P, Xing EP (2013) Integrating document clustering and topic modeling. arXiv preprint arXiv:1309.6874"},{"issue":"1","key":"559_CR52","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"559_CR53","doi-asserted-by":"crossref","unstructured":"Yang Y, Pierce T, Carbonell J (1998) A study of retrospective and on-line event detection. In: Proceedings of the 21st annual international ACM SIGIR conference on research and development in information retrieval\u2014SIGIR\u201998, pp 28\u201336","DOI":"10.1145\/290941.290953"},{"key":"559_CR54","doi-asserted-by":"crossref","unstructured":"Yasunaga, M, Zhang R, Meelu K, Pareek A, Srinivasan K, Radev D (2017) Graph-based neural multi-document summarization. arXiv preprint arXiv:1706.06681","DOI":"10.18653\/v1\/K17-1045"},{"issue":"5","key":"559_CR55","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1109\/TIP.2010.2090535","volume":"20","author":"M Zheng","year":"2011","unstructured":"Zheng M, Bu J, Chen C, Wang C, Zhang L, Qiu G, Cai D (2011) Graph regularized sparse coding for image representation. IEEE Trans Image Process 20(5):1327\u20131336","journal-title":"IEEE Trans Image Process"},{"key":"559_CR56","unstructured":"Zhou, T, Ouyang H, Chang Y, Bilmes J, Guestrin C (2016) Scaling submodular maximization via pruned submodularity graphs. arXiv preprint arXiv:1606.00399"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-019-0559-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-019-0559-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-019-0559-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T14:24:13Z","timestamp":1663424653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-019-0559-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,7]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s13278-019-0559-9","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2019,5,7]]},"assertion":[{"value":"2 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"21"}}