A Divide-and-Conquer Algorithm for Generating Markov Bases of Multi-way Tables

被引：0
|
作者：
Adrian Dobra
Seth Sullivant
机构：
[1] Duke University,Institute of Statistics and Decision Sciences and Department of Molecular Genetics & Microbiology
[2] University of California,Department of Mathematics
来源：
Computational Statistics | 2004年 / 19卷
关键词：
Contingency tables; Decomposable graphical models; Disclosure limitation; Exact distributions; Gröbner bases; Markov bases;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We describe a divide-and-conquer technique for generating a Markov basis that connects all tables of counts having a fixed set of marginal totals. This procedure is based on decomposing the independence graph induced by these marginals. We discuss the practical imports of using this method in conjunction with other algorithms for determining Markov bases.
引用
收藏
页码：347 / 366
页数：19
相关论文
共 50 条
  • [31] A general and efficient divide-and-conquer algorithm framework for multi-core clusters
    Gonzalez, Carlos H.
    Fraguela, Basilio B.
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2017, 20 (03): : 2605 - 2626
  • [32] A FASTER DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING DELAUNAY TRIANGULATIONS
    DWYER, RA
    ALGORITHMICA, 1987, 2 (02) : 137 - 151
  • [33] Divide-and-Conquer Learning with Nystrom: Optimal Rate and Algorithm
    Yin, Rong
    Liu, Yong
    Lu, Lijing
    Wang, Weiping
    Meng, Dan
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 6696 - 6703
  • [34] A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers
    Wang, H
    Guo, MY
    Wei, DM
    JOURNAL OF SUPERCOMPUTING, 2004, 29 (02): : 157 - 170
  • [35] A DIVIDE-AND-CONQUER ALGORITHM FOR COMPUTING SINGULAR-VALUES
    CHANDRASEKARAN, S
    IPSEN, ICF
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1994, 74 (06): : T532 - T534
  • [36] AN ACCELERATED DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD PROBLEM
    Li, Shengguo
    Gu, Ming
    Cheng, Lizhi
    Chi, Xuebin
    Sun, Meng
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2014, 35 (03) : 1038 - 1057
  • [37] ON A PROPOSED DIVIDE-AND-CONQUER MINIMAL SPANNING TREE ALGORITHM
    STOJMENOVIC, I
    LANGSTON, MA
    BIT, 1988, 28 (04): : 785 - 791
  • [38] A DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING RELATIVE NEIGHBORHOOD GRAPH
    HUANG, NF
    BIT, 1990, 30 (02): : 196 - 206
  • [39] A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers
    Hui Wang
    Minyi Guo
    Daming Wei
    The Journal of Supercomputing, 2004, 29 : 157 - 170
  • [40] Divide-and-conquer algorithm for computing set containment joins
    Melnik, S
    Garcia-Molina, H
    ADVANCES IN DATABASE TECHNOLOGY - EDBT 2002, 2002, 2287 : 427 - 444
12345