Back to Results
First PageMeta Content
Networks / Data analysis / Multivariate statistics / Singular value decomposition / Network analysis / Spectral clustering / Girvan–Newman algorithm / Cluster analysis / Modularity / Statistics / Mathematics / Algebra


Submitted to the Annals of Statistics SPECTRAL CLUSTERING AND THE HIGH-DIMENSIONAL STOCHASTIC BLOCKMODEL By Karl Rohe, Sourav Chatterjee and Bin Yu University of California Berkeley
Add to Reading List

Document Date: 2014-03-15 03:15:37


Open Document

File Size: 348,77 KB

Share Result on Facebook

City

ROHE ET / /

Company

Hoover / CDI / /

Country

Netherlands / /

Facility

Bin Yu University of California Berkeley Networks / /

IndustryTerm

spectral clustering algorithm / chemical reactions / large empirical networks / empirical online social networks / food web / parametric clustering algorithms / knowledge from network / information technology / nonparametric clustering algorithms / empirical networks / Social networks / random network / good clustering algorithm / communication network / social network / metabolic network / important tool / empirical social networks / random networks / /

Organization

National Science Foundation / Bin Yu University of California Berkeley Networks / /

Person

Stochastic Blockmodel / Van Duijn / Van Driessche / Benjamin Olding / Malik / Jinzhu Jia / Reza Khodabin / Karl Rohe / Shi / Michael Mahoney / /

Position

latent space model / /

ProvinceOrState

Alabama / Alaska / /

Technology

parametric clustering algorithms / Girvan-Newman algorithm / load balancing / nonparametric clustering algorithms / Clustering algorithms / information technology / Newman algorithm / spectral clustering algorithm / clustering algorithm / good clustering algorithm / simulation / EM algorithm / two algorithms / /

SocialTag