Markov Property in Generative Classifiers

11/12/2018
by   Gherardo Varando, et al.
0

We show that, for generative classifiers, conditional independence corresponds to linear constraints for the induced discrimination functions. Discrimination functions of undirected Markov network classifiers can thus be characterized by sets of linear constraints. These constraints are represented by a second order finite difference operator over functions of categorical variables. As an application we study the expressive power of generative classifiers under the undirected Markov property and we present a general method to combine discriminative and generative classifiers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2022

Deriving discriminative classifiers from generative models

We deal with Bayesian generative and discriminative classifiers. Given a...
research
07/04/2012

Local Markov Property for Models Satisfying Composition Axiom

The local Markov condition for a DAG to be an independence map of a prob...
research
07/04/2012

Maximum Margin Bayesian Networks

We consider the problem of learning Bayesian network classifiers that ma...
research
05/30/2023

Testing for the Markov Property in Time Series via Deep Conditional Generative Learning

The Markov property is widely imposed in analysis of time series data. C...
research
07/04/2012

Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement

Maximal ancestral graphs (MAGs) are used to encode conditional independe...
research
09/27/2011

Generative Prior Knowledge for Discriminative Classification

We present a novel framework for integrating prior knowledge into discri...
research
02/25/2013

Phoneme discrimination using KS-algebra II

KS-algebra consists of expressions constructed with four kinds operation...

Please sign up or login with your details

Forgot password? Click here to reset