arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.02271cs.DS
收藏

随机聚类的近似算法

Approximation algorithms for stochastic clustering

David G. Harris, Shi Li, Thomas Pensyl, Aravind Srinivasan, Khoa Trinh

AI总结:

针对随机聚类设置,提出具有可证明性能的近似算法,相比确定性聚类获得更优近似比,并保证每个用户的平均服务质量,同时给出部分不可能性结果。

摘要:

我们考虑聚类的随机设置,并为其中若干概念开发了具有可证明良好性能的近似算法。这些算法相比通常的确定性聚类设置,能产生更好的近似比。此外,它们提供了多项优势,包括更公平的聚类以及对每个用户具有更好的长期行为。特别地,它们确保*每个用户*(平均而言)都能获得良好的服务。我们还为其中一些结果补充了不可能性结论。

英文摘要:

We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including clustering which is fairer and has better long-term behavior for each user. In particular, they ensure that *every user* is guaranteed to get good service (on average). We also complement some of these with impossibility results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑