✦ LIBER ✦

Clustering the rows and columns of a contingency table

✍ Scribed by Michael J. Greenacre

Book ID: 105394061
Publisher: Springer
Year: 1988
Tongue: English
Weight: 941 KB
Volume: 5
Category: Article
ISSN: 0176-4268
DOI: 10.1007/bf01901670

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clustering of contingency table and mixt

Clustering of contingency table and mixture model

✍ Gérard Govaert; Mohamed Nadif 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Convergence of rows of the Padé table

✍ George A Baker Jr.; P.R Graves-Morris 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 710 KB

A Simple Test of Association for Conting

A Simple Test of Association for Contingency Tables with Multiple Column Responses

✍ Y. J. Decady; D. R. Thomas 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

Rapidly Mixing Markov Chains for Samplin

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

✍ Cryan, Mary; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Martin, Russell 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 335 KB

A series of triangular PBIB designs with

A series of triangular PBIB designs with nested rows and columns

✍ Kishore Sinha; Sanpei Kageyama 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 89 KB

A polynomial-time algorithm to approxima

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

✍ Mary Cryan; Martin Dyer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 232 KB

We consider the problem of counting the number of contingency tables with given row and column sums. This problem is known to be #P-complete, even when there are only two rows (Random Structures Algorithms 10(4) (1997) 487). In this paper we present the first fully polynomial randomized approximatio