ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1204.2296
  4. Cited By
Co-clustering for directed graphs: the Stochastic co-Blockmodel and
  spectral algorithm Di-Sim

Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim

10 April 2012
Karl Rohe
Tai Qin
Bin Yu
ArXivPDFHTML

Papers citing "Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim"

4 / 4 papers shown
Title
Fast Network Community Detection with Profile-Pseudo Likelihood Methods
Fast Network Community Detection with Profile-Pseudo Likelihood Methods
Jiangzhou Wang
Jingfei Zhang
Binghui Liu
Ji Zhu
Jianhua Guo
26
25
0
01 Nov 2020
Optimal Estimation and Completion of Matrices with Biclustering
  Structures
Optimal Estimation and Completion of Matrices with Biclustering Structures
Chao Gao
Yu Lu
Zongming Ma
Harrison H. Zhou
21
63
0
01 Dec 2015
Inferring structure in bipartite networks using the latent block model
  and exact ICL
Inferring structure in bipartite networks using the latent block model and exact ICL
J. Wyse
Nial Friel
Pierre Latouche
30
65
0
10 Apr 2014
Convergence of the groups posterior distribution in latent or stochastic
  block models
Convergence of the groups posterior distribution in latent or stochastic block models
M. Mariadassou
C. Matias
31
36
0
29 Jun 2012
1