{"id":1010,"date":"2021-06-03T06:07:29","date_gmt":"2021-06-03T06:07:29","guid":{"rendered":"http:\/\/jsr.isrt.ac.bd\/?post_type=article&#038;p=1010"},"modified":"2021-06-03T06:08:47","modified_gmt":"2021-06-03T06:08:47","slug":"searching-across-markov-equivalent-directed-acyclic-graph-models","status":"publish","type":"article","link":"http:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/","title":{"rendered":"Searching Across Markov Equivalent Directed Acyclic Graph Models"},"content":{"rendered":"<p>Learning the structure of a process that can be represented by a directed acyclic graph (DAG) based on data alone can be a challenging problem because many graphs may encode the same conditional independence relations. However, searching across equivalence classes can greatly reduce the search space, thereby making the search more e\ufb03cient. This paper presents the DECS algorithm, which is an extension of Edwards and Havernack\u2019s EH-procedure (Edwards, 1995) for undirected graphs to DAG equivalence classes. We also provide necessary graphical criterion for the DAG submodel relation and prove its su\ufb03ciency in special cases. This criterion facilitates the moves made across equivalence classes in the search space. Finally, the DECS algorithm is demonstrated on real data sets.<\/p>\n<p><a href=\"http:\/\/jsr.isrt.ac.bd\/wp-content\/uploads\/v42n2_17.pdf\">Fulltext<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Learning the structure of a process that can be represented by a directed acyclic graph (DAG) based on data alone can be a challenging problem because many graphs may encode the same conditional independence relations. However, searching across equivalence classes can greatly reduce the search space, thereby making the search more e\ufb03cient. This paper presents [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","format":"standard","meta":{"_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"issuem_issue":[15],"issuem_issue_categories":[],"issuem_issue_tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v22.7 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Searching Across Markov Equivalent Directed Acyclic Graph Models - JSR<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Searching Across Markov Equivalent Directed Acyclic Graph Models - JSR\" \/>\n<meta property=\"og:description\" content=\"Learning the structure of a process that can be represented by a directed acyclic graph (DAG) based on data alone can be a challenging problem because many graphs may encode the same conditional independence relations. However, searching across equivalence classes can greatly reduce the search space, thereby making the search more e\ufb03cient. This paper presents [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/\" \/>\n<meta property=\"og:site_name\" content=\"JSR\" \/>\n<meta property=\"article:modified_time\" content=\"2021-06-03T06:08:47+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/\",\"url\":\"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/\",\"name\":\"Searching Across Markov Equivalent Directed Acyclic Graph Models - JSR\",\"isPartOf\":{\"@id\":\"https:\/\/jsr.isrt.ac.bd\/#website\"},\"datePublished\":\"2021-06-03T06:07:29+00:00\",\"dateModified\":\"2021-06-03T06:08:47+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jsr.isrt.ac.bd\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Articles\",\"item\":\"https:\/\/jsr.isrt.ac.bd\/article\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Searching Across Markov Equivalent Directed Acyclic Graph Models\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jsr.isrt.ac.bd\/#website\",\"url\":\"https:\/\/jsr.isrt.ac.bd\/\",\"name\":\"JSR\",\"description\":\"Journal of Statistical Research\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jsr.isrt.ac.bd\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Searching Across Markov Equivalent Directed Acyclic Graph Models - JSR","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/","og_locale":"en_US","og_type":"article","og_title":"Searching Across Markov Equivalent Directed Acyclic Graph Models - JSR","og_description":"Learning the structure of a process that can be represented by a directed acyclic graph (DAG) based on data alone can be a challenging problem because many graphs may encode the same conditional independence relations. However, searching across equivalence classes can greatly reduce the search space, thereby making the search more e\ufb03cient. This paper presents [&hellip;]","og_url":"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/","og_site_name":"JSR","article_modified_time":"2021-06-03T06:08:47+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/","url":"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/","name":"Searching Across Markov Equivalent Directed Acyclic Graph Models - JSR","isPartOf":{"@id":"https:\/\/jsr.isrt.ac.bd\/#website"},"datePublished":"2021-06-03T06:07:29+00:00","dateModified":"2021-06-03T06:08:47+00:00","breadcrumb":{"@id":"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jsr.isrt.ac.bd\/article\/searching-across-markov-equivalent-directed-acyclic-graph-models\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jsr.isrt.ac.bd\/"},{"@type":"ListItem","position":2,"name":"Articles","item":"https:\/\/jsr.isrt.ac.bd\/article\/"},{"@type":"ListItem","position":3,"name":"Searching Across Markov Equivalent Directed Acyclic Graph Models"}]},{"@type":"WebSite","@id":"https:\/\/jsr.isrt.ac.bd\/#website","url":"https:\/\/jsr.isrt.ac.bd\/","name":"JSR","description":"Journal of Statistical Research","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jsr.isrt.ac.bd\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/article\/1010"}],"collection":[{"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/article"}],"about":[{"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/types\/article"}],"author":[{"embeddable":true,"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/comments?post=1010"}],"version-history":[{"count":0,"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/article\/1010\/revisions"}],"wp:attachment":[{"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/media?parent=1010"}],"wp:term":[{"taxonomy":"issuem_issue","embeddable":true,"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/issuem_issue?post=1010"},{"taxonomy":"issuem_issue_categories","embeddable":true,"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/issuem_issue_categories?post=1010"},{"taxonomy":"issuem_issue_tags","embeddable":true,"href":"http:\/\/jsr.isrt.ac.bd\/wp-json\/wp\/v2\/issuem_issue_tags?post=1010"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}