Recovering networks from distance data

DOI10.1007/s10994-013-5370-7zbMath1273.62144OpenAlexW2152098322WikidataQ59694871 ScholiaQ59694871MaRDI QIDQ374126

Karin J. Metzner, Alexander Böhm, Sandhya Prabhakaran, Volker Roth, David Adametz

Publication date: 22 October 2013

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5370-7

zbMATH Keywords

MCMCGaussian graphical modelsnetwork inferencepairwise Euclidean distances

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Monte Carlo methods (65C05) Learning and adaptive systems in artificial intelligence (68T05) Graphical methods in statistics (62A09)

Uses Software

• glasso
• ProCKSI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse inverse covariance estimation with the graphical lasso
• Estimating time-varying networks
• Transposable regularized covariance models with an application to missing data imputation
• Modeling covariance matrices via partial autocorrelations
• On singular Wishart and singular multivariate beta distributions
• Wishart and pseudo-Wishart distributions and some applications to shape theory
• Integrated likelihood methods for eliminating nuisance parameters. (With comments and a rejoinder).
• Time varying undirected graphs
• High-dimensional graphs and variable selection with the Lasso
• How many clusters?
• The Similarity Metric
• Bayesian Variable Selection in Linear Regression
• Bayesian inference for variance components using only error contrasts
• Recovery of inter-block information when block sizes are unequal
• Dynamic matrix-variate graphical models