{"id":"https://openalex.org/W2114432090","doi":"https://doi.org/10.4230/lipics.stacs.2010.2486","title":"Online Correlation Clustering","display_name":"Online Correlation Clustering","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2114432090","doi":"https://doi.org/10.4230/lipics.stacs.2010.2486","mag":"2114432090"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:2486","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2486","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00455771","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054015649","display_name":"Cla Ire Mathieu","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mathieu, Claire","raw_affiliation_strings":["Brown University, Providence, United States"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, United States","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059019724","display_name":"Ocan Sankur","orcid":"https://orcid.org/0000-0001-8146-4429"},"institutions":[{"id":"https://openalex.org/I4210103330","display_name":"\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/01dp7jr64","country_code":"BI","type":"education","lineage":["https://openalex.org/I4210103330"]}],"countries":["BI"],"is_corresponding":false,"raw_author_name":"Sankur, Ocan","raw_affiliation_strings":["\u00c9cole Normale Sup\u00e9rieure, Par\u00eds"],"affiliations":[{"raw_affiliation_string":"\u00c9cole Normale Sup\u00e9rieure, Par\u00eds","institution_ids":["https://openalex.org/I4210103330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079220724","display_name":"Warren Schudy","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Schudy, Warren","raw_affiliation_strings":["Brown University, Providence, United States"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, United States","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054015649"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":1.8627,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.86886307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"573","last_page":"584"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8592350482940674},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.7325391173362732},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7169893980026245},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6297701597213745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6044613718986511},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5518617033958435},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5133184790611267},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5116129517555237},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.46333375573158264},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.44414329528808594},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.43749701976776123},{"id":"https://openalex.org/keywords/k-medians-clustering","display_name":"k-medians clustering","score":0.4315229058265686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3804905116558075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34293270111083984},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24334925413131714},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.09566846489906311},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.0854010283946991}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8592350482940674},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.7325391173362732},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7169893980026245},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6297701597213745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6044613718986511},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5518617033958435},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5133184790611267},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5116129517555237},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.46333375573158264},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.44414329528808594},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.43749701976776123},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.4315229058265686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3804905116558075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34293270111083984},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24334925413131714},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.09566846489906311},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0854010283946991},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:2486","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2486","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.185.4317","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.4317","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/people/claire/Publis/MSS-stacs10-long.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00455771v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00455771","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.573-584","raw_type":"Conference papers"},{"id":"mag:2114432090","is_oa":false,"landing_page_url":"http://cs.brown.edu/people/claire/Publis/MSS-stacs10-long.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306421002","display_name":"Symposium on Theoretical Aspects of Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science","raw_type":null},{"id":"doi:10.4230/lipics.stacs.2010.2486","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2010.2486","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00455771v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00455771","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.573-584","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7931630482","display_name":"Designing Approximation Schemes","funder_award_id":"0728816","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1985875030","https://openalex.org/W2016973429","https://openalex.org/W2107223449","https://openalex.org/W2112220279","https://openalex.org/W2113239207","https://openalex.org/W2117654132","https://openalex.org/W2124037793","https://openalex.org/W2146081992","https://openalex.org/W2154785834","https://openalex.org/W2167372977","https://openalex.org/W2611831635","https://openalex.org/W2914959486","https://openalex.org/W3036999547"],"related_works":["https://openalex.org/W2914959486","https://openalex.org/W2611831635","https://openalex.org/W2113239207","https://openalex.org/W2091858563","https://openalex.org/W2016973429","https://openalex.org/W1985875030","https://openalex.org/W2066449891","https://openalex.org/W3036999547","https://openalex.org/W2071234528","https://openalex.org/W2017732166","https://openalex.org/W1976011284","https://openalex.org/W2403855565","https://openalex.org/W1487754206","https://openalex.org/W1970730908","https://openalex.org/W1697684871","https://openalex.org/W2225844283","https://openalex.org/W2141437040","https://openalex.org/W2118665727","https://openalex.org/W2066682058","https://openalex.org/W2041439319"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,29,67,74,77,93,100,103,108],"online":[3,12,115],"clustering":[4,18,75,101],"problem":[5],"where":[6],"data":[7,20],"items":[8,21,36],"arrive":[9],"in":[10],"an":[11],"fashion.":[13],"The":[14,53],"algorithm":[15,54,85,110,116,137],"maintains":[16],"a":[17,57,82,135,143],"of":[19,27],"into":[22],"similarity":[23],"classes.":[24],"Upon":[25],"arrival":[26],"v,":[28],"relation":[30],"between":[31,73,99],"v":[32,48,61],"and":[33,62,76,88,102],"previously":[34],"arrived":[35],"is":[37,49,69,86,90,95,111,126],"revealed,":[38],"so":[39],"that":[40,81,107,113,124],"for":[41,60,142],"each":[42],"u":[43],"we":[44,79,105,122],"are":[45],"told":[46],"whether":[47],"similar":[50],"to":[51,70,96,128],"u.":[52],"can":[55,117],"create":[56],"new":[58],"luster":[59],"merge":[63],"existing":[64],"clusters.":[65],"When":[66,92],"objective":[68,94],"minimize":[71],"disagreements":[72],"input,":[78,104],"prove":[80,106,123],"natural":[83],"greedy":[84,109],"O(n)-competitive,":[87],"this":[89],"optimal.":[91],"maximize":[97],"agreements":[98],".5-competitive;":[112],"no":[114],"be":[118],"better":[119,130],"than":[120,131],".834-competitive;":[121],"it":[125],"possible":[127],"get":[129],"1/2,":[132],"by":[133],"exhibiting":[134],"randomized":[136],"with":[138],"competitive":[139],"ratio":[140],".5+c":[141],"small":[144],"positive":[145],"fixed":[146],"constant":[147],"c.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}