跳到主要导航 跳到搜索 跳到主要内容

Randomized Spectral Co-Clustering for Large-Scale Directed Networks

  • Northwest University China
  • Shanghai University of Finance and Economics

科研成果: 期刊稿件 › 文章 › 同行评审

7 引用 (Scopus)

摘要

Directed networks are broadly used to represent asymmetric relationships among units. Co-clustering aims to cluster the senders and receivers of directed networks simultaneously. In particular, the well-known spectral clustering algorithm could be modified as the spectral co-clustering to co-cluster directed networks. However, large-scale networks pose great computational challenges to it. In this paper, we leverage sketching techniques and derive two randomized spectral co-clustering algorithms, one random-projection-based and the other random-sampling-based, to accelerate the co-clustering of large-scale directed networks. We theoretically analyze the resulting algorithms under two generative models – the stochastic co-block model and the degree-corrected stochastic co-block model, and establish their approximation error rates and misclustering error rates, indicating better bounds than the state-of-the-art results of co-clustering literature. Numerically, we design and conduct simulations to support our theoretical results and test the efficiency of the algorithms on real networks with up to millions of nodes. A publicly available R package RandClust is developed for better usability and reproducibility of the proposed methods.

源语言英语
期刊论文编号380
期刊Journal of Machine Learning Research
卷24
出版状态已出版 - 2023

学术指纹

探究 'Randomized Spectral Co-Clustering for Large-Scale Directed Networks' 的科研主题。它们共同构成独一无二的学术指纹。

引用此