Discriminative model

Discriminative model

Discriminative models are a class of models used in machine learning for modeling the dependence of an unobserved variable y on an observed variable x. Within a statistical framework, this is done by modeling the conditional probability distribution P(y | x), which can be used for predicting y from x.

Discriminative models differ from generative models in that they do not allow one to generate samples from the joint distribution of x and y. However, for tasks such as classification and regression that do not require the joint distribution, discriminative models generally yield superior performance. On the other hand, generative models are typically more flexible than discriminative models in expressing dependencies in complex learning tasks. In addition, most discriminative models are inherently supervised and cannot easily be extended to unsupervised learning.

Examples of discriminative models used in machine learning include:

See also


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Model of Hierarchical Complexity — The model of hierarchical complexity is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… …   Wikipedia

  • Bag of words model in computer vision — This is an article introducing the Bag of words model (BoW) in computer vision, especially for object categorization. From now, the BoW model refers to the BoW model in computer vision unless explicitly declared.Before introducing the BoW model,… …   Wikipedia

  • Generative model — In statistics, a generative model is a model for randomly generating observed data, typically given some hidden parameters. It specifies a joint probability distribution over observation and label sequences. Generative models are used in machine… …   Wikipedia

  • Maximum-entropy Markov model — MEMM redirects here. For the German Nordic combined skier, see Silvio Memm. In machine learning, a maximum entropy Markov model (MEMM), or conditional Markov model (CMM), is a graphical model for sequence labeling that combines features of hidden …   Wikipedia

  • Linear classifier — In the field of machine learning, the goal of classification is to group items that have similar feature values, into groups. A linear classifier achieves this by making a classification decision based on the value of the linear combination of… …   Wikipedia

  • Fisher kernel — In mathematics, the Fisher kernel, named in honour of Sir Ronald Fisher, is a kernel. It was introduced in 1998 by Tommi Jaakkola [ Exploiting Generative Models in Discriminative Classifiers (1998) [http://people.csail.mit.edu/tommi/papers/gendisc… …   Wikipedia

  • animal learning — ▪ zoology Introduction       the alternation of behaviour as a result of individual experience. When an organism can perceive and change its behaviour, it is said to learn.       That animals can learn seems to go without saying. The cat that… …   Universalium

  • Constrained Conditional Models — A Constrained Conditional Model (CCM) is a machine learning and inference framework that augments the learning of conditional (probabilistic or discriminative) models with declarative constraints. The constraint can be used as a way to… …   Wikipedia

  • Clasificador lineal — En el campo del aprendizaje automático, el objetivo del aprendizaje supervisado es usar las características de un objeto para identificar a qué clase (o grupo) pertenece. Un clasificador lineal logra esto tomando una decisión de clasificación… …   Wikipedia Español

  • Experimental analysis of behavior — The experimental analysis of behavior is the name given to school of psychology founded by B. F. Skinner, and based on his philosophy of radical behaviorism. A central principle was the inductive, data driven [Chiesa, Mecca: Radical Behaviorism:… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”