Discovering a junction tree behind a Markov network by a greedy algorithm - Tamás Szántai; Edith Kovács (CoRR, 2011)

Vine copulas as a mean for the construction of high dimensional probability distribution associated to a Markov Network - Edith Kovács; Tamás Szántai (CoRR, 2011)

Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution. - Tamás Szántai; Edith Kovács (Ann. Oper. Res., 2012)

Cluster analysis by exploiting conditional independences. - Tamás Szántai; Edith Kovács (SACI, 2013)

Discovering the Markov network structure. - Edith Kovács; Tamás Szántai (CoRR, 2013)

On the connection between cherry-tree copulas and truncated R-vine copulas. - Edith Kovács; Tamás Szántai (Kybernetika, 2017)

Copula-Based Anomaly Scoring and Localization for Large-Scale, High-Dimensional Continuous Data. - Gábor Horváth 002; Edith Kovács; Roland Molontay; Szabolcs Nováczki (ACM Trans. Intell. Syst. Technol., 2020)