Optimal Estimation and Completion of Matrices with Biclustering Structures

zbMath1392.62151arXiv1512.00150MaRDI QIDQ2834492

Zongming Ma, Yu Lu, Harrison H. Zhou, Chao Gao

Publication date: 22 November 2016

Full work available at URL: https://arxiv.org/abs/1512.00150

zbMATH Keywords

graphonmatrix completionmissing databiclusteringstochastic block modelssparse network

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05)

Related Items (18)

Hierarchical Community Detection by Recursive Partitioning ⋮ Edgeworth expansions for network moments ⋮ Local-density dependent Markov processes on graphons with epidemiological applications ⋮ Local inference by penalization method for biclustering model ⋮ Bootstrapping exchangeable random graphs ⋮ Optimal Bipartite Network Clustering ⋮ Biclustering via structured regularized matrix decomposition ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising ⋮ Generalized co-clustering analysis via regularized alternating least squares ⋮ Outlier detection in networks with missing links ⋮ Maximum likelihood estimation of sparse networks with missing observations ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees ⋮ Profile likelihood biclustering ⋮ Dynamic network models and graphon estimation ⋮ Structured matrix estimation and completion

This page was built for publication: Optimal Estimation and Completion of Matrices with Biclustering Structures