#### Filter Results:

- Full text PDF available (170)

#### Publication Year

1994

2017

- This year (9)
- Last 5 years (56)
- Last 10 years (111)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Fábio Gagliardi Cozman
- Artif. Intell.
- 2000

Overview Graphical models: basic definitions and applications. Inference and learning in credal networks. Quick break: software packages. Formal definitions and computational complexity. Applications. Later Exact and approximate algorithms for reasoning. Agenda Some motivation Graph-theoretical statistical models, directed and undirected Bayesian networks… (More)

- Fábio Gagliardi Cozman
- Int. J. Approx. Reasoning
- 2005

This paper analyzes the performance of semisupervised learning of mixture models. We show that unlabeled data can lead to an increase in classification error even in situations where additional labeled data would decrease classification error. We present a mathematical analysis of this “degradation” phenomenon and show that it is due to the fact that bias… (More)

Understanding human emotions is one of the necessary skills for the computer to interact intelligently with human users. The most expressive way humans display emotions is through facial expressions. In this paper, we report on several advances we have made in building a system for classification of facial expressions from continuous video input. We use… (More)

A credal network is a graphical tool for representation and manipulation of uncertainty, where probability values may be imprecise or indeterminate. A credal network associates a directed acyclic graph with a collection of sets of probability measures; in this context, inference is the computation of tight lower and upper bounds for conditional… (More)

We present new algorithms for inference in credal networksdirected acyclic graphs asso ciated with sets of probabilities. Credal networks are here interpreted as encoding strong indepen dence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with… (More)

- Ira Cohen, Fábio Gagliardi Cozman, Nicu Sebe, Marcelo Cesar Cirelo, Thomas S. Huang
- IEEE Transactions on Pattern Analysis and Machine…
- 2004

Automatic classification is one of the basic tasks required in any pattern recognition and human computer interaction application. In this paper, we discuss training probabilistic classifiers with labeled and unlabeled data. We provide a new analysis that shows under what conditions unlabeled data can be used in learning to improve classification… (More)

- Cassio Polpo de Campos, Fábio Gagliardi Cozman
- IJCAI
- 2005

This paper presents new results on the complexity of graph-theoretical models that represent probabilities (Bayesian networks) and that represent interval and set valued probabilities (credal networks). We define a new class of networks with bounded width, and introduce a new decision problem for Bayesian networks, the maximin a posteriori. We present new… (More)

- Jaime Shinsuke Ide, Fábio Gagliardi Cozman
- SBIA
- 2002

This paper presents new methods for generation of random Bayesian networks. Such methods can be used to test inference and learning algorithms for Bayesian networks, and to obtain insights on average properties of such networks. Any method that generates Bayesian networks must first generate directed acyclic graphs (the “structure” of the network) and then,… (More)

This paper describes a generalized version of the variable elimination algorithm for Bayesian networks. Variable elimination computes the marginal probability for some specified set of variables in a network. The algorithm consists of a single pass through a list of data structures called buckets. The generalization presented here adds a second pass to the… (More)