{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:06:06Z","timestamp":1743120366523,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319928708"},{"type":"electronic","value":"9783319928715"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-92871-5_11","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T05:51:15Z","timestamp":1527573075000},"page":"170-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Statistical Performance Analysis of Graph Clustering Algorithms"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Miasnikof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander Y.","family":"Shestopaloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony J.","family":"Bonner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Lawryshyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-23780-5_13","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H\u00e9lio Almeida","year":"2011","unstructured":"Almeida, H.M., Guedes, D.O., Meira Jr., W., Zaki, M.J.: Is there a best quality metric for graph clusters? In: Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2011, Athens, Greece, 5\u20139 September 2011, Proceedings, Part I, pp. 44\u201359 (2011)"},{"key":"11_CR2","unstructured":"Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., Ruiz, M.: Modularity maximization in networks by variable neighborhood search. In: Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D. (eds.) Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, 13\u201314 February 2012, Proceedings, pp. 113\u2013128 (2012). \n                    http:\/\/www.ams.org\/books\/conm\/588\/11705"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2016.11.011","volume":"71","author":"Anupam Biswas","year":"2017","unstructured":"Biswas, A., Biswas, B.: Defining quality metrics for graph clustering evaluation. Expert Syst. Appl. 71, 1\u201317 (2017). \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417416306339","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172\u2013188 (2008). \n                    https:\/\/doi.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Preprint 70(6), 066111 (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Creusefond, J., Largillier, T., Peyronnet, S.: On the evaluation potential of quality functions in community detection for different contexts. ArXiv e-prints, October 2015","DOI":"10.1007\/978-3-319-28361-6_9"},{"key":"11_CR7","unstructured":"Djidjev, H., Onus, M.: Using graph partitioning for efficient network modularity optimization. In: Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D. (eds.) Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, 13\u201314 February 2012, Proceedings, pp. 103\u2013112 (2012). \n                    http:\/\/www.ams.org\/books\/conm\/588\/11713"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S. Fortunato","year":"2006","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. Proc. Nat. Acad. Sci. 104(1), 36\u201341 (2007). \n                    http:\/\/www.pnas.org\/content\/104\/1\/36.abstract","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/2980765.2980770","volume":"18","author":"Lawrence B. Holder","year":"2016","unstructured":"Holder, L.B., Caceres, R., Gleich, D.F., Riedy, J., Khan, M., Chawla, N.V., Kumar, R., Wu, Y., Klymko, C., Eliassi-Rad, T., Prakash, A.: Current and future challenges in mining large networks: report on the second SDM workshop on mining networks and graphs. SIGKDD Explor. Newsl. 18(1), 39\u201345 (2016). \n                    http:\/\/doi.acm.org\/10.1145\/2980765.2980770","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"11_CR11","unstructured":"Huang, H., Liu, Y., Hayes, D., Nobel, A., Marron, J., Hennig, C.: (15) Significance testing in clustering. In: Hennig, C., Meila, M., Murtagh, F., Rocci, R. (eds.) Handbook of Cluster Analysis, pp. 315\u2013335. Chapman and Hall\/CRC (2015)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 78, 046110 (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Mahoney, M.W.: Empirical comparison of algorithms for network community detection. ArXiv e-prints, April 2010","DOI":"10.1145\/1772690.1772755"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: 7th International Conference on WWW (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Morvan, A., Choromanski, K., Gouy-Pailler, C., Atif, J.: Graph sketching-based massive data clustering. In: SIAM International Conference on Data Mining (SDM 2018) (2018, to appear)","DOI":"10.1137\/1.9781611975321.2"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1186\/1756-0500-4-549","volume":"4","author":"Charalampos N Moschopoulos","year":"2011","unstructured":"Moschopoulos, C.N., Pavlopoulos, G.A., Iacucci, E., Aerts, J., Likothanassis, S., Schneider, R., Kossida, S.: Which clustering algorithm is better for predicting protein complexes? BMC Res. Notes 4(1), 549 (2011), \n                    https:\/\/doi.org\/10.1186\/1756-0500-4-549","journal-title":"BMC Research Notes"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 69, 026113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-49787-7_10","volume-title":"Algorithms and Models for the Web Graph","author":"L Ostroumova Prokhorenkova","year":"2016","unstructured":"Ostroumova Prokhorenkova, L., Pra\u0142at, P., Raigorodskii, A.: Modularity of complex networks models. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) Algorithms and Models for the Web Graph, pp. 115\u2013126. Springer, Cham (2016)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.endm.2017.07.058","volume":"61","author":"Liudmila Ostroumova Prokhorenkova","year":"2017","unstructured":"Ostroumova Prokhorenkova, L., Pra\u0142at, P., Raigorodskii, A.: Modularity in several random graph models. Electron. Notes Discrete Math. 61, 947\u2013953 (2017). \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065317302238\n                    \n                  . The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2017)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1-2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.physd.2006.09.009","volume":"224","author":"J\u00f6rg Reichardt","year":"2006","unstructured":"Reichardt, J., Bornholdt, S.: When are networks truly modular? Physica D Nonlinear Phenom. 224(1), 20\u201326 (2006). \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167278906003678\n                    \n                  . Dynamics on Complex Networks and Applications","journal-title":"Physica D: Nonlinear Phenomena"},{"key":"11_CR21","unstructured":"Sanders, P., Schulz, C.: High quality graph partitioning. In: Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D. (eds.) Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, 13\u201314 February 2012, Proceedings, pp. 1\u201318 (2012). \n                    http:\/\/www.ams.org\/books\/conm\/588\/11700"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/080744888","volume":"42","author":"DA Spielman","year":"2013","unstructured":"Spielman, D.A., Teng, S.H.: A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM J. Comput. 42(1), 1\u201326 (2013)","journal-title":"SIAM J. Comput."},{"key":"11_CR23","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. CoRR abs\/1205.6233 (2012). \n                    http:\/\/arxiv.org\/abs\/1205.6233"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: WSDM 2013. ACM, 978-1-4503-1869-3\/13\/02 (2013)","DOI":"10.1145\/2433396.2433471"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92871-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:58:32Z","timestamp":1558324712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92871-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319928708","9783319928715"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92871-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"30 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.ryerson.ca\/waw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}