The following pages link to Milan Studený (Q277636):
Displaying 50 items.
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- On open questions in the geometric approach to structural learning Bayesian nets (Q541844) (← links)
- A reconstruction algorithm for the essential graph (Q962864) (← links)
- A geometric view on learning Bayesian network structures (Q985149) (← links)
- Racing algorithms for conditional independence inference (Q997057) (← links)
- (Q1193818) (redirect page) (← links)
- Comment on ''A unique formal system for binary decompositions of database relations, probability distributions, and graphs (Q1193819) (← links)
- Conditional independence and natural conditional functions (Q1344261) (← links)
- Semigraphoids and structures of probabilistic conditional independence (Q1370588) (← links)
- On stochastic conditional independence: The problems of characterization and description (Q1601913) (← links)
- Linear criterion for testing the extremity of an exact game based on its finest min-representation (Q1726233) (← links)
- Characterization of inclusion neighbourhood in terms of the essential graph (Q1763167) (← links)
- On chain graph models for description of conditional independence structures (Q1807127) (← links)
- A graphical characterization of the largest chain graphs (Q1807602) (← links)
- A recovery algorithm for chain graphs (Q1809371) (← links)
- Facets of the cone of totally balanced games (Q2009181) (← links)
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture (Q2060774) (← links)
- Facets of the cone of exact games (Q2123120) (← links)
- On irreducible min-balanced set systems (Q2297798) (← links)
- Polyhedral aspects of score equivalence in Bayesian network structure learning (Q2364495) (← links)
- Characteristic imsets for learning Bayesian network structure (Q2375330) (← links)
- Towards using the chordal graph polytope in learning decomposable models (Q2411269) (← links)
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools (Q2440188) (← links)
- Polyhedral approach to statistical learning graphical models (Q2812506) (← links)
- On polyhedral approximations of polytopes for learning Bayesian networks (Q2819996) (← links)
- A linear-algebraic tool for conditional independence inference (Q2820017) (← links)
- Efficient algorithms for conditional independence inference (Q2896194) (← links)
- Polyhedral approaches to learning Bayesian networks (Q2979652) (← links)
- (Q3039625) (← links)
- (Q3093382) (← links)
- Characterization of Inclusion Neighbourhood in Terms of the Essential Graph: Upper Neighbours (Q3550867) (← links)
- (Q3595870) (← links)
- (Q3637504) (← links)
- (Q3798024) (← links)
- (Q3821339) (← links)
- (Q4035210) (← links)
- (Q4209487) (← links)
- (Q4217797) (← links)
- (Q4281799) (← links)
- STRUCTURAL SEMIGRAPHOIDS<sup>1</sup> (Q4296635) (← links)
- (Q4395397) (← links)
- (Q4500373) (← links)
- (Q4663408) (← links)
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts<sup>1</sup> (Q4861641) (← links)
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 2nd part: basic theory (Q4861645) (← links)
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 3rd part: examples of use and appendices<sup>1</sup> (Q4861653) (← links)
- Conditional Independences among Four Random Variables I (Q4862747) (← links)
- Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities (Q5032554) (← links)
- (Q5224812) (← links)
- (Q5384950) (← links)
