Journal article
Faster algorithms for Markov equivalence
- Abstract:
-
Maximal ancestral graphs (MAGs) have many desirable properties; in particular they can fully describe conditional independences from directed acyclic graphs (DAGs) in the presence of latent and selection variables. However, different MAGs may encode the same conditional independences, and are said to be \emph{Markov equivalent}. Thus identifying necessary and sufficient conditions for equivalence is essential for structure learning. Several criteria for this already exist, but in this paper w...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Version of record, 212.9KB)
-
- Publication website:
- http://proceedings.mlr.press/v124/hu20a.html
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Journal of Machine Learning Research Publisher's website
- Pages:
- 739-748
- Series:
- Proceedings of Machine Learning Research
- Series number:
- 124
- Publication date:
- 2020-06-08
- Acceptance date:
- 2020-05-14
- Event title:
- 36th Conference on Uncertainty in Artificial Intelligence (UAI)
- Event location:
- Virtual event
- Event website:
- http://www.auai.org/uai2020/
- Event start date:
- 2020-08-03T00:00:00Z
- Event end date:
- 2020-08-06T00:00:00Z
- ISSN:
-
2640-3498
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
1176178
- Local pid:
- pubs:1176178
- Deposit date:
- 2021-05-12
Terms of use
- Copyright holder:
- Zhongyi Hu and Robin Evans
- Copyright date:
- 2020
- Rights statement:
- Β© The Authors 2020.
- Notes:
- This paper was presented at the 36th Conference on Uncertainty in Artificial Intelligence (UAI), 3-6 August 2020, Virtual event. This is the publisher's version of the paper. The final version is available online from the Proceedings of Machine Learning Research at: http://proceedings.mlr.press/v124/hu20a.html
If you are the owner of this record, you can report an update to it here: Report update to this record