國立虎尾科技大學 |

Causal Inference Under Network Interference : = Network Embedding Matching.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Causal Inference Under Network Interference :/
其他題名:	Network Embedding Matching.
作者:	Zhang, Xu.
面頁冊數:	1 online resource (179 pages)
附註:	Source: Dissertations Abstracts International, Volume: 84-11, Section: B.
Contained By:	Dissertations Abstracts International84-11B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798379546045

Causal Inference Under Network Interference : = Network Embedding Matching.
Zhang, Xu.

Causal Inference Under Network Interference :Network Embedding Matching. - 1 online resource (179 pages)

Source: Dissertations Abstracts International, Volume: 84-11, Section: B.

Thesis (Ph.D.)--Temple University, 2023.

Includes bibliographical references

Causal inference on networks often encounters interference problems. The potential outcomes of a unit depend not only on its treatment but also on the treatments of its neighbors in the network. The classic causal inference assumption of no interference among units is untenable in networks, and many fundamental results in causal inference may no longer hold in the presence of interference. To address interference problems in networks, this thesis proposes a novel Network Embedding Matching (NEM) framework for estimating causal effects under network interference. We recover causal effects based on network structure in an observed network. Furthermore, we extend the network interference from direct neighbors to k-hop neighbors. Unlike most previous studies, which had strong assumptions on interference among units in the network and did not consider network structure, our framework incorporates network structure into the estimation of causal effects. In addition, our NEM framework can be implemented in networks for randomized experiments and observational studies. Our approach is interpretable and can be easily applied to networks. We compare our approach with other existing methods in simulations and real networks, and we show that our approach outperforms other methods under linear and nonlinear network interference.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798379546045Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

Causal inferenceIndex Terms--Genre/Form:

554714
Electronic books.

Causal Inference Under Network Interference : = Network Embedding Matching.
LDR:02748ntm a22004097 4500 001 1141997
005 20240414211917.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798379546045
035 $a (MiAaPQ)AAI30249485
035 $a AAI30249485
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Zhang, Xu. $3 1178970
245 1 0 $a Causal Inference Under Network Interference : $b Network Embedding Matching.
264 0 $c 2023
300 $a 1 online resource (179 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 84-11, Section: B.
500 $a Advisor: Airoldi, Edoardo M.;Karwa, Vishesh.
502 $a Thesis (Ph.D.)--Temple University, 2023.
504 $a Includes bibliographical references
520 $a Causal inference on networks often encounters interference problems. The potential outcomes of a unit depend not only on its treatment but also on the treatments of its neighbors in the network. The classic causal inference assumption of no interference among units is untenable in networks, and many fundamental results in causal inference may no longer hold in the presence of interference. To address interference problems in networks, this thesis proposes a novel Network Embedding Matching (NEM) framework for estimating causal effects under network interference. We recover causal effects based on network structure in an observed network. Furthermore, we extend the network interference from direct neighbors to k-hop neighbors. Unlike most previous studies, which had strong assumptions on interference among units in the network and did not consider network structure, our framework incorporates network structure into the estimation of causal effects. In addition, our NEM framework can be implemented in networks for randomized experiments and observational studies. Our approach is interpretable and can be easily applied to networks. We compare our approach with other existing methods in simulations and real networks, and we show that our approach outperforms other methods under linear and nonlinear network interference.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Statistics. $3 556824
653 $a Causal inference
653 $a Data science
653 $a Interference
653 $a Machine learning
653 $a Network analysis
653 $a Network effects
655 7 $a Electronic books. $2 local $3 554714
690 $a 0463
690 $a 0984
690 $a 0800
710 2 $a Temple University. $b Statistics. $3 1466130
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 84-11B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30249485 $z click for full text (PQDT)