Structural learning about directed acyclic graphs from multiple databases (Q1938242): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58695591 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/579543 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116405250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of Homogeneous Spaces in Prime Characteristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilities of causation: Bounds and identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causation, prediction, and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of structural learning about directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ancestral graph Markov models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Graphical Models with Missing Data and the Partial Imputation EM Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217798 / rank
 
Normal rank

Latest revision as of 04:44, 6 July 2024

scientific article
Language Label Description Also known as
English
Structural learning about directed acyclic graphs from multiple databases
scientific article

    Statements

    Structural learning about directed acyclic graphs from multiple databases (English)
    0 references
    0 references
    0 references
    4 February 2013
    0 references
    Summary: We propose an approach for structural learning of directed acyclic graphs from multiple databases. We first learn a local structure from each database separately, and then we combine these local structures together to construct a global graph over all variables. In our approach, we do not require conditional independence, which is a basic assumption in most methods.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references