{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:44:59Z","timestamp":1743014699110,"version":"3.40.3"},"publisher-location":"Cham","reference-count":76,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307189"},{"type":"electronic","value":"9783030307196"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30719-6_10","type":"book-chapter","created":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T06:27:36Z","timestamp":1567232856000},"page":"232-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online and Scalable Adaptive Cyber Defense"],"prefix":"10.1007","author":[{"given":"Benjamin W.","family":"Priest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Cybenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satinder","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Albanese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 459\u2013467. SIAM (2012)","DOI":"10.1137\/1.9781611973099.40"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 5\u201314. ACM (2012)","DOI":"10.1145\/2213556.2213560"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Alahakoon, T., Tripathi, R., Kourtellis, N., Simha, R., Iamnitchi, A.: K-path centrality: a new centrality measure in social networks. In: Proceedings of the 4th Workshop on Social Network Systems, p. 1. ACM (2011)","DOI":"10.1145\/1989656.1989657"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Andoni, A., Krauthgamer, R., Onak, K.: Streaming algorithms via precision sampling. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 363\u2013372. IEEE (2011)","DOI":"10.1109\/FOCS.2011.82"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-77004-6_10","volume-title":"Algorithms and Models for the Web-Graph","author":"DA Bader","year":"2007","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 124\u2013137. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_10"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45726-7_1","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Z Bar-Yossef","year":"2002","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 1\u201310. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45726-7_1"},{"issue":"5439","key":"10_CR8","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"10_CR9","first-page":"133","volume-title":"2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Elisabetta Bergamini","year":"2014","unstructured":"Bergamini, E., Meyerhenke, H., Staudt, C.L.: Approximating betweenness centrality in large evolving networks. In: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 133\u2013146. SIAM (2014)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Vigna, S.: HyperANF: approximating the neighbourhood function of very large graphs on a budget. In: Proceedings of the 20th International Conference on World Wide Web, pp. 625\u2013634. ACM (2011)","DOI":"10.1145\/1963405.1963493"},{"issue":"3\u20134","key":"10_CR11","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1080\/15427951.2013.865686","volume":"10","author":"P Boldi","year":"2014","unstructured":"Boldi, P., Vigna, S.: Axioms for centrality. Internet Math. 10(3\u20134), 222\u2013262 (2014)","journal-title":"Internet Math."},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"07","key":"10_CR13","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurc. Chaos 17(07), 2303\u20132318 (2007)","journal-title":"Int. J. Bifurc. Chaos"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/MSP.2013.138","volume":"11","author":"AA C\u00e1rdenas","year":"2013","unstructured":"C\u00e1rdenas, A.A., Manadhata, P.K., Rajan, S.P.: Big data analytics for security. IEEE Secur. Priv. 11(6), 74\u201376 (2013)","journal-title":"IEEE Secur. Priv."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693\u2013703. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_59"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 205\u2013214. ACM (2009)","DOI":"10.1145\/1536414.1536445"},{"issue":"6","key":"10_CR17","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/3019134","volume":"63","author":"KL Clarkson","year":"2017","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low-rank approximation and regression in input sparsity time. J. ACM (JACM) 63(6), 54 (2017)","journal-title":"J. ACM (JACM)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Cohen, R., Katzir, L., Yehezkel, A.: A minimal variance estimator for the cardinality of big data set intersection. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 95\u2013103. ACM (2017)","DOI":"10.1145\/3097983.3097999"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TKDE.2003.1198388","volume":"15","author":"G Cormode","year":"2003","unstructured":"Cormode, G., Datar, M., Indyk, P., Muthukrishnan, S.: Comparing data streams using hamming norms (how to zero in). IEEE Trans. Knowl. Data Eng. 15(3), 529\u2013540 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans. Database Syst. (TODS) 30(1), 249\u2013278 (2005)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"10_CR22","unstructured":"Deng, F., Rafiei, D.: New estimation algorithms for streaming data: count-min can do more (2007)"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/jagm.1997.0873","volume":"25","author":"M Dietzfelbinger","year":"1997","unstructured":"Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. J, Algorithms 25(1), 19\u201351 (1997)","journal-title":"J, Algorithms"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-39658-1_55","volume-title":"Algorithms - ESA 2003","author":"M Durand","year":"2003","unstructured":"Durand, M., Flajolet, P.: Loglog counting of large cardinalities. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 605\u2013617. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_55"},{"key":"10_CR25","unstructured":"Ertl, O.: New cardinality estimation algorithms for HyperLogLog sketches. arXiv preprint arXiv:1702.01284 (2017)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high speed links. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 153\u2013166. ACM (2003)","DOI":"10.1145\/948224.948225"},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw. (TON) 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"issue":"2\u20133","key":"10_CR28","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theoret. Comput. Sci. 348(2\u20133), 207\u2013216 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. In: Discrete Mathematics and Theoretical Computer Science. pp. 137\u2013156 (2007)","DOI":"10.46298\/dmtcs.3545"},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR31","unstructured":"Goyal, A., Daum\u00e9 III, H., Cormode, G.: Sketch algorithms for estimating point queries in NLP. In: Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 1093\u20131103. Association for Computational Linguistics (2012)"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: 2012 International Conference on Privacy, Security, Risk and Trust (PASSAT) and 2012 International Conference on Social Computing (SocialCom), pp. 11\u201320. IEEE (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"10_CR33","unstructured":"Guha, S., McGregor, A.: Graph streams and sketches: resources (2018). https:\/\/people.cs.umass.edu\/~mcgregor\/graphs\/"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Gupta, P., Goel, A., Lin, J., Sharma, A., Wang, D., Zadeh, R.: WTF: the who to follow service at Twitter. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 505\u2013514. ACM (2013)","DOI":"10.1145\/2488388.2488433"},{"issue":"2","key":"10_CR35","doi-asserted-by":"publisher","first-page":"48","DOI":"10.14778\/2850578.2850580","volume":"9","author":"T Hayashi","year":"2015","unstructured":"Hayashi, T., Akiba, T., Yoshida, Y.: Fully dynamic betweenness centrality maintenance on massive networks. Proc. VLDB Endow. 9(2), 48\u201359 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Heule, S., Nunkesser, M., Hall, A.: HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm. In: Proceedings of the 16th International Conference on Extending Database Technology, pp. 683\u2013692. ACM (2013)","DOI":"10.1145\/2452376.2452456"},{"issue":"3","key":"10_CR37","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/1147954.1147955","volume":"53","author":"P Indyk","year":"2006","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM (JACM) 53(3), 307\u2013323 (2006)","journal-title":"J. ACM (JACM)"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.: Optimal approximations of the frequency moments of data streams. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 202\u2013208. ACM (2005)","DOI":"10.1145\/1060590.1060621"},{"issue":"189\u2013206","key":"10_CR39","first-page":"1","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26(189\u2013206), 1 (1984)","journal-title":"Contemp. Math."},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Jowhari, H., Sa\u011flam, M., Tardos, G.: Tight bounds for Lp samplers, finding duplicates in streams, and related problems. In: Proceedings of the Thirtieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 49\u201358. ACM (2011)","DOI":"10.1145\/1989284.1989289"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 41\u201352. ACM (2010)","DOI":"10.1145\/1807085.1807094"},{"key":"10_CR42","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.artint.2016.06.008","volume":"239","author":"C Kang","year":"2016","unstructured":"Kang, C., Kraus, S., Molinaro, C., Spezzano, F., Subrahmanian, V.: Diffusion centrality: a paradigm to maximize spread in social networks. Artif. Intell. 239, 70\u201396 (2016)","journal-title":"Artif. Intell."},{"issue":"1","key":"10_CR43","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/141002281","volume":"46","author":"M Kapralov","year":"2017","unstructured":"Kapralov, M., Lee, Y.T., Musco, C., Musco, C., Sidford, A.: Single pass spectral sparsification in dynamic streams. SIAM J. Comput. 46(1), 456\u2013477 (2017)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR44","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s13278-012-0076-6","volume":"3","author":"N Kourtellis","year":"2013","unstructured":"Kourtellis, N., Alahakoon, T., Simha, R., Iamnitchi, A., Tripathi, R.: Identifying high betweenness centrality nodes in large social networks. Soc. Netw. Anal. Min. 3(4), 899\u2013914 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"9","key":"10_CR45","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1109\/TKDE.2015.2419666","volume":"27","author":"N Kourtellis","year":"2015","unstructured":"Kourtellis, N., Morales, G.D.F., Bonchi, F.: Scalable online betweenness centrality in evolving graphs. IEEE Trans. Knowl. Data Eng. 27(9), 2494\u20132506 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Li, Y., Nguyen, H.L., Woodruff, D.P.: On sketching matrix norms and the top singular vector. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1562\u20131581. Society for Industrial and Applied Mathematics (2014)","DOI":"10.1137\/1.9781611973402.114"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Li, Y., Nguyen, H.L., Woodruff, D.P.: Turnstile streaming algorithms might as well be linear sketches. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 174\u2013183. ACM (2014)","DOI":"10.1145\/2591796.2591812"},{"key":"10_CR48","unstructured":"Li, Y., Woodruff, D.P.: Tight bounds for sketching the operator norm, Schatten norms, and subspace embeddings. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 60. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"10_CR49","unstructured":"Mahoney, M.W., et al.: Randomized algorithms for matrices and data. Found. Trends\u00ae Mach. Learn. 3(2), 123\u2013224 (2011)"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"10_CR51","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1007\/978-0-387-39940-9_184","volume-title":"Encyclopedia of Database Systems","author":"A McGregor","year":"2009","unstructured":"McGregor, A.: Graph mining on streams. In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 1271\u20131275. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-39940-9_184"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Monemizadeh, M., Woodruff, D.P.: 1-pass relative-error Lp-sampling with applications. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1143\u20131160. SIAM (2010)","DOI":"10.1137\/1.9781611973075.92"},{"issue":"2","key":"10_CR53","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S. Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S., et al.: Data streams: algorithms and applications. Found. Trends\u00ae Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"key":"10_CR54","doi-asserted-by":"crossref","unstructured":"Myers, S.A., Sharma, A., Gupta, P., Lin, J.: Information network or social network?: the structure of the Twitter follow graph. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 493\u2013498. ACM (2014)","DOI":"10.1145\/2567948.2576939"},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"Nelson, J., Nguy\u00ean, H.L.: OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 117\u2013126. IEEE (2013)","DOI":"10.1109\/FOCS.2013.21"},{"key":"10_CR56","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.laa.2012.12.025","volume":"441","author":"J Nelson","year":"2014","unstructured":"Nelson, J., Nguyn, H.L., Woodruff, D.P.: On deterministic sketching and streaming for sparse recovery and norm estimation. Linear Algebra Appl. 441, 152\u2013167 (2014)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"10_CR57","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N Nisan","year":"1992","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449\u2013461 (1992)","journal-title":"Combinatorica"},{"key":"10_CR58","unstructured":"Palmer, C.R., Gibbons, P.B., Faloutsos, C.: ANF: a fast and scalable tool for data mining in massive graphs. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 81\u201390. ACM (2002)"},{"key":"10_CR59","doi-asserted-by":"crossref","unstructured":"Pearce, R.: Triangle counting for scale-free graphs at scale in distributed memory. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20134. IEEE (2017)","DOI":"10.1109\/HPEC.2017.8091051"},{"key":"10_CR60","doi-asserted-by":"crossref","unstructured":"Pearce, R., Gokhale, M., Amato, N.M.: Faster parallel traversal of scale free graphs at extreme scale with vertex delegates. In: SC14: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 549\u2013559. IEEE (2014)","DOI":"10.1109\/SC.2014.50"},{"key":"10_CR61","unstructured":"Priest, B.W.: Semi-streaming approximation of centrality indices in massive graphs. Ph.D. thesis, Dartmouth College (2019)"},{"key":"10_CR62","doi-asserted-by":"crossref","unstructured":"Priest, B.W., Pearce, R., Sanders, G.: Estimating edge-local triangle count heavy hitters in edge-linear time and almost-vertex-linear space. In: 2018 IEEE High Performance Extreme Computing Conference (HPEC). IEEE (2018)","DOI":"10.1109\/HPEC.2018.8547721"},{"issue":"3","key":"10_CR63","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2220357.2220361","volume":"59","author":"M P\u0103tra\u015fcu","year":"2012","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: The power of simple tabulation hashing. J. ACM (JACM) 59(3), 14 (2012)","journal-title":"J. ACM (JACM)"},{"key":"10_CR64","unstructured":"Qin, J., Kim, D., Tung, Y.: LogLog-beta and more: a new algorithm for cardinality estimation based on LogLog counting. arXiv preprint arXiv:1612.02284 (2016)"},{"issue":"2","key":"10_CR65","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2016","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Disc. 30(2), 438\u2013475 (2016)","journal-title":"Data Min. Knowl. Disc."},{"issue":"10","key":"10_CR66","doi-asserted-by":"publisher","first-page":"2506","DOI":"10.1109\/TIFS.2018.2821095","volume":"13","author":"X Sun","year":"2018","unstructured":"Sun, X., Dai, J., Liu, P., Singhal, A., Yen, J.: Using bayesian networks for probabilistic identification of zero-day attack paths. IEEE Trans. Inf. Forensics Secur. 13(10), 2506\u20132521 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10_CR67","doi-asserted-by":"crossref","unstructured":"Ting, D.: Streamed approximate counting of distinct elements: Beating optimal batch methods. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 442\u2013451. ACM (2014)","DOI":"10.1145\/2623330.2623669"},{"key":"10_CR68","unstructured":"Upstill, T., Craswell, N., Hawking, D.: Predicting fame and fortune: PageRank or indegree. In: Proceedings of the Australasian Document Computing Symposium, ADCS, pp. 31\u201340 (2003)"},{"key":"10_CR69","unstructured":"Vu, H.: Data stream algorithms for large graphs and high dimensional data (2018)"},{"issue":"3","key":"10_CR70","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR71","unstructured":"Wei, W., Carley, K.: Real time closeness and betweenness centrality calculations on streaming network data. In: Proceedings of the 2014 ASE Big-Data\/SocialCom\/Cybersecurity Conference, Stanford University (2014)"},{"issue":"2","key":"10_CR72","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","volume":"15","author":"KY Whang","year":"1990","unstructured":"Whang, K.Y., Vander-Zanden, B.T., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst. (TODS) 15(2), 208\u2013229 (1990)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"10_CR73","unstructured":"Woodruff, D.P., et al.: Sketching as a tool for numerical linear algebra. Found. Trends\u00ae Theor. Comput. Sci. 10(1\u20132), 1\u2013157 (2014)"},{"key":"10_CR74","doi-asserted-by":"crossref","unstructured":"Xiao, Q., Zhou, Y., Chen, S.: Better with fewer bits: improving the performance of cardinality estimation of large data streams. In: INFOCOM 2017-IEEE Conference on Computer Communications, pp. 1\u20139. IEEE (2017)","DOI":"10.1109\/INFOCOM.2017.8057088"},{"key":"10_CR75","doi-asserted-by":"crossref","unstructured":"Yoshida, Y.: Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1416\u20131425. ACM (2014)","DOI":"10.1145\/2623330.2623626"},{"issue":"7","key":"10_CR76","doi-asserted-by":"publisher","first-page":"e101271","DOI":"10.1371\/journal.pone.0101271","volume":"9","author":"Q Zhang","year":"2014","unstructured":"Zhang, Q., Pell, J., Canino-Koning, R., Howe, A.C., Brown, C.T.: These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure. PLoS ONE 9(7), e101271 (2014)","journal-title":"PLoS ONE"}],"container-title":["Lecture Notes in Computer Science","Adversarial and Uncertain Reasoning for Adaptive Cyber Defense"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30719-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:36:31Z","timestamp":1664242591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30719-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307189","9783030307196"],"references-count":76,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30719-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"31 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}