Sciweavers

199 search results - page 24 / 40
» A general agnostic active learning algorithm
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Learning to rank from a noisy crowd
We study how to best use crowdsourced relevance judgments learning to rank [1, 7]. We integrate two lines of prior work: unreliable crowd-based binary annotation for binary classi...
Abhimanu Kumar, Matthew Lease
MM
2005
ACM
139views Multimedia» more  MM 2005»
14 years 1 months ago
Multimodal affect recognition in learning environments
We propose a multi-sensor affect recognition system and evaluate it on the challenging task of classifying interest (or disinterest) in children trying to solve an educational pu...
Ashish Kapoor, Rosalind W. Picard
ITICSE
2010
ACM
13 years 11 months ago
Helping students build a mental model of computation
Introductory computer science classes are known for having a high attrition rate. Some authors believe this is due to students’ difficulties in establishing a mental model of co...
Steve Kollmansberger
AAAI
2007
13 years 10 months ago
Gender-Sensitive Automated Negotiators
This paper introduces an innovative approach for automated negotiating using the gender of human opponents. Our approach segments the information acquired from previous opponents,...
Ron Katz, Sarit Kraus
CORR
2012
Springer
198views Education» more  CORR 2012»
12 years 3 months ago
Lipschitz Parametrization of Probabilistic Graphical Models
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the ￿p-norm of the parameters. We discuss several implications ...
Jean Honorio