Sciweavers

1247 search results - page 14 / 250
» A Generalization of Jumps and Labels
Sort
View
ICML
2007
IEEE
14 years 9 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
FCT
1993
Springer
14 years 1 months ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas
NIPS
2008
13 years 10 months ago
Beyond Novelty Detection: Incongruent Events, when General and Specific Classifiers Disagree
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
Daphna Weinshall, Hynek Hermansky, Alon Zweig, Jie...
COMBINATORICS
2004
96views more  COMBINATORICS 2004»
13 years 8 months ago
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
Nicholas A. Loehr, Jeffrey B. Remmel
CSIE
2009
IEEE
14 years 3 months ago
Building a General Purpose Cross-Domain Sentiment Mining Model
Building a model using machine learning that can classify the sentiment of natural language text often requires an extensive set of labeled training data from the same domain as t...
Matthew Whitehead, Larry Yaeger