{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T16:48:03Z","timestamp":1775926083642,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,13]]},"DOI":"10.1145\/3308558.3313471","type":"proceedings-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:17:59Z","timestamp":1557749879000},"page":"1909-1919","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning Resolution Parameters for Graph Clustering"],"prefix":"10.1145","author":[{"given":"Nate","family":"Veldt","sequence":"first","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758841"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_4_1","first-page":"651","volume-title":"Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Andersen Reid","year":"2008","unstructured":"Reid Andersen and Kevin Lang . 2008 . An Algorithm for Improving Graph Partitions . In Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008). 651 - 660 . Reid Andersen and Kevin Lang. 2008. An Algorithm for Improving Graph Partitions. In Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008). 651-660."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_6_1","volume-title":"Higher-order organization of complex networks. Science353, 6295","author":"Benson Austin R.","year":"2016","unstructured":"Austin R. Benson , David F. Gleich , and Jure Leskovec . 2016. Higher-order organization of complex networks. Science353, 6295 ( 2016 ), 163-166. arXiv:http:\/\/science.sciencemag.org\/content\/353\/6295\/163.full.pdf Austin R. Benson, David F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science353, 6295 (2016), 163-166. arXiv:http:\/\/science.sciencemag.org\/content\/353\/6295\/163.full.pdf"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Vincent D Blondel Jean-Loup Guillaume Renaud Lambiotte and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment2008 10(2008) P10008. http:\/\/stacks.iop.org\/1742-5468\/2008\/i=10\/a=P10008  Vincent D Blondel Jean-Loup Guillaume Renaud Lambiotte and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment2008 10(2008) P10008. http:\/\/stacks.iop.org\/1742-5468\/2008\/i=10\/a=P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.012"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746604"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0903215107"},{"key":"e_1_3_2_1_11_1","volume-title":"Community detection in graphs. Physics Reports486, 3","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato . 2010. Community detection in graphs. Physics Reports486, 3 ( 2010 ), 75 - 174. Santo Fortunato. 2010. Community detection in graphs. Physics Reports486, 3 (2010), 75 - 174."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Santo Fortunato and Darko Hric. 2016. Community detection in networks: A user guide. Physics Reports659(2016) 1 - 44. Community detection in networks: A user guide.  Santo Fortunato and Darko Hric. 2016. Community detection in networks: A user guide. Physics Reports659(2016) 1 - 44. Community detection in networks: A user guide.","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_3_2_1_14_1","first-page":"256","volume-title":"Proc. IEEE105","author":"Fountoulakis K.","year":"2017","unstructured":"K. Fountoulakis , D. F. Gleich , and M. W. Mahoney . 2017. An Optimization Approach to Locally-Biased Graph Algorithms . Proc. IEEE105 , 2 ( Feb 2017 ), 256 - 272 . K. Fountoulakis, D. F. Gleich, and M. W. Mahoney. 2017. An Optimization Approach to Locally-Biased Graph Algorithms. Proc. IEEE105, 2 (Feb 2017), 256-272."},{"key":"e_1_3_2_1_15_1","volume-title":"Correlation Clustering Generalized. In 29th International Symposium on Algorithms and Computation(ISAAC","volume":"123","author":"Gleich David F.","year":"2018","unstructured":"David F. Gleich , Nate Veldt , and Anthony Wirth . 2018 . Correlation Clustering Generalized. In 29th International Symposium on Algorithms and Computation(ISAAC 2018), Vol. 123 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 44:1-44:13. David F. Gleich, Nate Veldt, and Anthony Wirth. 2018. Correlation Clustering Generalized. In 29th International Symposium on Algorithms and Computation(ISAAC 2018), Vol. 123. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 44:1-44:13."},{"key":"e_1_3_2_1_16_1","unstructured":"Lucas G. S. Jeub Marya Bazzi Inderjit S. Jutla and Peter J. Mucha. 2011-2017. A generalized Louvain method for community detection implemented in MATLAB. http:\/\/netwiki.amath.unc.edu\/GenLouvain  Lucas G. S. Jeub Marya Bazzi Inderjit S. Jutla and Peter J. Mucha. 2011-2017. A generalized Louvain method for community detection implemented in MATLAB. http:\/\/netwiki.amath.unc.edu\/GenLouvain"},{"key":"e_1_3_2_1_17_1","volume-title":"Multiresolution Consensus Clustering in Networks. Scientific Reports8, 1","author":"Jeub Lucas G. S.","year":"2018","unstructured":"Lucas G. S. Jeub , Olaf Sporns , and Santo Fortunato . 2018. Multiresolution Consensus Clustering in Networks. Scientific Reports8, 1 ( 2018 ), 3259. Lucas G. S. Jeub, Olaf Sporns, and Santo Fortunato. 2018. Multiresolution Consensus Clustering in Networks. Scientific Reports8, 1 (2018), 3259."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623706"},{"key":"e_1_3_2_1_19_1","article-title":"Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities","author":"Lancichinetti Andrea","year":"2009","unstructured":"Andrea Lancichinetti and Santo Fortunato . 2009 . Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities . Phys. Rev. E80 (Jul 2009), 016118. Issue 1. Andrea Lancichinetti and Santo Fortunato. 2009. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E80 (Jul 2009), 016118. Issue 1.","journal-title":"Phys. Rev. E80"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44491-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_22_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_23_1","volume-title":"Finding community structure in networks using the eigenvectors of matrices. Physical review E74, 3","author":"Newman Mark EJ","year":"2006","unstructured":"Mark EJ Newman . 2006. Finding community structure in networks using the eigenvectors of matrices. Physical review E74, 3 ( 2006 ), 036104. Mark EJ Newman. 2006. Finding community structure in networks using the eigenvectors of matrices. Physical review E74, 3 (2006), 036104."},{"key":"e_1_3_2_1_24_1","volume-title":"Finding and evaluating community structure in networks. Physical review E69, 026113","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan . 2004. Finding and evaluating community structure in networks. Physical review E69, 026113 ( 2004 ). Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E69, 026113 (2004)."},{"key":"e_1_3_2_1_25_1","article-title":"Equivalence between modularity optimization and maximum likelihood methods for community detection","author":"Newman M. E. J.","year":"2016","unstructured":"M. E. J. Newman . 2016 . Equivalence between modularity optimization and maximum likelihood methods for community detection . Phys. Rev. E94 (Nov 2016), 052315. Issue 5. M. E. J. Newman. 2016. Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys. Rev. E94 (Nov 2016), 052315. Issue 5.","journal-title":"Phys. Rev. E94"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634168"},{"key":"e_1_3_2_1_27_1","volume-title":"The ground truth about metadata and community detection in networks. Science Advances3, 5","author":"Peel Leto","year":"2017","unstructured":"Leto Peel , Daniel B. Larremore , and Aaron Clauset . 2017. The ground truth about metadata and community detection in networks. Science Advances3, 5 ( 2017 ). arXiv:http:\/\/advances.sciencemag.org\/content\/3\/5\/e1602548.full.pdf Leto Peel, Daniel B. Larremore, and Aaron Clauset. 2017. The ground truth about metadata and community detection in networks. Science Advances3, 5 (2017). arXiv:http:\/\/advances.sciencemag.org\/content\/3\/5\/e1602548.full.pdf"},{"key":"e_1_3_2_1_28_1","volume-title":"Communities in networks. Notices of the AMS56, 9","author":"Porter Mason A","year":"2009","unstructured":"Mason A Porter , Jukka-Pekka Onnela , and Peter J Mucha . 2009. Communities in networks. Notices of the AMS56, 9 ( 2009 ), 1082-1097. Mason A Porter, Jukka-Pekka Onnela, and Peter J Mucha. 2009. Communities in networks. Notices of the AMS56, 9 (2009), 1082-1097."},{"key":"e_1_3_2_1_29_1","volume-title":"Statistical mechanics of community detection. Physical Review E74, 016110","author":"Reichardt J\u00f6rg","year":"2006","unstructured":"J\u00f6rg Reichardt and Stefan Bornholdt . 2006. Statistical mechanics of community detection. Physical Review E74, 016110 ( 2006 ). J\u00f6rg Reichardt and Stefan Bornholdt. 2006. Statistical mechanics of community detection. Physical Review E74, 016110 (2006)."},{"key":"e_1_3_2_1_30_1","unstructured":"Cameron Ruggles Nate Veldt and David Gleich. 2019. A Parallel Projection Method for Metric Constrained Optimization. arXiv preprint arXiv:1901.10084(2019).  Cameron Ruggles Nate Veldt and David Gleich. 2019. A Parallel Projection Method for Metric Constrained Optimization. arXiv preprint arXiv:1901.10084(2019)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_1_32_1","article-title":"Encoding dynamics for multiscale community detection: Markov time sweeping for the map equation","author":"Schaub Michael T.","year":"2012","unstructured":"Michael T. Schaub , Renaud Lambiotte , and Mauricio Barahona . 2012 . Encoding dynamics for multiscale community detection: Markov time sweeping for the map equation . Phys. Rev. E86 (Aug 2012), 026112. Issue 2. Michael T. Schaub, Renaud Lambiotte, and Mauricio Barahona. 2012. Encoding dynamics for multiscale community detection: Markov time sweeping for the map equation. Phys. Rev. E86 (Aug 2012), 026112. Issue 2.","journal-title":"Phys. Rev. E86"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/080744888"},{"key":"e_1_3_2_1_34_1","volume-title":"Porter","author":"Traud Amanda L.","year":"2012","unstructured":"Amanda L. Traud , Peter J. Mucha , and Mason A . Porter . 2012 . Social structure of Facebook networks. Physica A: Statistical Mechanics and its Applications 391, 16(2012), 4165-4180. Amanda L. Traud, Peter J. Mucha, and Mason A. Porter. 2012. Social structure of Facebook networks. Physica A: Statistical Mechanics and its Applications391, 16(2012), 4165-4180."},{"key":"e_1_3_2_1_35_1","first-page":"1938","volume-title":"Proceedings of The 33rd International Conference on Machine Learning(ICML","volume":"48","author":"Veldt Nate","year":"2016","unstructured":"Nate Veldt , David Gleich , and Michael Mahoney . 2016 . A Simple and Strongly-Local Flow-Based Method for Cut Improvement . In Proceedings of The 33rd International Conference on Machine Learning(ICML 2016), Vol. 48 . PMLR, New York, New York, USA , 1938 - 1947 . http:\/\/proceedings.mlr.press\/v48\/veldt16.html Nate Veldt, David Gleich, and Michael Mahoney. 2016. A Simple and Strongly-Local Flow-Based Method for Cut Improvement. In Proceedings of The 33rd International Conference on Machine Learning(ICML 2016), Vol. 48. PMLR, New York, New York, USA, 1938-1947. http:\/\/proceedings.mlr.press\/v48\/veldt16.html"},{"key":"e_1_3_2_1_36_1","unstructured":"Nate Veldt David Gleich Anthony Wirth and James Saunderson. 2018. A Projection Method for Metric-Constrained Optimization. arXiv preprint arXiv:1806.01678(2018).  Nate Veldt David Gleich Anthony Wirth and James Saunderson. 2018. A Projection Method for Metric-Constrained Optimization. arXiv preprint arXiv:1806.01678(2018)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186110"},{"key":"e_1_3_2_1_38_1","volume-title":"Gleich","author":"Veldt Nate","year":"2019","unstructured":"Nate Veldt , Christine Klymko , and David F . Gleich . 2019 . Flow-Based Local Graph Clustering with Better Seed Set Inclusion. In Proceedings of the 2019 SIAM International Conference on Data Mining. Nate Veldt, Christine Klymko, and David F. Gleich. 2019. Flow-Based Local Graph Clustering with Better Seed Set Inclusion. In Proceedings of the 2019 SIAM International Conference on Data Mining."},{"key":"e_1_3_2_1_39_1","first-page":"3598","volume-title":"Proceedings of the 34th International Conference on Machine Learning(ICML 2017)","volume":"70","author":"Wang Di","year":"2017","unstructured":"Di Wang , Kimon Fountoulakis , Monika Henzinger , Michael W. Mahoney , and Satish Rao . 2017 . Capacity Releasing Diffusion for Speed and Locality . In Proceedings of the 34th International Conference on Machine Learning(ICML 2017) , Vol. 70 . PMLR, International Convention Centre, Sydney, Australia , 3598 - 3607 . http:\/\/proceedings.mlr.press\/v70\/wang17b.html Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, and Satish Rao. 2017. Capacity Releasing Diffusion for Speed and Locality. In Proceedings of the 34th International Conference on Machine Learning(ICML 2017), Vol. 70. PMLR, International Convention Centre, Sydney, Australia, 3598-3607. http:\/\/proceedings.mlr.press\/v70\/wang17b.html"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830252.1830257"}],"event":{"name":"WWW '19: The Web Conference","location":"San Francisco CA USA","acronym":"WWW '19","sponsor":["IW3C2 International World Wide Web Conference Committee"]},"container-title":["The World Wide Web Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313471","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308558.3313471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:17Z","timestamp":1750208537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":42,"alternative-id":["10.1145\/3308558.3313471","10.1145\/3308558"],"URL":"https:\/\/doi.org\/10.1145\/3308558.3313471","relation":{},"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"2019-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}