Corpus ID: 7881866

Optimal Estimation and Completion of Matrices with Biclustering Structures

@article{Gao2016OptimalEA,
  title={Optimal Estimation and Completion of Matrices with Biclustering Structures},
  author={Chao Gao and Yu Lu and Zongming Ma and Harrison H. Zhou},
  journal={J. Mach. Learn. Res.},
  year={2016},
  volume={17},
  pages={161:1-161:29}
}
Biclustering structures in data matrices were first formalized in a seminal paper by John Hartigan (1972) where one seeks to cluster cases and variables simultaneously. Such structures are also prevalent in block modeling of networks. In this paper, we develop a unified theory for the estimation and completion of matrices with biclustering structures, where the data is a partially observed and noise contaminated data matrix with a certain biclustering structure. In particular, we show that a… Expand
Profile likelihood biclustering
Optimal Bipartite Network Clustering
Generalized Co-clustering Analysis via Regularized Alternating Least Squares
  • Gen Li
  • Mathematics, Computer Science
  • Comput. Stat. Data Anal.
  • 2020
Bayesian Model Selection with Graph Structured Sparsity
Maximum Likelihood Estimation of Sparse Networks with Missing Observations
Lattice partition recovery with dyadic CART
Link Prediction in the Stochastic Block Model with Outliers
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
Co-clustering of Nonsmooth Graphons
Biclustering via sparse singular value decomposition.
Co-clustering separately exchangeable network data
Rate-optimal graphon estimation
Exact Matrix Completion via Convex Optimization
The Power of Convex Relaxation: Near-Optimal Matrix Completion
  • E. Candès, T. Tao
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2010
...
1
2
3
4
5
...