{"id":"https://openalex.org/W3094154915","doi":"https://doi.org/10.1145/3340531.3411896","title":"Semi-Supervised Max-Sum Clustering","display_name":"Semi-Supervised Max-Sum Clustering","publication_year":2020,"publication_date":"2020-10-19","ids":{"openalex":"https://openalex.org/W3094154915","doi":"https://doi.org/10.1145/3340531.3411896","mag":"3094154915"},"language":"en","primary_location":{"id":"doi:10.1145/3340531.3411896","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3340531.3411896","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3340531.3411896","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Conference on Information & Knowledge Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3340531.3411896","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015971004","display_name":"Konstantin Voevodski","orcid":"https://orcid.org/0000-0002-7518-8242"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Konstantin Voevodski","raw_affiliation_strings":["Google, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Google, Boston, MA, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015971004"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":0.136,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56808719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1495","last_page":"1504"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7647010087966919},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6471192836761475},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6416175365447998},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.566226065158844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5342879295349121},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5330891013145447},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.47861045598983765},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4511309862136841},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3927488923072815},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.36849579215049744},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.338372141122818},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29924434423446655},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.0706060528755188}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7647010087966919},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6471192836761475},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6416175365447998},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.566226065158844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5342879295349121},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5330891013145447},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.47861045598983765},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4511309862136841},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3927488923072815},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.36849579215049744},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.338372141122818},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29924434423446655},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0706060528755188},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3340531.3411896","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3340531.3411896","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3340531.3411896","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Conference on Information & Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3340531.3411896","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3340531.3411896","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3340531.3411896","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Conference on Information & Knowledge Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3094154915.pdf","grobid_xml":"https://content.openalex.org/works/W3094154915.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1596524570","https://openalex.org/W1970630090","https://openalex.org/W1981409633","https://openalex.org/W2028270345","https://openalex.org/W2095293504","https://openalex.org/W2096100960","https://openalex.org/W2097876388","https://openalex.org/W2097979671","https://openalex.org/W2102524069","https://openalex.org/W2103012681","https://openalex.org/W2109726592","https://openalex.org/W2128366083","https://openalex.org/W2137172591","https://openalex.org/W2153839362","https://openalex.org/W2158249114","https://openalex.org/W2169495281","https://openalex.org/W2187617524","https://openalex.org/W2208773343","https://openalex.org/W2293520785","https://openalex.org/W2613497313","https://openalex.org/W2704180839","https://openalex.org/W2802145570","https://openalex.org/W2951430799","https://openalex.org/W2962845353","https://openalex.org/W2962948336","https://openalex.org/W2963411648","https://openalex.org/W3036999547","https://openalex.org/W3100188304","https://openalex.org/W3120740533","https://openalex.org/W4233413206"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W4230687177","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2942366970","https://openalex.org/W2807634898","https://openalex.org/W1692008701","https://openalex.org/W1968829728","https://openalex.org/W2597588799"],"abstract_inverted_index":{"We":[0,47,128],"study":[1,102],"max-sum":[2],"clustering":[3,140,156],"in":[4,55,69,90],"a":[5,27,39,56,74,159],"semi-supervised":[6,57],"setting.":[7],"Our":[8,111],"objective":[9,29,45,53,80,118,161],"function":[10,54],"maximizes":[11],"the":[12,23,42,66,70,78,91,103,106,116,154],"pairwise":[13],"within-cluster":[14],"similarity":[15],"with":[16],"respect":[17],"to":[18,115,132,147,153],"some":[19],"null":[20],"hypothesis":[21],"regarding":[22],"similarity.":[24],"This":[25],"is":[26,38,82,89,137],"natural":[28],"that":[30,49,86,134,150],"does":[31],"not":[32],"require":[33],"any":[34],"additional":[35],"parameters,":[36],"and":[37,73,97,157],"generalization":[40],"of":[41,65,93],"well-known":[43],"modularity":[44],"function.":[46],"show":[48,133],"for":[50,120,139],"such":[51],"an":[52,62],"setting":[58,104],"we":[59,87,100,122,144],"can":[60,123],"compute":[61],"additive":[63],"approximation":[64,76],"optimal":[67,79],"solution":[68],"general":[71],"case,":[72],"constant-factor":[75],"when":[77],"value":[81],"large.":[83],"The":[84],"supervision":[85],"consider":[88],"form":[92],"cluster":[94],"assignment":[95],"queries":[96],"same-cluster":[98],"queries;":[99],"also":[101,113],"where":[105],"query":[107],"responses":[108],"are":[109,145,151],"noisy.":[110],"algorithm":[112],"generalizes":[114],"min-sum":[117],"function,":[119],"which":[121],"achieve":[124],"similar":[125],"performance":[126],"guarantees.":[127],"present":[129],"computational":[130],"experiments":[131],"our":[135],"framework":[136],"effective":[138],"text":[141],"data":[142],"-":[143],"able":[146],"find":[148],"clusterings":[149],"close":[152],"queried":[155],"have":[158],"good":[160],"value.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}