Latent association graph inference for binary transaction data

DOI10.1016/j.csda.2021.107229OpenAlexW3150060454MaRDI QIDQ2242006

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

graph theoryhierarchical modelBayesian inferenceBayesian model averaging

Mathematics Subject Classification ID

Statistics (62-XX)

Uses Software

• LCM

Cites Work

• Unnamed Item
• Unnamed Item
• Pólya-like urns and the Ewens' sampling formula
• The ubiquitous Ewens sampling formula
• Algorithmic graph theory and perfect graphs
• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
• The sampling theory of selectively neutral alleles
• Estimation of the Means of Dependent Variables
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

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