arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.08256cs.LGstat.ML
收藏

一种基于量子退火的极值聚类方法

A Quantum Annealing-Based Approach to Extreme Clustering

QB Information Technologies (1QBit)(1QB信息技术公司(1QBit));University of British Columbia(不列颠哥伦比亚大学);Simon Fraser University(西蒙弗雷泽大学)

Tim Jaschek, Marko Bucyk, Jaspreet S. Oberoi

摘要:

基于相似性对数据集元素进行聚类或分组不仅可以用于将数据集分类为几个类别,而且可以通过相对大量的代表性元素来近似它。在后一种情况下,被称为极端聚类,数据集是巨大的,代表性的集群数量很大。我们设计了一种分布式方法,可以有效地解决极端聚类问题,使用量子退火。我们证明了这种方法产生最佳的聚类分配下的可分性假设,并表明所产生的聚类分配的质量相当的常见的聚类算法产生的分配,但可以获得一个完整的数量级更快。

英文摘要:

Clustering, or grouping, dataset elements based on similarity can be used not only to classify a dataset into a few categories, but also to approximate it by a relatively large number of representative elements. In the latter scenario, referred to as extreme clustering, datasets are enormous and the number of representative clusters is large. We have devised a distributed method that can efficiently solve extreme clustering problems using quantum annealing. We prove that this method yields optimal clustering assignments under a separability assumption, and show that the generated clustering assignments are of comparable quality to those of assignments generated by common clustering algorithms, yet can be obtained a full order of magnitude faster.

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

↑