#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1950

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Facundo Bromberg, Dimitris Margaritis, Vasant Honavar
- J. Artif. Intell. Res.
- 2006

We present two algorithms for learning the structure of a Markov network from data: GSMN* and GSIMN. Both algorithms use statistical independence tests to infer the structure by successively constraining the set of structures consistent with the results of these tests. Until very recently, algorithms for structure learning were based on maximum likelihood… (More)

- Facundo Bromberg, Dimitris Margaritis
- Journal of Machine Learning Research
- 2009

We address the problem of improving the reliability of independence-based causal discovery algorithms that results from the execution of statistical independence tests on small data sets, which typically have low reliability. We model the problem as a knowledge base containing a set of independence facts that are related through Pearl’s well-known axioms.… (More)

- Dimitris Margaritis, Facundo Bromberg
- Computational Intelligence
- 2009

In this paper we introduce an efficient independence-based algorithm for the induction of the Markov network structure of a domain from the outcomes of independence test conducted on data. Our algorithm utilizes a particle filter (sequential Monte Carlo) method to maintain a population of Markov network structures that represent the posterior probability… (More)

- Carlos Catania, Facundo Bromberg, Carlos García Garino
- Expert Syst. Appl.
- 2012

In the past years, several support vector machines (SVM) novelty detection approaches have been applied on the network intrusion detection field. The main advantage of these approaches is that they can characterize normal traffic even when trained with datasets containing not only normal traffic but also a number of attacks. Unfortunately, these algorithms… (More)

- Diego Sebastián Pérez, Facundo Bromberg, Carlos Ariel Diaz
- Computers and Electronics in Agriculture
- 2017

- Facundo Bromberg, Dimitris Margaritis
- IJCAI
- 2007

In this paper we introduce a novel algorithm for the induction of the Markov network structure of a domain from the outcome of conditional independence tests on data. Such algorithms work by successively restricting the set of possible structures until there is only a single structure consistent with the conditional independence tests executed. Existing… (More)

- M H Saier, F G Bromberg, S Roseman
- Journal of bacteriology
- 1973

Salmonella typhimurium strains, lacking both enzyme I and the phosphocarrier protein, HPr, of the phosphoenolpyruvate-sugar phosphotransferase system, cannot transport or metabolize glucose and other sugar substrates of this enzyme system. Mutants which regain the ability to specifically utilize glucose were found to constitutively synthesize a galactose… (More)

In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for learning the structure of the Markov network of a domain from independence tests on data. DGSIMN, like other independence-based algorithms, works by conducting a series of… (More)

- Federico Schlüter, Facundo Bromberg, Alejandro Edera
- Annals of Mathematics and Artificial Intelligence
- 2014

In this work we consider the problem of learning the structure of Markov networks from data. We present an approach for tackling this problem called IBMAP, together with an efficient instantiation of the approach: the IBMAP-HC algorithm, designed for avoiding important limitations of existing independence-based algorithms. These algorithms proceed by… (More)

- Alejandro Edera, Facundo Bromberg, Federico Schlüter
- ArXiv
- 2013

Markov random fields provide a compact representation of joint probability distributions by representing its independence properties in an undirected graph. The well-known Hammersley-Clifford theorem uses these conditional independences to factorize a Gibbs distribution into a set of factors. However, an important issue of using a graph to represent… (More)