{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:43:53Z","timestamp":1740120233601,"version":"3.37.3"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61573266","61602010","11626034"],"award-info":[{"award-number":["61573266","61602010","11626034"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Foundation of the Doctoral Scientific Research of Baoji University of Arts","award":["ZK2017020"],"award-info":[{"award-number":["ZK2017020"]}]},{"name":"Foundation of Baoji City Guidance plan for scientific and technological innovation","award":["2017JH2-23","2018JH-19"],"award-info":[{"award-number":["2017JH2-23","2018JH-19"]}]},{"name":"Scientific Research Program Funded by Shaanxi Provincial Education Department","award":["18JK0045"],"award-info":[{"award-number":["18JK0045"]}]},{"name":"Natural Science Major Research Plan in Shaanxi Province","award":["2018ZKC-115","2018ZKC-023"],"award-info":[{"award-number":["2018ZKC-115","2018ZKC-023"]}]},{"name":"Shaanxi Social Science Major Theoretical and Practical Issues Research Project in 2019","award":["2019C003"],"award-info":[{"award-number":["2019C003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> Learning ancestor graph is a typical NP-hard problem. We consider the problem to represent a Markov equivalence class of ancestral graphs with a compact representation. Firstly, the minimal essential graph is defined to represent the equivalent class of maximal ancestral graphs with the minimum number of invariant arrowheads. Then, an algorithm is proposed to learn the minimal essential graph of ancestral graphs based on the detection of minimal collider paths. It is the first algorithm to use necessary and sufficient conditions for Markov equivalence as a base to seek essential graphs. Finally, a set of orientation rules is presented to orient edge marks of a minimal essential graph. Theory analysis shows our algorithm is sound, and complete in the sense of recognizing all minimal collider paths in a given ancestral graph. And the experiment results show we can discover all invariant marks by these orientation rules. <\/jats:p>","DOI":"10.1142\/s0218001420590090","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T06:37:40Z","timestamp":1558075060000},"page":"2059009","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing the Minimal Essential Graphs of Maximal Ancestral Graphs"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4521-9279","authenticated-orcid":false,"given":"Yanying","family":"Li","sequence":"first","affiliation":[{"name":"College of Mathematics and Information Science, Baoji University of Arts and Sciences Baoji, 721013 P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,8,5]]},"reference":[{"key":"S0218001420590090BIB002","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS626"},{"key":"S0218001420590090BIB004","first-page":"10","author":"Ali A. R.","year":"2005","journal-title":"UAI \u201905 Proc. 21th Conf. Uncertainty in Artificial Intelligence"},{"key":"S0218001420590090BIB005","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1031833662"},{"key":"S0218001420590090BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.03.003"},{"key":"S0218001420590090BIB007","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001419590055"},{"key":"S0218001420590090BIB008","first-page":"87","volume-title":"Eleventh Conf. Uncertainty in Artificial Intelligence","author":"Chickering D. M.","year":"1995"},{"key":"S0218001420590090BIB009","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS940"},{"key":"S0218001420590090BIB010","first-page":"140","volume-title":"Proc. Fifth Int. Workshop on Artificial Intelligence and Statistics","author":"Cooper G. F.","year":"1995"},{"key":"S0218001420590090BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1087-2"},{"key":"S0218001420590090BIB012","first-page":"130","volume-title":"UAI \u201904 Proc. 20th Conf. Uncertainty in Artificial Intelligence","author":"Drton M.","year":"2012"},{"key":"S0218001420590090BIB013","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1206"},{"key":"S0218001420590090BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2013.12.005"},{"key":"S0218001420590090BIB015","first-page":"333","author":"Frydenberg M.","year":"1990","journal-title":"Scandinavian J. Stat."},{"issue":"4","key":"S0218001420590090BIB016","first-page":"1550012: 1","volume":"24","author":"Li Y.","year":"2015","journal-title":"Int. J. Artifi. Intell. Tools"},{"key":"S0218001420590090BIB017","doi-asserted-by":"publisher","DOI":"10.1142\/S021821301350005X"},{"key":"S0218001420590090BIB018","first-page":"403","volume-title":"Eleventh Conf. Uncertainty in Artificial Intelligence","author":"Meek C.","year":"1995"},{"key":"S0218001420590090BIB019","first-page":"1249","volume-title":"Int. Conf. Neural Information Processing Systems","author":"Pellet J. P.","year":"2008"},{"key":"S0218001420590090BIB020","first-page":"462","volume-title":"Conf. Uncertainty in Artificial Intelligence","author":"Richardson T. S.","year":"2009"},{"key":"S0218001420590090BIB021","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1031689015"},{"key":"S0218001420590090BIB022","first-page":"489","volume-title":"Proc. 6th Int. Workshop on Artificial Intelligence and Statistics","author":"Spirtes P.","year":"1996"},{"issue":"1","key":"S0218001420590090BIB023","first-page":"121","author":"Spirtes P.","year":"2001","journal-title":"Philosophy"},{"key":"S0218001420590090BIB024","first-page":"499","volume-title":"Proc. Eleventh Conf. Uncertainty in Artificial Intelligence","author":"Spirtes P.","year":"1995"},{"key":"S0218001420590090BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.09.001"},{"key":"S0218001420590090BIB026","first-page":"591","volume-title":"21th Conf. Uncertainty in Artif. Intell.","author":"Tian","year":"2005"},{"key":"S0218001420590090BIB027","first-page":"255","volume-title":"Conf. Uncertainty in Artificial Intelligence","author":"Verma T.","year":"1990"},{"issue":"3","key":"S0218001420590090BIB028","first-page":"1437","volume":"9","author":"Zhang J.","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"S0218001420590090BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.08.001"},{"key":"S0218001420590090BIB030","first-page":"10","author":"Zhang Jiji","year":"2005","journal-title":"Comput. Sci."},{"issue":"2","key":"S0218001420590090BIB031","first-page":"2308","volume":"12","author":"Zhang J.","year":"2005","journal-title":"J. Korean Chem. Soc."},{"key":"S0218001420590090BIB032","doi-asserted-by":"publisher","DOI":"10.1360\/04ys0023"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001420590090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T10:49:21Z","timestamp":1588934961000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001420590090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,5]]},"references-count":30,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S0218001420590090"],"URL":"https:\/\/doi.org\/10.1142\/s0218001420590090","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"type":"print","value":"0218-0014"},{"type":"electronic","value":"1793-6381"}],"subject":[],"published":{"date-parts":[[2019,8,5]]}}}