{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:03:33Z","timestamp":1755839013968,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Melbourne School of Engineering"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1546488, CCF-1909528, CCF-0939370"],"award-info":[{"award-number":["IIS-1546488, CCF-1909528, CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DESC0014543"],"award-info":[{"award-number":["DESC0014543"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NASA"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403238","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:03:59Z","timestamp":1597964639000},"page":"1868-1876","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs"],"prefix":"10.1145","author":[{"given":"Nate","family":"Veldt","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Beyond Pairwise Clustering (CVPR '05)","author":"Agarwal Sameer","year":"2005","unstructured":"Sameer Agarwal , Jongwoo Lim , Lihi Zelnik-Manor , Pietro Perona , David Kriegman , and Serge Belongie . 2005 . Beyond Pairwise Clustering (CVPR '05) . Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pietro Perona, David Kriegman, and Serge Belongie. 2005. Beyond Pairwise Clustering (CVPR '05)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1137\/110848712"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1411509.1411513"},{"unstructured":"Ilya Amburg Nate Veldt and Austin R Benson. Clustering in graphs and hypergraphs with categorical edge labels (WWW '20).  Ilya Amburg Nate Veldt and Austin R Benson. Clustering in graphs and hypergraphs with categorical edge labels (WWW '20).","key":"e_1_3_2_1_4_1"},{"volume-title":"The bicluster graph editing problem. Master's thesis","author":"Amit Noga","unstructured":"Noga Amit . 2004. The bicluster graph editing problem. Master's thesis . Tel Aviv University . Noga Amit. 2004. The bicluster graph editing problem. Master's thesis. Tel Aviv University.","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1088\/1751-8113\/41\/22\/224001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1088\/1367-2630\/10\/5\/053039"},{"unstructured":"M. Asteris A. Kyrillidis D. Papailiopoulos and A. Dimakis. Bipartite correlation clustering: Maximizing agreements (AISTATS '16).  M. Asteris A. Kyrillidis D. Papailiopoulos and A. Dimakis. Bipartite correlation clustering: Maximizing agreements (AISTATS '16).","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_10_1","volume-title":"Science","volume":"353","author":"Benson Austin R.","year":"2016","unstructured":"Austin R. Benson , David F. Gleich , and Jure Leskovec . 2016 . Higher-order organization of complex networks . Science , Vol. 353 , 6295 (2016), 163--166. Austin R. Benson, David F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science, Vol. 353, 6295 (2016), 163--166."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1137\/060653391"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/71.780863"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1016\/j.jcss.2004.10.012"},{"doi-asserted-by":"crossref","unstructured":"Shuchi Chawla Konstantin Makarychev Tselil Schramm and Grigory Yaroslavtsev. 2015. Near optimal LP rounding algorithm for correlation clustering on complete and complete k-partite graphs (STOC '15). ACM.  Shuchi Chawla Konstantin Makarychev Tselil Schramm and Grigory Yaroslavtsev. 2015. Near optimal LP rounding algorithm for correlation clustering on complete and complete k-partite graphs (STOC '15). ACM.","key":"e_1_3_2_1_15_1","DOI":"10.1145\/2746539.2746604"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1073\/pnas.0903215107"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.tcs.2006.05.008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/TPAMI.2007.1115"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1073\/pnas.0605965104"},{"doi-asserted-by":"crossref","unstructured":"Takuro Fukunaga. 2018. LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. In Computing and Combinatorics .  Takuro Fukunaga. 2018. LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. In Computing and Combinatorics .","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-319-94776-1_5"},{"key":"e_1_3_2_1_21_1","volume-title":"Correlation Clustering Generalized (ISAAC","author":"Gleich David F.","year":"2018","unstructured":"David F. Gleich , Nate Veldt , and Anthony Wirth . 2018. Correlation Clustering Generalized (ISAAC 2018 ). David F. Gleich, Nate Veldt, and Anthony Wirth. 2018. Correlation Clustering Generalized (ISAAC 2018)."},{"doi-asserted-by":"crossref","unstructured":"J. Gong and Sung Kyu Lim. 1998. Multiway partitioning with pairwise movement (ICAD '98).  J. Gong and Sung Kyu Lim. 1998. Multiway partitioning with pairwise movement (ICAD '98).","key":"e_1_3_2_1_22_1","DOI":"10.1145\/288548.289079"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/43.144852"},{"unstructured":"Matthias Hein Simon Setzer Leonardo Jost and Syama Sundar Rangapuram. 2013. The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited (NIPS'13).  Matthias Hein Simon Setzer Leonardo Jost and Syama Sundar Rangapuram. 2013. The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited (NIPS'13).","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","article-title":"Modeling Hypergraphs by Graphs with the Same Mincut","volume":"45","author":"Ihler Edmund","year":"1993","unstructured":"Edmund Ihler , Dorothea Wagner , and Frank Wagner . 1993 . Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. , Vol. 45 , 4 (1993). Edmund Ihler, Dorothea Wagner, and Frank Wagner. 1993. Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett., Vol. 45, 4 (1993).","journal-title":"Properties. Inf. Process. Lett."},{"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. (2011--2017). 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. (2011--2017). http:\/\/netwiki.amath.unc.edu\/GenLouvain","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","volume-title":"Clustering via hypergraph modularity. PloS one","author":"Kami'nski Bogumi\u0142","year":"2019","unstructured":"Bogumi\u0142 Kami'nski , Val\u00e9rie Poulin , Pawe\u0142 Pra\u0142at , Przemys\u0142aw Szufel , and Francc ois Th\u00e9berge . 2019. Clustering via hypergraph modularity. PloS one , Vol. 14 , 11 ( 2019 ). Bogumi\u0142 Kami'nski, Val\u00e9rie Poulin, Pawe\u0142 Pra\u0142at, Przemys\u0142aw Szufel, and Francc ois Th\u00e9berge. 2019. Clustering via hypergraph modularity. PloS one, Vol. 14, 11 (2019)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_29_1","volume-title":"Multilevel K-way Hypergraph Partitioning (DAC '99)","author":"Karypis George","year":"1999","unstructured":"George Karypis and Vipin Kumar . 1999 . Multilevel K-way Hypergraph Partitioning (DAC '99) . ACM, 343--348. George Karypis and Vipin Kumar. 1999. Multilevel K-way Hypergraph Partitioning (DAC '99). ACM, 343--348."},{"key":"e_1_3_2_1_30_1","volume-title":"Yoo","author":"Kim Sungwoong","year":"2011","unstructured":"Sungwoong Kim , Sebastian Nowozin , Pushmeet Kohli , and Chang D . Yoo . 2011 . Higher-Order Correlation Clustering for Image Segmentation (NIPS '11). Sungwoong Kim, Sebastian Nowozin, Pushmeet Kohli, and Chang D. Yoo. 2011. Higher-Order Correlation Clustering for Image Segmentation (NIPS '11)."},{"volume-title":"The Second ASE International Conference on Big Data Science and Computing, BigDataScience .","author":"Klymko Christine","unstructured":"Christine Klymko , David F. Gleich , and Tamara G. Kolda . 2014. Using Triangles to Improve Community Detection in Directed Networks . In The Second ASE International Conference on Big Data Science and Computing, BigDataScience . Christine Klymko, David F. Gleich, and Tamara G. Kolda. 2014. Using Triangles to Improve Community Detection in Directed Networks. In The Second ASE International Conference on Big Data Science and Computing, BigDataScience .","key":"e_1_3_2_1_31_1"},{"volume-title":"A New Measure of Modularity in Hypergraphs: Theoretical Insights and Implications for Effective Clustering","author":"Kumar Tarun","unstructured":"Tarun Kumar , Sankaran Vaidyanathan , Harini Ananthapadmanabhan , Srinivasan Parthasarathy , and Balaraman Ravindran . 2020. A New Measure of Modularity in Hypergraphs: Theoretical Insights and Implications for Effective Clustering . In Complex Networks and Their Applications VIII. Springer International Publishing . Tarun Kumar, Sankaran Vaidyanathan, Harini Ananthapadmanabhan, Srinivasan Parthasarathy, and Balaraman Ravindran. 2020. A New Measure of Modularity in Hypergraphs: Theoretical Insights and Implications for Effective Clustering. In Complex Networks and Their Applications VIII. Springer International Publishing.","key":"e_1_3_2_1_32_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/1217299.1217301"},{"doi-asserted-by":"crossref","unstructured":"Pan Li H. Dau Gregory J. Puleo and Olgica Milenkovic. 2017. Motif clustering and overlapping clustering for social network analysis (INFOCOM '17). 1--9.  Pan Li H. Dau Gregory J. Puleo and Olgica Milenkovic. 2017. Motif clustering and overlapping clustering for social network analysis (INFOCOM '17). 1--9.","key":"e_1_3_2_1_34_1","DOI":"10.1109\/INFOCOM.2017.8056956"},{"key":"e_1_3_2_1_35_1","volume-title":"Inhomogeneous Hypergraph Clustering with Applications (NIPS '17)","author":"Li Pan","year":"2017","unstructured":"Pan Li and Olgica Milenkovic . 2017 . Inhomogeneous Hypergraph Clustering with Applications (NIPS '17) . 2308--2318. Pan Li and Olgica Milenkovic. 2017. Inhomogeneous Hypergraph Clustering with Applications (NIPS '17). 2308--2318."},{"key":"e_1_3_2_1_36_1","volume-title":"Cheeger Inequalities and Spectral Clustering (ICML '18)","author":"Li Pan","year":"2018","unstructured":"Pan Li and Olgica Milenkovic . 2018 . Submodular Hypergraphs: p-Laplacians , Cheeger Inequalities and Spectral Clustering (ICML '18) . 3020--3029. Pan Li and Olgica Milenkovic. 2018. Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering (ICML '18). 3020--3029."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1109\/TIT.2019.2940246"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1103\/PhysRevE.86.056111"},{"key":"e_1_3_2_1_39_1","volume-title":"Finding and evaluating community structure in networks. Physical review E","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan . 2004. Finding and evaluating community structure in networks. Physical review E , Vol. 69 , 026113 ( 2004 ). Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E, Vol. 69, 026113 (2004)."},{"unstructured":"Jianmo Ni Jiacheng Li and Julian McAuley. 2019. Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects (EMNLP-IJCNLP '19). 188--197.  Jianmo Ni Jiacheng Li and Julian McAuley. 2019. Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects (EMNLP-IJCNLP '19). 188--197.","key":"e_1_3_2_1_40_1"},{"key":"e_1_3_2_1_41_1","volume-title":"Science Advances","volume":"3","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 Advances , Vol. 3 , 5 (2017). Leto Peel, Daniel B. Larremore, and Aaron Clauset. 2017. The ground truth about metadata and community detection in networks. Science Advances, Vol. 3, 5 (2017)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1109\/TIT.2018.2819696"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1103\/PhysRevLett.93.218701"},{"unstructured":"Cameron Ruggles Nate Veldt and David F. Gleich. A Parallel Projection Method for Metric Constrained Optimization (SIAM CSC '20).  Cameron Ruggles Nate Veldt and David F. Gleich. A Parallel Projection Method for Metric Constrained Optimization (SIAM CSC '20).","key":"e_1_3_2_1_44_1"},{"key":"e_1_3_2_1_45_1","volume-title":"Graph clustering. Computer Science Review","author":"Schaeffer Satu Elisa","year":"2007","unstructured":"Satu Elisa Schaeffer . 2007. Graph clustering. Computer Science Review ( 2007 ). Satu Elisa Schaeffer. 2007. Graph clustering. Computer Science Review (2007)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.5555\/1704842.1705056"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_48_1","volume-title":"Gilbert","author":"Sonthalia Rishi","year":"2020","unstructured":"Rishi Sonthalia and Anna C . Gilbert . 2020 . Project and Forget: Solving Large-Scale Metric Constrained Problems . (2020). arxiv: cs.LG\/2005.03853 Rishi Sonthalia and Anna C. Gilbert. 2020. Project and Forget: Solving Large-Scale Metric Constrained Problems. (2020). arxiv: cs.LG\/2005.03853"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.1093\/bioinformatics\/btp467"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1103\/PhysRevE.84.016114"},{"key":"e_1_3_2_1_51_1","volume-title":"Scalable Motif-aware Graph Clustering (WWW '17)","author":"Tsourakakis Charalampos E.","year":"2017","unstructured":"Charalampos E. Tsourakakis , Jakub Pachocki , and Michael Mitzenmacher . 2017 . Scalable Motif-aware Graph Clustering (WWW '17) . 1451--1460. Charalampos E. Tsourakakis, Jakub Pachocki, and Michael Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering (WWW '17). 1451--1460."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1287\/moor.1090.0385"},{"key":"e_1_3_2_1_53_1","volume-title":"Austin R. Benson, and Jon Kleinberg","author":"Veldt Nate","year":"2020","unstructured":"Nate Veldt , Austin R. Benson, and Jon Kleinberg . 2020 . Hypergraph Cuts with General Splitting Functions . (2020). arxiv: cs.DS\/2001.02817 Nate Veldt, Austin R. Benson, and Jon Kleinberg. 2020. Hypergraph Cuts with General Splitting Functions. (2020). arxiv: cs.DS\/2001.02817"},{"doi-asserted-by":"crossref","unstructured":"Nate Veldt David F. Gleich and Anthony Wirth. 2018. A Correlation Clustering Framework for Community Detection (WWW '18). 439--448.  Nate Veldt David F. Gleich and Anthony Wirth. 2018. A Correlation Clustering Framework for Community Detection (WWW '18). 439--448.","key":"e_1_3_2_1_54_1","DOI":"10.1145\/3178876.3186110"},{"key":"e_1_3_2_1_55_1","volume-title":"Learning Resolution Parameters for Graph Clustering (WWW '19)","author":"Veldt Nate","year":"2019","unstructured":"Nate Veldt , David F. Gleich , and Anthony Wirth . 2019 a . Learning Resolution Parameters for Graph Clustering (WWW '19) . Nate Veldt, David F. Gleich, and Anthony Wirth. 2019 a. Learning Resolution Parameters for Graph Clustering (WWW '19)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_56_1","DOI":"10.1137\/18M1217152"},{"key":"e_1_3_2_1_57_1","volume-title":"Gleich","author":"Veldt Nate","year":"2020","unstructured":"Nate Veldt , Anthony Wirth , and David F . Gleich . 2020 . Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs . (2020). arxiv: cs.DS\/2002.09460 Nate Veldt, Anthony Wirth, and David F. Gleich. 2020. Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs. (2020). arxiv: cs.DS\/2002.09460"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1103\/PhysRevE.97.052306"},{"key":"e_1_3_2_1_59_1","volume-title":"Jure Leskovec, and David F Gleich.","author":"Yin Hao","year":"2017","unstructured":"Hao Yin , Austin R Benson , Jure Leskovec, and David F Gleich. 2017 . Local higher-order graph clustering (KDD '17). 555--564. Hao Yin, Austin R Benson, Jure Leskovec, and David F Gleich. 2017. Local higher-order graph clustering (KDD '17). 555--564."},{"unstructured":"Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2006. Learning with Hypergraphs: Clustering Classification and Embedding (NIPS '06).  Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2006. Learning with Hypergraphs: Clustering Classification and Embedding (NIPS '06).","key":"e_1_3_2_1_60_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_61_1","DOI":"10.1109\/43.784130"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '20","name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA"},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403238","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403238","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:47Z","timestamp":1750197707000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":61,"alternative-id":["10.1145\/3394486.3403238","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403238","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}