具有必须链接和不能链接约束的$k$-均值问题的有效算法

IF 5.2 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Tsinghua Science and Technology Pub Date : 2023-01-01 DOI:10.26599/TST.2022.9010056
Chaoqi Jia;Longkun Guo;Kewen Liao;Zhigang Lu
{"title":"具有必须链接和不能链接约束的$k$-均值问题的有效算法","authors":"Chaoqi Jia;Longkun Guo;Kewen Liao;Zhigang Lu","doi":"10.26599/TST.2022.9010056","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":"28 6","pages":""},"PeriodicalIF":5.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5971803/10197185/10197186.pdf","citationCount":"0","resultStr":"{\"title\":\"Efficient Algorithm for the $k$-Means Problem with Must-Link and Cannot-Link Constraints\",\"authors\":\"Chaoqi Jia;Longkun Guo;Kewen Liao;Zhigang Lu\",\"doi\":\"10.26599/TST.2022.9010056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":60306,\"journal\":{\"name\":\"Tsinghua Science and Technology\",\"volume\":\"28 6\",\"pages\":\"\"},\"PeriodicalIF\":5.2000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/iel7/5971803/10197185/10197186.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tsinghua Science and Technology\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10197186/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10197186/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

由于在数据科学和人工智能中的广泛应用,最近对以实例级“必须链接”(ML)和“不能链接”(CL)辅助信息为约束条件的$k$-均值等约束聚类进行了广泛的研究。为了解决这个问题,我们提出了一种算法,当只考虑ML约束时,其可证明近似比为$O(\log k)$。我们还实证评估了我们的算法在具有人工ML和不相交CL约束的真实世界数据集上的性能。实验结果表明,该算法在聚类精度上优于现有的基于贪婪的启发式算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient Algorithm for the $k$-Means Problem with Must-Link and Cannot-Link Constraints
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
12.10
自引率
0.00%
发文量
2340
期刊最新文献
Contents Feature-Grounded Single-Stage Text-to-Image Generation Deep Broad Learning for Emotion Classification in Textual Conversations Exploring a Promising Region and Enhancing Decision Space Diversity for Multimodal Multi-Objective Optimization Exploring a Promising Region and Enhancing Decision Space Diversity for Multimodal Multi-objective Optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1