Intrinsic graph structure estimation using graph Laplacian

DOI10.1162/NECO_A_00603MaRDI QIDQ5383786zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Atsushi Noda, Hideitsu Hino, Masami Tatsuno, Shotaro Akaho, Noboru Murata

Publication date 20 June 2019

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco_a_00603

zbMATH Keywords

graph structure estimationneural networksspurious correlations

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Multivariate analysis (62H99) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Graph estimation from multi-attribute data
• Inferring large graphs using \(\ell_1\)-penalized likelihood
• Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
• Gemini: graph estimation with matrix variate normal instances
• Time varying undirected graphs

Cites work

• A linear non-Gaussian acyclic model for causal discovery
• Authoritative sources in a hyperlinked environment
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Estimating PageRank on graph streams
• Functions of Matrices
• scientific article; zbMATH DE number 50740 (Why is no real title available?)
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Information-Geometric Measures as Robust Estimators of Connection Strengths and External Inputs
• Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
• Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry
• Recent advances in graph-based pattern recognition with applications in document analysis
• Sparse inverse covariance estimation with the graphical lasso

Cited in

(4)

• On the estimation of latent distances using graph distances
• Estimation of neural connections from partially observed neural spikes
• Enhanced graph-based dimensionality reduction with repulsion Laplaceans
• Uncovering latent structure in valued graphs: a variational approach

Describes a project that uses

Uses Software

• glasso
• fminsearch
• mftoolbox

This page was built for publication: Intrinsic graph structure estimation using graph Laplacian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383786)