Latent association graph inference for binary transaction data

DOI10.1016/J.CSDA.2021.107229MaRDI QIDQ2242006zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 9 November 2021

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.csda.2021.107229

zbMATH Keywords

Bayesian inferenceBayesian model averaginggraph theoryhierarchical model

Mathematics Subject Classification ID

Statistics (62-XX)

Recommendations

• On association models defined over independence graphs
• Transforming graph data for statistical relational learning
• Estimating latent feature-feature interactions in large feature-rich graphs
• A Scalable Strategy for the Identification of Latent-Variable Graphical Models
• Learning latent tree graphical models
• On estimation and inference in latent structure random graphs
• High-dimensional Gaussian graphical models on network-linked data

Cites work

• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
• Algorithmic graph theory and perfect graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Estimation of the Means of Dependent Variables
• scientific article; zbMATH DE number 47310 (Why is no real title available?)
• scientific article; zbMATH DE number 3385132 (Why is no real title available?)
• Pólya-like urns and the Ewens' sampling formula
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The sampling theory of selectively neutral alleles
• The ubiquitous Ewens sampling formula

Describes a project that uses

Uses Software

• LCM

This page was built for publication: Latent association graph inference for binary transaction data

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