QQ客服 官方微博 反馈留言

	Decomposition of search for nu-structures in DAGs
	Geng, Z ; Wang, C ; Zhao, Q
	2005
关键词	decomposition directed acyclic graph moral graph v-structure CONTINGENCY-TABLES INTERACTION MODELS GRAPHICAL MODELS MARKOV-FIELDS MISSING DATA INDEPENDENCE ALGORITHM
英文摘要	We show that the problem of searching for v-structures in a directed acyclic graph can be decomposed into searches in its decomposed subgraphs. This result simplifies the search for v-structures and the recovery of local causal relationships. (c) 2004 Elsevier Inc. All rights reserved.; Statistics & Probability; SCI(E); 8; ARTICLE; 2; 282-294; 96
语种	英语
出处	SCI
出版者	多变量分析杂志
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/157956]
专题	数学科学学院
推荐引用方式 GB/T 7714	Geng, Z,Wang, C,Zhao, Q. Decomposition of search for nu-structures in DAGs. 2005-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。