{"id":"https://openalex.org/W3120916806","doi":"https://doi.org/10.1109/ieem45057.2020.9309775","title":"A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints","display_name":"A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3120916806","doi":"https://doi.org/10.1109/ieem45057.2020.9309775","mag":"3120916806"},"language":"en","primary_location":{"id":"doi:10.1109/ieem45057.2020.9309775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem45057.2020.9309775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5072687277","display_name":"Philipp Baumann","orcid":"https://orcid.org/0000-0002-3286-4474"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Philipp Baumann","raw_affiliation_strings":["University of Bern, Bern, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Bern, Bern, Switzerland","institution_ids":["https://openalex.org/I118564535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072687277"],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":1.2177,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.84710519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"324","last_page":"328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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/T11106","display_name":"Data Management and Algorithms","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11550","display_name":"Text and Document Classification Technologies","score":0.9700000286102295,"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.8826348185539246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6770656704902649},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.544779896736145},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5420783758163452},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5128779411315918},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.4777228534221649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45466911792755127},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45068636536598206},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4317210614681244},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4220132827758789},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.3964352607727051},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3343820571899414},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3304992616176605},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2910550832748413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2141667604446411}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8826348185539246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6770656704902649},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.544779896736145},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5420783758163452},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5128779411315918},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.4777228534221649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45466911792755127},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45068636536598206},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4317210614681244},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4220132827758789},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.3964352607727051},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3343820571899414},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3304992616176605},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2910550832748413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2141667604446411},{"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ieem45057.2020.9309775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem45057.2020.9309775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},{"id":"pmh:oai:boris.unibe.ch:157602","is_oa":false,"landing_page_url":"https://boris.unibe.ch/157602/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Baumann, Philipp (2020). A binary linear programming-based k-means algorithm for clustering with must-link and cannot-link constraints. In: 2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) (pp. 324-328). IEEE 10.1109/IEEM45057.2020.9309775 &lt;http://dx.doi.org/10.1109/IEEM45057.2020.9309775&gt;","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:boris.unibe.ch:157695","is_oa":false,"landing_page_url":"https://boris.unibe.ch/157695/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Baumann, Philipp (2020). A binary linear programming-based k-means algorithm for clustering with must-link and cannot-link constraints. (Unpublished). In: IEEM International Conference on Industrial Engineering and Engineering Management (IEEM). Virtual Conference. 14.-17. December 2020.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1580837119","https://openalex.org/W1636513602","https://openalex.org/W1953055146","https://openalex.org/W2069607493","https://openalex.org/W2134089414","https://openalex.org/W2163494940","https://openalex.org/W2576431436","https://openalex.org/W2897880806","https://openalex.org/W2987536913","https://openalex.org/W3004414331","https://openalex.org/W3020413602","https://openalex.org/W4235169531","https://openalex.org/W6634689415","https://openalex.org/W6640902232","https://openalex.org/W6679849079","https://openalex.org/W6756100351"],"related_works":["https://openalex.org/W3146523624","https://openalex.org/W2160785859","https://openalex.org/W1525022337","https://openalex.org/W2186905933","https://openalex.org/W3140018618","https://openalex.org/W2171583777","https://openalex.org/W2555816786","https://openalex.org/W2407786351","https://openalex.org/W3011266291","https://openalex.org/W2390610678"],"abstract_inverted_index":{"Clustering":[0],"is":[1,27,39,72],"probably":[2],"the":[3,23,42,51,65,75,118,122,130,140,147],"most":[4],"extensively":[5],"studied":[6],"problem":[7,68,136],"in":[8,41,74,153],"unsupervised":[9],"learning.":[10],"Traditional":[11],"clustering":[12,26,32,52,67,95],"algorithms":[13,88],"assign":[14],"objects":[15],"to":[16,121],"clusters":[17],"exclusively":[18],"based":[19],"on":[20,134],"features":[21],"of":[22,30,44,77,85],"objects.":[24,86],"Constrained":[25],"a":[28,37,99,113],"generalization":[29],"traditional":[31],"where":[33,69],"additional":[34,70],"information":[35,71],"about":[36],"dataset":[38],"given":[40,73],"form":[43,76],"constraints.":[45,62,111],"It":[46],"has":[47],"been":[48,90],"shown":[49],"that":[50,105,139],"accuracy":[53],"can":[54,106],"be":[55],"improved":[56],"substantially":[57],"by":[58],"accounting":[59],"for":[60,82,92],"these":[61],"We":[63,97],"consider":[64,107],"constrained":[66],"must-link":[78,108],"and":[79,109],"cannot-link":[80,110],"constraints":[81],"some":[83],"pairs":[84],"Various":[87],"have":[89],"developed":[91],"this":[93],"specific":[94],"problem.":[96],"propose":[98],"binary":[100],"linear":[101],"programming-based":[102],"k-means":[103],"approach":[104],"In":[112],"computational":[114],"experiment,":[115],"we":[116],"compare":[117],"proposed":[119,141],"algorithm":[120,142,152],"DILS":[123,148],"<sub":[124,149],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[125,150],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">CC</sub>":[126,151],"algorithm,":[127],"which":[128],"represents":[129],"state-of-the-art.":[131],"Our":[132],"results":[133],"75":[135],"instances":[137],"indicate":[138],"delivers":[143],"better":[144],"clusterings":[145],"than":[146],"much":[154],"shorter":[155],"running":[156],"time.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}