Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering

DOI10.1080/10618600.2020.1824870OpenAlexW3094530611MaRDI QIDQ5066394

Youngser Park, Congyuan Yang, David J. Marchette, Carey E. Priebe

Publication date: 29 March 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

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

zbMATH Keywords

model-based clusteringstochastic block modeladjacency spectral embedding

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items

Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Spectral graph clustering via the expectation-solution algorithm ⋮ Link prediction in dynamic networks using random dot product graphs

Uses Software

• mclust

Cites Work

• Unnamed Item
• Unnamed Item
• A limit theorem for scaled eigenvectors of random dot product graphs
• Spectral clustering and the high-dimensional stochastic blockmodel
• Automatic dimensionality selection from the scree plot via the use of profile likelihood
• An entropy criterion for assessing the number of clusters in a mixture model
• Estimating the dimension of a model
• On the number of clusters
• Variable selection methods for model-based clustering
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Consistent estimation of mixture complexity.
• Bayesian estimation of the latent dimension and communities in stochastic blockmodels
• Consistency of spectral clustering in stochastic block models
• Comparing clusterings -- an information based distance
• A nonparametric view of network models and Newman–Girvan and other modularities
• Detecting Features in Spatial Point Processes with Clutter via Model-Based Clustering
• Practical Bayesian Density Estimation Using Mixtures of Normals
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• Latent Space Approaches to Social Network Analysis
• Community structure in social and biological networks
• Statistical inference on random dot product graphs: a survey
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• On a two-truths phenomenon in spectral graph clustering
• Fast unfolding of communities in large networks
• Random Dot Product Graph Models for Social Networks
• Bilinear Mixed-Effects Models for Dyadic Data
• Variable Selection for Model-Based Clustering
• Maximum Likelihood Estimation of Misspecified Models

This page was built for publication: Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering