{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:16:07Z","timestamp":1743102967464,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319509006"},{"type":"electronic","value":"9783319509013"}],"license":[{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-50901-3_23","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:02:04Z","timestamp":1480464124000},"page":"287-298","source":"Crossref","is-referenced-by-count":0,"title":["Clustering, Prominence and Social Network Analysis on Incomplete Networks"],"prefix":"10.1007","author":[{"given":"Kshiteesh","family":"Hegde","sequence":"first","affiliation":[]},{"given":"Malik","family":"Magdon-Ismail","sequence":"additional","affiliation":[]},{"given":"Boleslaw","family":"Szymanski","sequence":"additional","affiliation":[]},{"given":"Konstantin","family":"Kuzmin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,30]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., McSherry, F.: Fast computation of low-rank matrix approximations. JACM (2007) 298 Kshiteesh Hegde, Malik Magdon-Ismail, Boleslaw Szymanski and Konstantin Kuzmin","DOI":"10.1145\/1219092.1219097"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election: divided they blog. Int. Workshop on Link discovery (2005)","DOI":"10.1145\/1134271.1134277"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Hazan, E., Kale, S.: A fast random sampling algorithm for sparsifying matrices. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2006)","DOI":"10.1007\/11830924_26"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. Algorithms and Models for the Web-Graph (2007)","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal column-based matrix reconstruction. SICOMP (2014)","DOI":"10.1137\/12086755X"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. of Math. Sociology (2001)","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Chen, M., Nguyen, T., Szymanski, B.K.: A new metric for quality of network community structure. HUMAN (2013)","DOI":"10.1109\/SocialCom.2013.25"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Vempala, S.: Adaptive sampling and fast low-rank matrix approximation. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2006)","DOI":"10.1007\/11830924_28"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports (2010)","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Gaiteri, C., Chen, M., Szymanski, B., Kuzmin, K., Xie, J., Lee, C., Blanche, T., Neto, E.C., Huang, S.C., Grabowski, T., et al.: Identifying robust communities and multi-community nodes by combining top-down and bottom-up approaches to clustering. Scientific Reports (2015)","DOI":"10.1038\/srep16361"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. PNAS (2002)","DOI":"10.1073\/pnas.122653799"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. TWEB (2007)","DOI":"10.1145\/1232722.1232727"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. ACM SIGKDD (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network community detection. WWW (2010)","DOI":"10.1145\/1772690.1772755"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Madduri, K., Ediger, D., Jiang, K., Bader, D., Chavarria-Miranda, D.: A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. IPDPS (2009)","DOI":"10.2172\/951102"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Mahoney, M.W.: Randomized algorithms for matrices and data. Foundations and TrendsR in Machine Learning (2011)","DOI":"10.1201\/b11822-37"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. PNAS (2009)","DOI":"10.1073\/pnas.0803205106"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Newman, M.E.: Modularity and community structure in networks. PNAS (2006)","DOI":"10.1073\/pnas.0601602103"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. PRE (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. CIKM (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Satuluri, V., Parthasarathy, S., Ruan, Y.: Local graph sparsification for scalable clustering. SIGMOD (2011)","DOI":"10.1145\/1989323.1989399"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SICOMP (2011)","DOI":"10.1137\/080734029"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Wang, T., Chen, Y., Zhang, Z., Xu, T., Jin, L., Hui, P., Deng, B., Li, X.: Understanding graph sampling algorithms for social network analysis. ICDCSW (2011)","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Yang, J., Chen, Y.: Fast computing betweenness centrality with virtual nodes on large sparse networks. PloS (2011)","DOI":"10.1371\/journal.pone.0022557"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems (2015)","DOI":"10.1007\/s10115-013-0693-z"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. JSTOR (1977)","DOI":"10.1086\/jar.33.4.3629752"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50901-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T22:56:11Z","timestamp":1568588171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50901-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,30]]},"ISBN":["9783319509006","9783319509013"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50901-3_23","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2016,11,30]]}}}