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

分布数据的连续矩阵逼近

Continuous Matrix Approximation on Distributed Data

Mina Ghashami, Jeff M. Phillips, Feifei Li

摘要:

以流式方式跟踪和近似数据矩阵是一项根本挑战。当数据来自多个分布式站点,每个站点都接收一个数据流时,这个问题需要更多的关注和关注。本文研究了分布式流媒体模型中的“跟踪逼近矩阵”问题。在这个模型中,有m个分布式站点,每个站点观测不同的数据流(其中每个元素是分布式矩阵的一行),并且具有与协调器的通信信道,目标是沿着任何方向跟踪矩阵的范数的eps近似。为此,我们提出了新的算法来解决矩阵逼近问题。我们的算法维护一个较小的矩阵B,作为分布式流矩阵A的近似,使得对于任何单位向量x:|||A x|| ^2-||B x|| ^2| <= eps| |A||_F^2.我们的算法工作在流的方式,并产生小的通信,这是分布式计算的关键。我们最好的方法是确定性的,只使用O((m/eps)log(beta N))通信,其中N是流的大小(在查询时),beta是矩阵任何行的平方范数的上限。除了从理论上证明所有算法属性外,对真实大型数据集的广泛实验还证明了这些协议的效率。

英文摘要:

Tracking and approximating data matrices in streaming fashion is a fundamental challenge. The problem requires more care and attention when data comes from multiple distributed sites, each receiving a stream of data. This paper considers the problem of "tracking approximations to a matrix" in the distributed streaming model. In this model, there are m distributed sites each observing a distinct stream of data (where each element is a row of a distributed matrix) and has a communication channel with a coordinator, and the goal is to track an eps-approximation to the norm of the matrix along any direction. To that end, we present novel algorithms to address the matrix approximation problem. Our algorithms maintain a smaller matrix B, as an approximation to a distributed streaming matrix A, such that for any unit vector x: | ||A x||^2 - ||B x||^2 | <= eps ||A||_F^2. Our algorithms work in streaming fashion and incur small communication, which is critical for distributed computation. Our best method is deterministic and uses only O((m/eps) log(beta N)) communication, where N is the size of stream (at the time of the query) and beta is an upper-bound on the squared norm of any row of the matrix. In addition to proving all algorithmic properties theoretically, extensive experiments with real large datasets demonstrate the efficiency of these protocols.

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

↑