A Survey of Statistical Network Models
From MaRDI portal
Publication:3569376
DOI10.1561/2200000008zbMath1191.68615arXiv1007.1075OpenAlexW3105761396WikidataQ57408120 ScholiaQ57408120MaRDI QIDQ3569376
Publication date: 18 June 2010
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.1075
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items
Estimation of the global mode of a density: minimaxity, adaptation, and computational complexity, Multicuts and perturb \& MAP for probabilistic graph clustering, Explaining mixture models through semantic pattern mining and banded matrix visualization, Divisive clustering of high dimensional data streams, Modal clustering asymptotics with applications to bandwidth selection, Optimality-based clustering: an inverse optimization approach, A statistical view of clustering performance through the theory of \(U\)-processes, Detecting Lagrangian coherent structures from sparse and noisy trajectory data, Adjusting the Adjusted Rand Index. A multinomial story, On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior, Richness fallacy, A family of distances for preference-approvals, Detecting communities in attributed networks through bi-direction penalized clustering and its application, Unnamed Item, Bootstrapping estimates of stability for clusters, observations and model selection, Measuring the stability of spectral clustering, Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts, Banks' business models in the euro area: a cluster analysis in high dimensions, Clustering stability-based evolutionary K-means, Visualizing non-metric similarities in multiple maps, Optimal transport, mean partition, and uncertainty assessment in cluster analysis, Good Clusterings Have Large Volume, Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication, Unnamed Item
