arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.05214cs.DCcs.LGcs.NAmath.NA
收藏

分布式环境中PCA算法的分析

Analysis of PCA Algorithms in Distributed Environments

Qatar Computing Research Institute(卡塔尔计算研究所)

Tarek Elgamal, Mohamed Hefeeda

AI总结:

本文分析了分布式环境中PCA算法的性能,比较了时间复杂度和通信复杂度,探讨了不同算法的可扩展性瓶颈及适用场景。

摘要:

经典机器学习算法在处理大规模数据时常面临可扩展性瓶颈,因其最初设计用于处理小数据集。本文分析了不同计算PCA算法的方法,并评论其在支持大规模数据集时的局限性。方法在时间复杂度和通信复杂度两个重要指标上进行分析和比较。我们考虑了两种指标的最坏情况,并识别了实现每种方法的软件库。本文分析帮助研究人员和工程师理解不同PCA算法的可扩展性瓶颈,选择适合的应用和数据集特性的方法和软件库,并设计新的可扩展PCA算法。

英文摘要:

Classical machine learning algorithms often face scalability bottlenecks when they are applied to large-scale data. Such algorithms were designed to work with small data that is assumed to fit in the memory of one machine. In this report, we analyze different methods for computing an important machine learing algorithm, namely Principal Component Analysis (PCA), and we comment on its limitations in supporting large datasets. The methods are analyzed and compared across two important metrics: time complexity and communication complexity. We consider the worst-case scenarios for both metrics, and we identify the software libraries that implement each method. The analysis in this report helps researchers and engineers in (i) understanding the main bottlenecks for scalability in different PCA algorithms, (ii) choosing the most appropriate method and software library for a given application and data set characteristics, and (iii) designing new scalable PCA algorithms.

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

↑