{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/139983"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/139983","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Latent Clustered Causal Models","abstract":"We consider the problem of learning directed graphical models in the presence of latent variables. We define latent clustered causal models as a particular restriction on directed graphical models with latent variables and corresponding clusters of observed nodes, characterized by edges between only observed and latent variables. We discuss this model’s particular applicability towards genomics applications and examine its relationship to prior causal structure recovery work. We show identifiability results on this model and design a consistent three-stage algorithm that discovers clusters of observed nodes, a partial ordering over clusters, and finally, the entire structure over both observed and latent nodes. We also evaluate our method on synthetic datasets and demonstrate its performance in low sample-size regimes.","abstract_html":"We consider the problem of learning directed graphical models in the presence of latent variables. We define latent clustered causal models as a particular restriction on directed graphical models with latent variables and corresponding clusters of observed nodes, characterized by edges between only observed and latent variables. We discuss this model’s particular applicability towards genomics applications and examine its relationship to prior causal structure recovery work. We show identifiability results on this model and design a consistent three-stage algorithm that discovers clusters of observed nodes, a partial ordering over clusters, and finally, the entire structure over both observed and latent nodes. We also evaluate our method on synthetic datasets and demonstrate its performance in low sample-size regimes.","abstract_has_math":false,"creators":["Yun, Annie"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Uhler, Caroline"],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-09","date_published":"2021-09","updated_at":"2026-07-22T22:20:47Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/139983","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Uhler, Caroline"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Yun, Annie"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-02-07T15:17:09Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-02-07T15:17:09Z"]},{"key":"dc:date.issued","label":"Date","values":["2021-09"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/139983"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We consider the problem of learning directed graphical models in the presence of latent variables. We define latent clustered causal models as a particular restriction on directed graphical models with latent variables and corresponding clusters of observed nodes, characterized by edges between only observed and latent variables. We discuss this model’s particular applicability towards genomics applications and examine its relationship to prior causal structure recovery work. We show identifiability results on this model and design a consistent three-stage algorithm that discovers clusters of observed nodes, a partial ordering over clusters, and finally, the entire structure over both observed and latent nodes. We also evaluate our method on synthetic datasets and demonstrate its performance in low sample-size regimes."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Latent Clustered Causal Models"]}]}],"canonical_facts":{"dc:contributor.advisor":["Uhler, Caroline"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Yun, Annie"],"dc:date.accessioned":["2022-02-07T15:17:09Z"],"dc:date.available":["2022-02-07T15:17:09Z"],"dc:date.issued":["2021-09"],"dc:description.abstract":["We consider the problem of learning directed graphical models in the presence of latent variables. We define latent clustered causal models as a particular restriction on directed graphical models with latent variables and corresponding clusters of observed nodes, characterized by edges between only observed and latent variables. We discuss this model’s particular applicability towards genomics applications and examine its relationship to prior causal structure recovery work. We show identifiability results on this model and design a consistent three-stage algorithm that discovers clusters of observed nodes, a partial ordering over clusters, and finally, the entire structure over both observed and latent nodes. We also evaluate our method on synthetic datasets and demonstrate its performance in low sample-size regimes."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/139983"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Latent Clustered Causal Models"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:20:47Z"}