{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:24:58Z","timestamp":1762917898372,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":9,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Australian Research Council"},{"name":"Sloan Foundation"},{"name":"DARPA","award":["SIMPLEX"],"award-info":[{"award-number":["SIMPLEX"]}]},{"name":"NSF","award":["CCF-093937","CCF-1149756","IIS-154648"],"award-info":[{"award-number":["CCF-093937","CCF-1149756","IIS-154648"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186110","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"439-448","source":"Crossref","is-referenced-by-count":45,"title":["A Correlation Clustering Framework for Community Detection"],"prefix":"10.1145","author":[{"given":"Nate","family":"Veldt","sequence":"first","affiliation":[{"name":"Purdue University, Lafayette, IN, USA"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, Lafayette, IN, USA"}]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[{"name":"University of Melbourne, Melbourne, Australia"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186110-1","doi-asserted-by":"crossref","unstructured":"Nir Ailon, Moses Charikar, and Alantha Newman. 2008. Aggregating inconsistent information: ranking and clustering. Journal of the ACM (JACM) Vol. 55, 5 (2008), 23.","DOI":"10.1145\/1411509.1411513"},{"key":"key-10.1145\/3178876.3186110-2","doi-asserted-by":"crossref","unstructured":"Sanjeev Arora, Satish Rao, and Umesh Vazirani. 2009. Expander flows, geometric embeddings and graph partitioning. Journal of the ACM (JACM) Vol. 56, 2 (2009).","DOI":"10.1145\/1502793.1502794"},{"key":"key-10.1145\/3178876.3186110-3","unstructured":"Shai Bagon and Meirav Galun. 2011. Large Scale Correlation Clustering Optimization. arXiv Vol. cs.CV (2011), 1112.2903."},{"key":"key-10.1145\/3178876.3186110-4","doi-asserted-by":"crossref","unstructured":"Nikhil Bansal, Avrim Blum, and Shuchi Chawla. 2004. Correlation Clustering. Machine Learning Vol. 56 (2004), 89--113.","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"key-10.1145\/3178876.3186110-5","doi-asserted-by":"crossref","unstructured":"Albert-L&#225;szl&#243; Barab&#225;si and R&#233;ka Albert. 1999. Emergence of Scaling in Random Networks. Science Vol. 286, 5439 (1999), 509--512. doi.org\/10.1007\/978--3--540--87481--2_3\"","DOI":"10.1126\/science.286.5439.509"},{"key":"key-10.1145\/3178876.3186110-6","unstructured":"Assaf Natanzon, Ron Shamir, and Roded Sharan. 1999. Complexity classification of some edge modification problems International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 65--77."},{"key":"key-10.1145\/3178876.3186110-7","doi-asserted-by":"crossref","unstructured":"Mark EJ Newman. 2006. Finding community structure in networks using the eigenvectors of matrices. Physical review E Vol. 74, 3 (2006), 036104.","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"key-10.1145\/3178876.3186110-8","doi-asserted-by":"crossref","unstructured":"Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E Vol. 69, 026113 (2004).","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"key-10.1145\/3178876.3186110-9","doi-asserted-by":"crossref","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). https:\/\/doi.org\/10.1126\/sciadv.1602548","DOI":"10.1126\/sciadv.1602548"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186110&ftid=1957525&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:28Z","timestamp":1750212688000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186110"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186110","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}