"An Algorithm for Reading Dependencies from the Minimal Undirected ..."

José M. Peña et al. (2009)

> Home

Details and statistics

DOI: 10.5555/1577069.1577107

access: closed

type: Journal Article

metadata version: 2022-06-02

- view
  - electronic edition @ acm.org
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jmlr/PenaNBT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jmlr/PenaNBT09
José M. Peña, Roland Nilsson, Johan Björkegren, Jesper Tegnér:
An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity. J. Mach. Learn. Res. 10: 1071-1094 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.