{"id":"https://openalex.org/W2283060","doi":null,"title":"Constrained K-Means Clustering","display_name":"Constrained K-Means Clustering","publication_year":2000,"publication_date":"2000-05-01","ids":{"openalex":"https://openalex.org/W2283060","mag":"2283060"},"language":"en","primary_location":{"id":"mag:2283060","doi":null,"is_oa":false,"landing_page_url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2000-65.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048876983","display_name":"Kristin P. Bennett","orcid":"https://orcid.org/0000-0002-8782-105X","observed_orcids":["https://orcid.org/0000-0002-8782-105X"]},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kristin P. Bennett","raw_affiliation_strings":["Rensselaer Polytechnic Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079602288","display_name":"Patricia Bradley","orcid":"https://orcid.org/0000-0003-0688-8920","observed_orcids":["https://orcid.org/0000-0003-0688-8920"]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Patricia Bradley","raw_affiliation_strings":["Microsoft"],"raw_orcid":"https://orcid.org/0000-0003-0688-8920","affiliations":[{"raw_affiliation_string":"Microsoft","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029134118","display_name":"Ayhan Demiriz","orcid":"https://orcid.org/0000-0002-5731-3134","observed_orcids":["https://orcid.org/0000-0002-5731-3134"]},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ayhan Demiriz","raw_affiliation_strings":["Rensselaer Polytechnic Institute"],"raw_orcid":"https://orcid.org/0000-0002-5731-3134","affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4156,"has_fulltext":false,"cited_by_count":333,"citation_normalized_percentile":{"value":0.95487682,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"8","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":1.0,"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":1.0,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.0,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/constrained-k-means-clustering","display_name":"constrained k-means clustering","score":0.8510000109672546},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.8899999856948853},{"id":"https://openalex.org/keywords/cluster-assignment","display_name":"cluster assignment","score":0.7770000100135803},{"id":"https://openalex.org/keywords/high-dimensional-data","display_name":"high-dimensional data","score":0.8709999918937683},{"id":"https://openalex.org/keywords/clustering-optimization","display_name":"clustering optimization","score":0.5820000171661377}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8603046536445618},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.6167674660682678},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.5735573768615723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5462786555290222},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5240419507026672},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.49151715636253357},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.48965221643447876},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.4869578778743744},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.46092459559440613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4287011921405792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39169973134994507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3772471249103546},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37316685914993286},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1890110969543457},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2283060","doi":null,"is_oa":false,"landing_page_url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2000-65.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"score":0.7099999785423279,"display_name":"No poverty","id":"https://metadata.un.org/sdg/1"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W40176063","https://openalex.org/W1533128638","https://openalex.org/W1969357402","https://openalex.org/W1971784203","https://openalex.org/W2033403400","https://openalex.org/W2068289711","https://openalex.org/W2093404847","https://openalex.org/W2105535594"],"related_works":["https://openalex.org/W2496528305","https://openalex.org/W2040964549","https://openalex.org/W1806756507","https://openalex.org/W7097558822","https://openalex.org/W2596841574","https://openalex.org/W4221156122","https://openalex.org/W3203379317","https://openalex.org/W7221818675","https://openalex.org/W7100946773","https://openalex.org/W2897880806"],"abstract_inverted_index":{"We":[0,27,54,80],"consider":[1],"practical":[2],"methods":[3],"for":[4],"adding":[5,57],"constraints":[6,59],"to":[7,14,35,60,101],"the":[8,38,46,61,83,95,110],"K-Means":[9,34,114],"clustering":[10,63],"algorithm":[11],"in":[12,78],"order":[13],"avoid":[15],"local":[16,103],"solutions":[17],"with":[18],"empty":[19],"clusters":[20,22,50],"or":[21],"having":[23],"very":[24],"few":[25],"points.":[26],"often":[28],"observe":[29],"this":[30],"phenomena":[31],"when":[32],"applying":[33],"datasets":[36,93],"where":[37],"number":[39,47,75],"of":[40,48,76,109],"dimensions":[41],"is":[42,51,98],"n":[43],"10":[44],"and":[45],"desired":[49],"k":[52,58],"20.":[53],"propose":[55],"explicitly":[56],"underlying":[62,111],"optimization":[64],"problem":[65],"requiring":[66],"that":[67],"each":[68],"cluster":[69,85],"have":[70],"at":[71],"least":[72],"a":[73,106],"minimum":[74],"points":[77],"it.":[79],"then":[81],"investigate":[82],"resulting":[84],"assignment":[86],"step.":[87],"Preliminary":[88],"numerical":[89],"tests":[90],"on":[91],"real":[92],"indicate":[94],"constrained":[96],"approach":[97],"less":[99],"prone":[100],"poor":[102],"solutions,":[104],"producing":[105],"better":[107],"summary":[108],"data.":[112],"Contrained":[113],"Clustering":[115],"1":[116]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":30},{"year":2023,"cited_by_count":29},{"year":2022,"cited_by_count":25},{"year":2021,"cited_by_count":25},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":10}],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2016-06-24T00:00:00"}