Sciweavers

6715 search results - page 262 / 1343
» Learning from a Test Set
Sort
View
NIPS
2003
15 years 5 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
TAL
2010
Springer
15 years 2 months ago
Robust Semi-supervised and Ensemble-Based Methods in Word Sense Disambiguation
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...
Anders Søgaard, Anders Johannsen
DLOG
1998
15 years 5 months ago
Learning Composite Concepts
This paper proposes a framework to learn concepts from di erent kinds of observations. We de ne a language to describe meta-concepts, that represent the sets of possible concepts ...
Patrick Lambrix, Pierpaolo Larocchia
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 4 months ago
Agnostic Active Learning Without Constraints
We present and analyze an agnostic active learning algorithm that works without keeping a version space. This is unlike all previous approaches where a restricted set of candidate...
Alina Beygelzimer, Daniel Hsu, John Langford, Tong...
BIRTHDAY
1997
Springer
15 years 8 months ago
The Job Assignment Problem: A Study in Parallel and Distributed Machine Learning
This article describes a parallel and distributed machine learning approach to a basic variant of the job assignment problem. The approach is in the line of the multiagent learning...
Gerhard Weiß