[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_275":276},"routes/_layout",{"_11":204},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_72":73,"_74":75},"type","paper","id","paper_W1636513602","section","technologies","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":-5,"_59":60,"_61":-5,"_62":63,"_64":-5,"_65":66,"_67":30,"_68":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W1636513602/technologies","siteBaseUrl","https://www.hugmap.com","sectionCount",3,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"Clustering With Constraints: Feasibility Issues and the k-Means Algorithm\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W1636513602/technologies\",\"@type\":\"ScholarlyArticle\",\"headline\":\"Clustering With Constraints: Feasibility Issues and the k-Means Algorithm\",\"datePublished\":\"2005-01-09\"},{\"@type\":\"CollectionPage\",\"name\":\"Clustering With Constraints: Feasibility Issues and the k-Means Algorithm 相关技术\",\"description\":\"Clustering With Constraints: Feasibility Issues and the k-Means Algorithm 在 HugMap 中的相关技术，共 3 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W1636513602/technologies\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Clustering With Constraints: Feasibility Issues and the k-Means Algorithm\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W1636513602\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关技术\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W1636513602/technologies\"}]}]}","name","Clustering With Constraints: Feasibility Issues and the k-Means Algorithm","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W1636513602\",\"doi\":\"10.1137/1.9781611972757.13\"}","properties","source","openalex","createdAt","2026-05-21T18:32:00.21033636","updatedAt","2026-05-21T18:32:00.21025846","doi","10.1137/1.9781611972757.13","arxivId","openalexId","W1636513602","title","abstractText","Recent work has looked at extending the k-Means algorithm to incorporate background information in the form of instance level must-link and cannot-link constraints. We introduce two ways of specifying additional background information in the form of δ and ∊ constraints that operate on all instances but which can be interpreted as conjunctions or disjunctions of instance level constraints and hence are easy to implement. We present complexity results for the feasibility of clustering under each type of constraint individually and several types together. A key finding is that determining whether there is a feasible solution satisfying all constraints is, in general, NP-complete. Thus, an iterative algorithm such as k-Means should not try to find a feasible partitioning at each iteration. This motivates our derivation of a new version of the k-Means algorithm that minimizes the constrained vector quantization error but at each iteration does not attempt to satisfy all constraints. Using standard UCI datasets, we find that using constraints improves accuracy as others have reported, but we also show that our algorithm reduces the number of iterations until convergence. Finally, we illustrate these benefits and our new constraint types on a complex real world object identification problem using the infra-red detector on an Aibo robot.","publishedDate","2005-01-09","publishedYear",2005,"venue","citationCount",279,"authors","keywords",[69,70,71],"pdfUrl","topVenue",false,"displayName","displayDescription","Machine Learning and Algorithms","Data Management and Algorithms","Advanced Image and Video Retrieval Techniques","mutations",[],"queries",[76],{"_77":78,"_79":80,"_81":82,"_83":84},"dehydratedAt",1781967582709,"state",{"_86":87,"_88":89,"_90":78,"_91":-5,"_92":93,"_94":93,"_95":93,"_96":-5,"_97":-5,"_98":66,"_35":99,"_100":101},"queryKey",[85,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W1636513602\"]","portal","data",{"_19":20,"_102":103,"_104":105,"_106":107,"_108":109,"_18":110,"_61":111},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[161,162,163,164],"events",[],"articles",[],[135,136,137],[112,113],{"_15":129,"_29":130,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":131,"_39":-5,"_40":41,"_42":132,"_44":133,"_119":134,"_51":-5,"_121":-5,"_122":-5,"_123":-5,"_59":-5,"_124":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_67":130,"_68":-5},{"_15":114,"_29":115,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":116,"_39":-5,"_40":41,"_42":117,"_44":118,"_119":120,"_51":-5,"_121":-5,"_122":-5,"_123":-5,"_59":-5,"_124":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_67":115,"_68":-5},"person_A5030289182","Ian Davidson","{\"openalex\":\"A5030289182\",\"orcid\":\"0000-0002-1258-4213\"}","2026-05-15T12:01:46.198562177","2026-05-22T04:20:03.18997974","orcid","0000-0002-1258-4213","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5086740853","S. S. Ravi","{\"openalex\":\"A5086740853\",\"orcid\":\"0000-0002-0893-4364\"}","2026-05-16T05:34:30.177655763","2026-05-22T04:20:03.200151426","0000-0002-0893-4364",{"_15":156,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":157,"_39":-5,"_40":140,"_42":158,"_44":159,"_143":160,"_145":146,"_147":-5,"_148":149,"_150":-5,"_123":-5,"_151":-5,"_67":71,"_68":-5},{"_15":152,"_29":69,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":153,"_39":-5,"_40":140,"_42":154,"_44":155,"_143":144,"_145":146,"_147":-5,"_148":149,"_150":-5,"_123":-5,"_151":-5,"_67":69,"_68":-5},{"_15":138,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":139,"_39":-5,"_40":140,"_42":141,"_44":142,"_143":144,"_145":146,"_147":-5,"_148":149,"_150":-5,"_123":-5,"_151":-5,"_67":70,"_68":-5},"tech_oa_T11106","{\"taxonomy_id\":\"tax_rd_T11106\"}","openalex_topics","2026-05-17T09:00:11.245194282","2026-05-17T09:00:11.245197583","techType","algorithm","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","patentCount","tech_oa_T12072","{\"taxonomy_id\":\"tax_rd_T12072\"}","2026-05-17T09:00:09.178457539","2026-05-17T09:00:09.178459468","tech_oa_T10627","{\"taxonomy_id\":\"tax_rd_T10627\"}","2026-05-17T09:00:01.224003475","2026-05-17T09:00:01.22400541","concept",{"_15":194,"_29":195,"_31":-5,"_32":196,"_33":197,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":201,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":195,"_68":197},{"_15":188,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":189,"_39":-5,"_40":41,"_42":190,"_44":191,"_169":170,"_171":-5,"_172":26,"_173":192,"_175":193,"_177":93,"_178":179,"_180":93,"_181":-5,"_67":71,"_68":-5},{"_15":182,"_29":69,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":183,"_39":-5,"_40":41,"_42":184,"_44":185,"_169":170,"_171":-5,"_172":26,"_173":186,"_175":187,"_177":93,"_178":179,"_180":93,"_181":-5,"_67":69,"_68":-5},{"_15":165,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":166,"_39":-5,"_40":41,"_42":167,"_44":168,"_169":170,"_171":-5,"_172":26,"_173":174,"_175":176,"_177":93,"_178":179,"_180":93,"_181":-5,"_67":70,"_68":-5},"tax_rd_T11106","{\"openalex_topic\":\"T11106\"}","2026-05-14T00:29:16.292968991","2026-05-23T12:38:06.251863399","taxonomyType","RESEARCH_DOMAIN","code","level","parentId","tax_rd_1711","path","Physical Sciences/Computer Science/Signal Processing/Data Management and Algorithms","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T12072","{\"openalex_topic\":\"T12072\"}","2026-05-14T00:28:24.28831512","2026-05-23T12:37:14.193563359","tax_rd_1702","Physical Sciences/Computer Science/Artificial Intelligence/Machine Learning and Algorithms","tax_rd_T10627","{\"openalex_topic\":\"T10627\"}","2026-05-14T00:27:13.287760078","2026-05-23T12:38:54.232846671","tax_rd_1707","Physical Sciences/Computer Science/Computer Vision and Pattern Recognition/Advanced Image and Video Retrieval Techniques","tax_ind_ai","人工智能",[202,203],"Artificial Intelligence","manual","INDUSTRY","tax_ind_root","科技行业/人工智能","AI","AI 技术",{"_72":205,"_74":206},[],[207],{"_77":208,"_79":209,"_81":210,"_83":211},1781967581833,{"_86":213,"_88":89,"_90":208,"_91":-5,"_92":93,"_94":93,"_95":93,"_96":-5,"_97":-5,"_98":66,"_35":99,"_100":101},[85,212],"[\"portal\",\"industries\"]","industries",[214,215,216,217,218,219,220,221,222,223,224,225],{"_15":194,"_29":195,"_31":-5,"_32":274,"_33":197,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":201,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":195,"_68":197},{"_15":270,"_29":271,"_31":-5,"_32":-5,"_33":272,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":273,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":271,"_68":272},{"_15":264,"_29":265,"_31":-5,"_32":266,"_33":267,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":268,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":265,"_68":267},{"_15":260,"_29":261,"_31":-5,"_32":-5,"_33":262,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":263,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":261,"_68":262},{"_15":256,"_29":257,"_31":-5,"_32":-5,"_33":258,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":259,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":257,"_68":258},{"_15":250,"_29":251,"_31":-5,"_32":252,"_33":253,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":254,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":251,"_68":253},{"_15":246,"_29":247,"_31":-5,"_32":-5,"_33":248,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":249,"_177":93,"_178":179,"_180":93,"_181":-5,"_67":247,"_68":248},{"_15":242,"_29":243,"_31":-5,"_32":-5,"_33":244,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":245,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":243,"_68":244},{"_15":238,"_29":239,"_31":-5,"_32":-5,"_33":240,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":241,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":239,"_68":240},{"_15":234,"_29":235,"_31":-5,"_32":-5,"_33":236,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":237,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":235,"_68":236},{"_15":230,"_29":231,"_31":-5,"_32":-5,"_33":232,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":233,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":231,"_68":232},{"_15":226,"_29":227,"_31":-5,"_32":-5,"_33":228,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":198,"_42":-5,"_44":-5,"_169":199,"_171":-5,"_172":89,"_173":200,"_175":229,"_177":93,"_178":66,"_180":93,"_181":-5,"_67":227,"_68":228},"tax_ind_smartphone","智能手机","Smartphone","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[255],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[269],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算",[202,203],"env",{"_277":24},"SITE_BASE_URL"]

Clustering With Constraints: Feasibility Issues and the <i>k</i>-Means Algorithm 论文

Clustering With Constraints: Feasibility Issues and the <i>k</i>-Means Algorithm · 相关技术

相关技术