Characterisation of conditional independence structures for polymatroids using vanishing sets

Terence Chan; Qi Chen; Raymond Yeung

Kybernetika (2020)

  • Volume: 56, Issue: 6, page 1022-1044
  • ISSN: 0023-5954

Abstract

top
In this paper, we characterise and classify a list of full conditional independences via the structure of the induced set of vanishing atoms. Construction of Markov random subfield and minimal characterisation of polymatroids satisfying a MRF will also be given.

How to cite

top

Chan, Terence, Chen, Qi, and Yeung, Raymond. "Characterisation of conditional independence structures for polymatroids using vanishing sets." Kybernetika 56.6 (2020): 1022-1044. <http://eudml.org/doc/297112>.

@article{Chan2020,
abstract = {In this paper, we characterise and classify a list of full conditional independences via the structure of the induced set of vanishing atoms. Construction of Markov random subfield and minimal characterisation of polymatroids satisfying a MRF will also be given.},
author = {Chan, Terence, Chen, Qi, Yeung, Raymond},
journal = {Kybernetika},
keywords = {full conditional independence; markov random field; polymatroids},
language = {eng},
number = {6},
pages = {1022-1044},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Characterisation of conditional independence structures for polymatroids using vanishing sets},
url = {http://eudml.org/doc/297112},
volume = {56},
year = {2020},
}

TY - JOUR
AU - Chan, Terence
AU - Chen, Qi
AU - Yeung, Raymond
TI - Characterisation of conditional independence structures for polymatroids using vanishing sets
JO - Kybernetika
PY - 2020
PB - Institute of Information Theory and Automation AS CR
VL - 56
IS - 6
SP - 1022
EP - 1044
AB - In this paper, we characterise and classify a list of full conditional independences via the structure of the induced set of vanishing atoms. Construction of Markov random subfield and minimal characterisation of polymatroids satisfying a MRF will also be given.
LA - eng
KW - full conditional independence; markov random field; polymatroids
UR - http://eudml.org/doc/297112
ER -

References

top
  1. Blake, A., Kohli, P., Rother, C., , MIT Press, 2011. MR2920522DOI
  2. Chan, T. H., Thakor, S., Grant, A., , IEEE Trans. Inform. Theory 65 (2019), 7, 4041-4051. MR3964839DOI
  3. Chen, M., Cho, J., Zhao, H., , PLOS Genetics 7 (2011), 1-13. DOI
  4. Doyle, L. E., Kokaram, A. C., Doyle, S. J., Forde, T. K., , IEEE Signal Process. Mag. 23 (2006), 63-73. DOI
  5. Geiger, D., Pearl, J., , Ann. Statist. 21 (1993), 4, 2001-2021. MR1245778DOI
  6. Malvestuto, F., , Inform. Sci. 59 (1992), 1, 21-52. MR1128204DOI
  7. Snijders, T. A., , Ann. Rev. Sociology 37 (2011), 1, 131-153. MR3074604DOI
  8. Wang, T., Krim, H., Viniotis, Y., , IEEE J. Selected Topics Signal Process. 7 (2013), 318-332. DOI
  9. Yeung, R. W., , IEEE Trans. Inform. Theory 37 (1991), 466-474. MR1145812DOI
  10. Yeung, R. W., Information Theory and Network Coding., Springer, 2008. 
  11. Yeung, R. W., Al-Bashabsheh, A., Chen, C., Chen, Q., Moulin, P., , IEEE Trans. Inform. Theory 65 (2019), 1493-1511. MR3923182DOI
  12. Yeung, R. W., Lee, T. T., Ye, Z., , IEEE Trans. Inform. Theory 48 (2002), 1996-2011. MR1930006DOI

NotesEmbed ?

top

You must be logged in to post comments.