arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1104.4605stat.MLcs.DMcs.LGcs.SIphysics.soc-ph
收藏

压缩网络分析

Compressive Network Analysis

Stanford University(斯坦福大学);Peking University(北京大学);Johns Hopkins University(约翰斯·霍普金斯大学)

Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas Guibas

摘要:

现代数据采集通常会产生大量的网络数据。虽然已经提出了许多方法和模型来分析这类数据,但网络数据的研究在很大程度上与经典的统计学习和信号处理理论脱节。在本文中,我们提出了一个新的网络数据建模框架,它连接了两个看似不同的领域:网络数据分析和压缩感知。从非参数的角度来看,我们使用一个大字典来建模一个观察到的网络。特别是,我们认为网络集团检测问题,并显示我们的制定与一个新的代数工具,即在齐次空间中的Randon基追求之间的连接。这样的连接使我们能够确定严格的恢复条件集团检测问题。虽然本文主要是概念性的,但我们也开发了实用的近似算法来解决经验问题,并在现实世界的数据集上证明了它们的实用性。

英文摘要:

Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the research of network data is largely disconnected with the classical theory of statistical learning and signal processing. In this paper, we present a new framework for modeling network data, which connects two seemingly different areas: network data analysis and compressed sensing. From a nonparametric perspective, we model an observed network using a large dictionary. In particular, we consider the network clique detection problem and show connections between our formulation with a new algebraic tool, namely Randon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Though this paper is mainly conceptual, we also develop practical approximation algorithms for solving empirical problems and demonstrate their usefulness on real-world datasets.

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

↑