arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1202.6001stat.MLcs.LG
收藏

基于落球过程的乘性属性图高效采样

Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process

Your Fantastic Institute(贵方卓越研究所);Their Fantastic Institute(其方卓越研究所)

Hyokun Yun, S. V. N. Vishwanathan

摘要:

我们介绍了一种新颖且有效的乘法属性图模型的采样算法(MAGM-Kim和Leskovec(2010))。我们的算法比Yun和Vishwanathan(2012)提出的算法更有效,因为我们的方法将其算法的\emph{strictly}时间复杂度保证扩展到更大的参数空间。无论是在理论上还是在稀疏图上的实验评价上,我们的新算法都优于以前的算法。为了设计我们的算法,我们首先定义了一个随机\emph{ball-dropping process}(BDP)。尽管该过程的特殊情况被引入作为Kronecker乘积图模型的有效近似采样算法(KPGM-Leskovec等人(2010)}),但就我们所知,迄今为止,\emph{why}这种近似不起作用,\emph{what}也不是该过程从中采样的实际分布。我们严格的处理BDP使我们能够澄清背后的合理BDP近似KPGM,并设计一个有效的抽样算法的MAGM。

英文摘要:

We introduce a novel and efficient sampling algorithm for the Multiplicative Attribute Graph Model (MAGM - Kim and Leskovec (2010)}). Our algorithm is \emph{strictly} more efficient than the algorithm proposed by Yun and Vishwanathan (2012), in the sense that our method extends the \emph{best} time complexity guarantee of their algorithm to a larger fraction of parameter space. Both in theory and in empirical evaluation on sparse graphs, our new algorithm outperforms the previous one. To design our algorithm, we first define a stochastic \emph{ball-dropping process} (BDP). Although a special case of this process was introduced as an efficient approximate sampling algorithm for the Kronecker Product Graph Model (KPGM - Leskovec et al. (2010)}), neither \emph{why} such an approximation works nor \emph{what} is the actual distribution this process is sampling from has been addressed so far to the best of our knowledge. Our rigorous treatment of the BDP enables us to clarify the rational behind a BDP approximation of KPGM, and design an efficient sampling algorithm for the MAGM.

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

↑