Sciweavers

3837 search results - page 8 / 768
» Learning Approximate Consistencies
Sort
View
ECAI
2010
Springer
14 years 6 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
INTERSPEECH
2010
14 years 4 months ago
Bayesian speaker recognition using Gaussian mixture model and laplace approximation
This paper presents a Bayesian approach for Gaussian mixture model (GMM)-based speaker identification. Some approaches evaluate the speaker score of a test speech utterance using ...
Shih-Sian Cheng, I-Fan Chen, Hsin-Min Wang
EUROCOLT
1999
Springer
15 years 1 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
ICML
2009
IEEE
15 years 10 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
ICML
2003
IEEE
15 years 10 months ago
BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
Vincent Conitzer, Tuomas Sandholm