 | 2009 |
|---|
| 25 |       | Milan Studený,
Jirí Vomlel:
A reconstruction algorithm for the essential graph.
Int. J. Approx. Reasoning 50(2): 385-413 (2009) |
| 2008 |
|---|
| 24 | | Milan Studený,
Jirí Vomlel:
Editorial Note.
Int. J. Approx. Reasoning 49(2): 344 (2008) |
| 2007 |
|---|
| 23 | | Remco R. Bouckaert,
Milan Studený:
Racing algorithms for conditional independence inference.
Int. J. Approx. Reasoning 45(2): 386-401 (2007) |
| 2006 |
|---|
| 22 |  | Milan Studený,
Jirí Vomlel:
Third European Workshop on Probabilistic Graphical Models, 12-15 September 2006, Prague, Czech Republic. Electronic Proceedings.
Probabilistic Graphical Models 2006 |
| 21 | | Alberto Roverato,
Milan Studený:
A Graphical Representation of Equivalence Classes of AMP Chain Graphs.
Journal of Machine Learning Research 7: 1045-1078 (2006) |
| 2005 |
|---|
| 20 | | Remco R. Bouckaert,
Milan Studený:
Racing for Conditional Independence Inference.
ECSQARU 2005: 221-232 |
| 19 | | Milan Studený:
Characterization of inclusion neighbourhood in terms of the essential graph.
Int. J. Approx. Reasoning 38(3): 283-309 (2005) |
| 2004 |
|---|
| 18 | | Milan Studený:
Characterization Of Essential Graphs By Means Of The Operation Of Legal Merging Of Components.
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 12(Supplement-1): 43-62 (2004) |
| 2003 |
|---|
| 17 | | Milan Studený:
Characterization of Inclusion Neighbourhood in Terms of the Essential Graph: Uper Neighbours.
ECSQARU 2003: 161-172 |
| 2002 |
|---|
| 16 | | Milan Studený:
Characterization of Essential Graphs by Means of an Operation of Legal Component Merging.
Probabilistic Graphical Models 2002 |
| 15 | | Milan Studený:
On Stochastic Conditional Independence: the Problems of Characterization and Description.
Ann. Math. Artif. Intell. 35(1-4): 323-341 (2002) |
| 2001 |
|---|
| 14 | | Tomás Kocka,
Remco R. Bouckaert,
Milan Studený:
On characterizing Inclusion of Bayesian Networks.
UAI 2001: 261-268 |
| 2000 |
|---|
| 13 | | Azaria Paz,
Robert Y. Geva,
Milan Studený:
Representation of Irrelevance Relations by Annotated Graphs.
Fundam. Inform. 42(2): 149-199 (2000) |
| 1999 |
|---|
| 12 | | Martin Volf,
Milan Studený:
A graphical characterization of the largest chain graphs.
Int. J. Approx. Reasoning 20(3): 209-236 (1999) |
| 1998 |
|---|
| 11 | | Milan Studený:
Bayesian Networks from the Point of View of Chain Graphs.
UAI 1998: 496-503 |
| 1997 |
|---|
| 10 | | Milan Studený:
Semigraphoids and Structures of Probabilistic Conditional Independence.
Ann. Math. Artif. Intell. 21(1): 71-98 (1997) |
| 9 | | Milan Studený:
A recovery algorithm for chain graphs.
Int. J. Approx. Reasoning 17(2-3): 265-293 (1997) |
| 1996 |
|---|
| 8 | | Milan Studený:
On Separation Criterion and Recovery Algorithm for Chain Graphs.
UAI 1996: 509-516 |
| 1995 |
|---|
| 7 | | Remco R. Bouckaert,
Milan Studený:
Chain graphs: semantics and expressiveness.
ECSQARU 1995: 69-76 |
| 6 | | Frantisek Matús,
Milan Studený:
Conditional Independences among Four Random Variables 1.
Combinatorics, Probability & Computing 4: 269-278 (1995) |
| 5 | | Milan Studený:
Conditional independence and natural conditional functions.
Int. J. Approx. Reasoning 12(1): 43-68 (1995) |
| 1994 |
|---|
| 4 | | Milan Studený:
Marginal Problem in Different Calculi of AI.
IPMU 1994: 348-359 |
| 3 | | Milan Studený:
Semigraphoids Are Two-Antecedental Approximations of Stochastic Conditional Independence Models.
UAI 1994: 546-552 |
| 1993 |
|---|
| 2 | | Milan Studený:
Formal Properties of Conditional Independence in Different Calculi of AI.
ECSQARU 1993: 341-348 |
| 1992 |
|---|
| 1 | | Francesco M. Malvestuto,
Milan Studený:
Comment on "A unique formal system for binary decompositions of database relations, probability distributions, and graphs".
Inf. Sci. 63(1-2): 1-2 (1992) |
