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

Stars:用于聚类和图学习的万亿级图构建

Stars: Tera-Scale Graph Building for Clustering and Graph Learning

Google Research(谷歌研究院)

CJ Carey, Jonathan Halcrow, Rajesh Jayaram, Vahab Mirrokni, Warren Schudy, Peilin Zhong

摘要:

在海量数据集分析中,一个基本的过程是构造相似图。这样的图在许多下游任务中起着关键作用,包括聚类、分类、图学习和最近邻搜索。对于这些任务,构建稀疏但仍能代表底层数据的图形至关重要。稀疏性的好处是双重的:首先,构造密集图在实践中对于大型数据集是不可行的,其次,下游任务的运行时间直接受到相似性图的稀疏性的影响。在这项工作中,我们提出了$\textit{Stars}$:一个高度可扩展的方法,用于通过两跳spectrum,这是图形中的相似点连接的路径长度最多为两个极其稀疏的图形。Stars可以用更少的相似性比较来构建两跳空间,这是基于学习的模型的主要瓶颈,其中比较的评估成本很高。从理论上讲,我们证明了明星建立一个图形在近线性的时间,其中近似最近的邻居包含在两跳的邻域。在实践中,我们已经为多个数据集部署了Stars,允许在$\textit{Tera-Scale}$上构建图形,即,有几十万亿条边的图。我们评估了Stars在聚类和图学习方面的性能,与不同基线相比,在成对相似性比较方面有10~1000倍的改进,在运行时间方面有2~10倍的改进,而没有质量损失。

英文摘要:

A fundamental procedure in the analysis of massive datasets is the construction of similarity graphs. Such graphs play a key role for many downstream tasks, including clustering, classification, graph learning, and nearest neighbor search. For these tasks, it is critical to build graphs which are sparse yet still representative of the underlying data. The benefits of sparsity are twofold: firstly, constructing dense graphs is infeasible in practice for large datasets, and secondly, the runtime of downstream tasks is directly influenced by the sparsity of the similarity graph. In this work, we present $\textit{Stars}$: a highly scalable method for building extremely sparse graphs via two-hop spanners, which are graphs where similar points are connected by a path of length at most two. Stars can construct two-hop spanners with significantly fewer similarity comparisons, which are a major bottleneck for learning based models where comparisons are expensive to evaluate. Theoretically, we demonstrate that Stars builds a graph in nearly-linear time, where approximate nearest neighbors are contained within two-hop neighborhoods. In practice, we have deployed Stars for multiple data sets allowing for graph building at the $\textit{Tera-Scale}$, i.e., for graphs with tens of trillions of edges. We evaluate the performance of Stars for clustering and graph learning, and demonstrate 10~1000-fold improvements in pairwise similarity comparisons compared to different baselines, and 2~10-fold improvement in running time without quality loss.

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

↑