{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:44:22Z","timestamp":1710337462631},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,12]],"date-time":"2013-07-12T00:00:00Z","timestamp":1373587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10618-013-0328-8","type":"journal-article","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T11:21:43Z","timestamp":1373541703000},"page":"321-343","source":"Crossref","is-referenced-by-count":12,"title":["Activity preserving graph simplification"],"prefix":"10.1007","volume":"27","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Gianmarco","family":"De Francisci\u00a0Morales","sequence":"additional","affiliation":[]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[]},{"given":"Antti","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,12]]},"reference":[{"issue":"6","key":"328_CR1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1088\/1367-2630\/9\/6\/176","volume":"9","author":"A Arenas","year":"2007","unstructured":"Arenas A, Duch J, Fern\u00e1ndez A, G\u00f3mez S (2007) Size reduction of complex networks preserving modularity. New J Phys 9(6):176","journal-title":"New J Phys"},{"key":"328_CR2","doi-asserted-by":"crossref","unstructured":"Edmonds J (2003) Submodular functions, matroids, and certain polyhedra. In: Combinatorial optimization\u2014Eureka, You Shrink!, Springer, Berlin, pp 11\u201326","DOI":"10.1007\/3-540-36478-1_2"},{"key":"328_CR3","doi-asserted-by":"crossref","unstructured":"Elkin M, Peleg D (2005) Approximating $$k$$ k -spanner problems for $$k {\\>} 2$$ k 2 . Theor Comput Sci 337(1):249\u2013277","DOI":"10.1016\/j.tcs.2004.11.022"},{"key":"328_CR4","doi-asserted-by":"crossref","unstructured":"Foti NJ, Hughes JM, Rockmore DN (2011) Nonparametric sparsification of complex multiscale networks. PLoS One 6(2):e16431","DOI":"10.1371\/journal.pone.0016431"},{"key":"328_CR5","volume-title":"Submodular functions and optimization, vol 58","author":"S Fujishige","year":"2005","unstructured":"Fujishige S (2005) Submodular functions and optimization, vol 58. Elsevier Science, Amsterdam"},{"key":"328_CR6","doi-asserted-by":"crossref","unstructured":"Fung WS, Hariharan R, Harvey NJ, Panigrahi D (2011) A general framework for graph sparsification. In: Proceedings of the 43rd annual ACM symposium on theory of computing, ACM, pp 71\u201380","DOI":"10.1145\/1993636.1993647"},{"key":"328_CR7","doi-asserted-by":"crossref","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2010) Inferring networks of diffusion and influence. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 1019\u20131028","DOI":"10.1145\/1835804.1835933"},{"key":"328_CR8","unstructured":"Gomez-Rodriguez M, Balduzzi D, Sch\u00f6lkopf B (2011) Uncovering the temporal dynamics of diffusion networks. In: Proceedings of the 28th international conference on machine learning, pp 561\u2013568"},{"key":"328_CR9","doi-asserted-by":"crossref","unstructured":"Iwata S, Orlin JB (2009) A simple combinatorial algorithm for submodular function minimization. In: Proceedings of the twentieth Annual ACM-SIAM symposium on discrete algorithms, society for industrial and applied mathematics, pp 1230\u20131237","DOI":"10.1137\/1.9781611973068.133"},{"key":"328_CR10","doi-asserted-by":"crossref","unstructured":"Jamali M, Ester M (2010) Modeling and comparing the influence of neighbors on the behavior of users in social and similarity networks. In: 2010 IEEE international conference on data mining workshops (ICDMW), IEEE, pp 336\u2013343","DOI":"10.1109\/ICDMW.2010.97"},{"key":"328_CR11","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"328_CR12","first-page":"1141","volume":"11","author":"A Krause","year":"2010","unstructured":"Krause A (2010) Sfo: a toolbox for submodular function optimization. J Mach Learn Res 11:1141\u20131144","journal-title":"J Mach Learn Res"},{"key":"328_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2007) Scalable modeling of real graphs using kronecker multiplication. In: Proceedings of the 24th international conference on machine learning, ACM, pp 497\u2013504","DOI":"10.1145\/1273496.1273559"},{"key":"328_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec J, Backstrom L, Kleinberg J (2009) Meme-tracking and the dynamics of the news cycle. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 497\u2013506","DOI":"10.1145\/1557019.1557077"},{"key":"328_CR15","doi-asserted-by":"crossref","unstructured":"Mathioudakis M, Bonchi F, Castillo C, Gionis A, Ukkonen A (2011) Sparsification of influence networks. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 529\u2013537","DOI":"10.1145\/2020408.2020492"},{"issue":"5","key":"328_CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.ipl.2005.11.002","volume":"97","author":"E Misio\u0142ek","year":"2006","unstructured":"Misio\u0142ek E, Chen DZ (2006) Two flow network simplification algorithms. Inf Process Let 97(5):197\u2013202","journal-title":"Inf Process Let"},{"key":"328_CR17","unstructured":"Nagano K, Kawahara Y, Aihara K (2011) Size-constrained submodular minimization through minimum norm base. In: Proceedings of the 28th international conference on machine learning, pp 977\u2013984"},{"issue":"1","key":"328_CR18","doi-asserted-by":"crossref","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-I. Math Progr 14(1):265\u2013294","journal-title":"Math Progr"},{"key":"328_CR19","doi-asserted-by":"crossref","unstructured":"Peleg D, Sch\u00e4ffer AA (1989) Graph spanners. J Graph Theory 13(1):99\u2013116","DOI":"10.1002\/jgt.3190130114"},{"issue":"4","key":"328_CR20","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1016\/j.ipm.2007.09.005","volume":"44","author":"A Quirin","year":"2008","unstructured":"Quirin A, Cordon O, Santamaria J, Vargas-Quesada B, Moya-Aneg\u00f3n F (2008) A new variant of the pathfinder algorithm to generate large visual science maps in cubic time. Inf Process Manag 44(4):1611\u20131623","journal-title":"Inf Process Manag"},{"issue":"5","key":"328_CR21","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/j.ins.2009.11.007","volume":"180","author":"E Serrano","year":"2010","unstructured":"Serrano E, Quirin A, Botia J, Cord\u00f3n O (2010) Debugging complex software systems by means of pathfinder networks. Inf Sci 180(5):561\u2013583","journal-title":"Inf Sci"},{"issue":"16","key":"328_CR22","doi-asserted-by":"crossref","first-page":"6483","DOI":"10.1073\/pnas.0808904106","volume":"106","author":"M\u00c1 Serrano","year":"2009","unstructured":"Serrano M\u00c1, Bogu\u00f1\u00e1 M, Vespignani A (2009) Extracting the multiscale backbone of complex weighted networks. Proc Nat Acad Sci USA 106(16):6483\u20136488","journal-title":"Proc Nat Acad Sci USA"},{"key":"328_CR23","doi-asserted-by":"crossref","unstructured":"Srikant R, Yang Y (2001) Mining web logs to improve website organization. In: Proceedings of the 10th international conference on World Wide Web, ACM, pp 430\u2013437","DOI":"10.1145\/371920.372097"},{"issue":"6","key":"328_CR24","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1137\/100783352","volume":"40","author":"Z Svitkina","year":"2011","unstructured":"Svitkina Z, Fleischer L (2011) Submodular approximation: sampling-based algorithms and lower bounds. SIAM J Comput 40(6):1715\u20131737","journal-title":"SIAM J Comput"},{"key":"328_CR25","doi-asserted-by":"crossref","unstructured":"Toivonen H, Mahler S, Zhou F (2010) A framework for path-oriented network simplification. In: Advances in intelligent data analysis IX, Springer, Berlin, pp 220\u2013231","DOI":"10.1007\/978-3-642-13062-5_21"},{"issue":"1","key":"328_CR26","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe P (1976) Finding the nearest point in a polytope. Math Progr 11(1):128\u2013149","journal-title":"Math Progr"},{"key":"328_CR27","doi-asserted-by":"crossref","unstructured":"Zhou F, Malher S, Toivonen H (2010) Network simplification with minimal loss of connectivity. In: Data Mining (ICDM), 2010 IEEE 10th international conference on IEEE, pp 659\u2013668","DOI":"10.1109\/ICDM.2010.133"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0328-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-013-0328-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0328-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T01:31:27Z","timestamp":1563413487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-013-0328-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,12]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s10618-013-0328-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,12]]}}}