A lattice-based representation of independence relations for efficient closure computation (Q2206476): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Conditional independence structure and its closure: inferential rules and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise representations and construction algorithms for semi-graphoid independency models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigraphoids and structures of probabilistic conditional independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4663408 / rank
 
Normal rank

Revision as of 21:03, 23 July 2024

scientific article
Language Label Description Also known as
English
A lattice-based representation of independence relations for efficient closure computation
scientific article

    Statements

    A lattice-based representation of independence relations for efficient closure computation (English)
    0 references
    0 references
    0 references
    0 references
    22 October 2020
    0 references
    independence relations
    0 references
    representation
    0 references
    lattice-based partitioning
    0 references
    fast-closure computation
    0 references
    algorithm engineering
    0 references

    Identifiers