Profile likelihood biclustering
DOI10.1214/19-EJS1667zbMath1435.62229arXiv1206.6927OpenAlexW3101840634MaRDI QIDQ2293724
Publication date: 5 February 2020
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.6927
profile likelihoodmicroarray databiclusteringco-clusteringblock modelbiological data analysiscongressional votingdirect clustering
Asymptotic properties of nonparametric inference (62G20) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of statistics to social sciences (62P25)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Fast community detection by SCORE
- Belief propagation, robust reconstruction and optimal recovery of block models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Guaranteed clustering and biclustering via semidefinite programming
- Spectral clustering and the high-dimensional stochastic blockmodel
- Community detection in sparse networks via Grothendieck's inequality
- Constructing blockmodels: how and why
- Self-consistency: A fundamental concept in statistics
- On semidefinite relaxations for the block model
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Consistency of spectral clustering in stochastic block models
- Convergence of the groups posterior distribution in latent or stochastic block models
- Co-clustering separately exchangeable network data
- Mathematical classification and clustering
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- An Efficient Heuristic Procedure for Partitioning Graphs
- On Profile Likelihood
- Community Detection and Stochastic Block Models
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- Convex biclustering
This page was built for publication: Profile likelihood biclustering