Pages that link to "Item:Q4528252"
From MaRDI portal
The following pages link to Bounds for cell entries in contingency tables given marginal totals and decomposable graphs (Q4528252):
Displaying 16 items.
- The mode oriented stochastic search (MOSS) algorithm for log-linear models with conjugate priors (Q537428) (← links)
- Hierarchical subspace models for contingency tables (Q642219) (← links)
- The cost of using decomposable Gaussian graphical models for computational convenience (Q693257) (← links)
- A conjugate prior for discrete hierarchical log-linear models (Q1043747) (← links)
- Canonical and monophonic convexities in hypergraphs (Q1043946) (← links)
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables (Q1775965) (← links)
- Racing trees to query partial data (Q2100239) (← links)
- Rough set-based feature selection for weakly labeled data (Q2237512) (← links)
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases (Q2355167) (← links)
- Experiments in stochastic computation for high-dimensional graphical models (Q2381758) (← links)
- An analytical approach to the inference of summary data of additive type (Q2456376) (← links)
- Computing the integer programming gap (Q2460632) (← links)
- PRIVACY RISK ASSESSMENT WITH BOUNDS DEDUCED FROM BOUNDS (Q3111214) (← links)
- Re‐identification in the Absence of Common Variables for Matching (Q6064358) (← links)
- A new mixed integer programming approach for inverse correspondence analysis (Q6068705) (← links)
- A generalisation of the aggregate association index (AAI): incorporating a linear transformation of the cells of a \(2 \times 2\) table (Q6566357) (← links)