arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.08892cs.DCcs.DScs.ITcs.LGmath.IT
收藏

Reliable Distributed Clustering with Redundant Data Assignment

College of Information and Computer Sciences, University of Massachusetts, Amherst(马萨诸塞大学阿默斯特分校信息与计算机科学学院);Google Research New York(谷歌纽约研究院)

Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat

英文摘要:

In this paper, we present distributed generalized clustering algorithms that can handle large scale data across multiple machines in spite of straggling or unreliable machines. We propose a novel data assignment scheme that enables us to obtain global information about the entire data even when some machines fail to respond with the results of the assigned local computations. The assignment scheme leads to distributed algorithms with good approximation guarantees for a variety of clustering and dimensionality reduction problems.

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

↑