Sciweavers

399 search results - page 51 / 80
» Robust Boosting for Learning from Few Examples
Sort
View
JMLR
2010
147views more  JMLR 2010»
14 years 4 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
ICCV
2009
IEEE
16 years 2 months ago
Unlabeled data improves word prediction
Labeling image collections is a tedious task, especially when multiple labels have to be chosen for each image. In this paper we introduce a new framework that extends state of ...
Nicolas Loeff, Ali Farhadi, Ian Endres and David A...
KDD
2010
ACM
218views Data Mining» more  KDD 2010»
15 years 1 months ago
Online multiscale dynamic topic models
We propose an online topic model for sequentially analyzing the time evolution of topics in document collections. Topics naturally evolve with multiple timescales. For example, so...
Tomoharu Iwata, Takeshi Yamada, Yasushi Sakurai, N...
DELFI
2006
14 years 11 months ago
Mobile Learning is Coming of Age - What we have and what we still miss
: Mobile learning has left the status of a new born child. It is time now to implement some structure into the complex and various activities by a framework presented in this paper...
Dirk Frohberg
DMIN
2007
226views Data Mining» more  DMIN 2007»
14 years 11 months ago
Generative Oversampling for Mining Imbalanced Datasets
— One way to handle data mining problems where class prior probabilities and/or misclassification costs between classes are highly unequal is to resample the data until a new, d...
Alexander Liu, Joydeep Ghosh, Cheryl Martin