Sciweavers

243 search results - page 20 / 49
» Learning Classifiers from Distributed, Ontology-Extended Dat...
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
EMNLP
2006
13 years 9 months ago
Domain Adaptation with Structural Correspondence Learning
Discriminative learning methods are widely used in natural language processing. These methods work best when their training and test data are drawn from the same distribution. For...
John Blitzer, Ryan T. McDonald, Fernando Pereira
DMIN
2007
186views Data Mining» more  DMIN 2007»
13 years 9 months ago
Cost-Sensitive Learning vs. Sampling: Which is Best for Handling Unbalanced Classes with Unequal Error Costs?
- The classifier built from a data set with a highly skewed class distribution generally predicts the more frequently occurring classes much more often than the infrequently occurr...
Gary M. Weiss, Kate McCarthy, Bibi Zabar
ICCV
2005
IEEE
14 years 9 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
PAMI
2008
119views more  PAMI 2008»
13 years 7 months ago
Triplet Markov Fields for the Classification of Complex Structure Data
We address the issue of classifying complex data. We focus on three main sources of complexity, namely, the high dimensionality of the observed data, the dependencies between these...
Juliette Blanchet, Florence Forbes