744 search results - page 70 / 149 » Information-theoretic metric learning |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
In the past years, the theory and practice of machine learning and data mining have been focused on static and finite data sets from where learning algorithms generate a static m...
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of predicting how a user will continue a given initial text fragment. Intuitively, our goal is to develop a “tab-complete” function for natura...
TIT
1998
14 years 9 months ago
1998
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Current semi-supervised incremental learning approaches select unlabeled examples with predicted high confidence for model re-training. We show that for many applications this dat...