Pages that link to "Item:Q4468312"

The following pages link to Estimation and Prediction for Stochastic Blockstructures (Q4468312):

Displaying 50 items.

• Model-based clustering of multiple networks with a hierarchical algorithm (Q57414) (← links)
• Pseudo-likelihood methods for community detection in large sparse networks (Q90059) (← links)
• Testing Linearity for Network Autoregressive Models (Q91246) (← links)
• Variational Inference for Stochastic Block Models From Sampled Data (Q99254) (← links)
• The stochastic topic block model for the clustering of vertices in networks with textual edges (Q111344) (← links)
• Optimal Bayesian estimators for latent variable cluster models (Q122296) (← links)
• Rate-optimal graphon estimation (Q159635) (← links)
• Empirical Bayes estimation for the stochastic blockmodel (Q262706) (← links)
• Bayesian degree-corrected stochastic blockmodels for community detection (Q315413) (← links)
• Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models (Q341136) (← links)
• Bayesian dynamic financial networks with time-varying predictors (Q395955) (← links)
• Leveraging social media networks for classification (Q408668) (← links)
• A testing based extraction algorithm for identifying significant communities in networks (Q484064) (← links)
• Overlapping stochastic block models with application to the French political blogosphere (Q542476) (← links)
• A comparative power analysis of the maximum degree and size invariants for random graph inference (Q607231) (← links)
• Parameter identifiability in a class of random graph mixture models (Q629100) (← links)
• Spectral clustering and the high-dimensional stochastic blockmodel (Q651016) (← links)
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
• The method of moments and degree distributions for network models (Q661156) (← links)
• Heterogeneous connection effects (Q680463) (← links)
• Bootstrapping on undirected binary networks via statistical mechanics (Q743427) (← links)
• Clustering for time-varying relational count data (Q830430) (← links)
• Large-scale estimation of random graph models with local dependence (Q830532) (← links)
• Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models (Q830563) (← links)
• A note on testing conditional independence for social network analysis (Q889804) (← links)
• Subsampling bootstrap of count features of networks (Q892240) (← links)
• Vertex nomination schemes for membership prediction (Q902928) (← links)
• Approximating a similarity matrix by a latent class model: a reappraisal of additive fuzzy clustering (Q961768) (← links)
• Role models for complex networks (Q978723) (← links)
• Ranking relations using analogies in biological and information networks (Q993237) (← links)
• Strategies for online inference of model-based clustering in large and growing networks (Q993242) (← links)
• Uncovering latent structure in valued graphs: a variational approach (Q993244) (← links)
• Identifiability of parameters in latent structure models with many observed variables (Q1043732) (← links)
• Multiple change points detection and clustering in dynamic networks (Q1616777) (← links)
• An online expectation maximization algorithm for exploring general structure in massive networks (Q1618786) (← links)
• Discovering patterns in time-varying graphs: a triclustering approach (Q1630871) (← links)
• Bayesian community detection (Q1631576) (← links)
• Network-based naive Bayes model for social network (Q1635847) (← links)
• Community detection by \(L_{0}\)-penalized graph Laplacian (Q1639201) (← links)
• On the role of latent variable models in the era of big data (Q1642420) (← links)
• Network linear discriminant analysis (Q1662034) (← links)
• Dealing with reciprocity in dynamic stochastic block models (Q1662823) (← links)
• A review of dynamic network models with latent variables (Q1670776) (← links)
• Double instrumental variable estimation of interaction models with big data (Q1676366) (← links)
• Portal nodes screening for large scale social networks (Q1740287) (← links)
• Robust unsupervised cluster matching for network data (Q1741172) (← links)
• Fast analytical methods for finding significant labeled graph motifs (Q1741244) (← links)
• On semidefinite relaxations for the block model (Q1747735) (← links)
• Bayesian inference and testing of group differences in brain networks (Q1752001) (← links)
• Information loss method to measure node similarity in networks (Q1782988) (← links)