421 search results - page 58 / 85 » Reducing Label Complexity by Learning From Bags |
101
click to vote
JMLR
2011
14 years 4 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Class syntax can be used to 1) model temporal or locational evolvement of class labels of feature observation sequences, 2) correct classification errors of static classifiers if ...
96
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
125
click to vote
MICCAI
2000
Springer
15 years 1 months ago
2000
Springer
We present a novel approach to statistical shape analysis of anatomical structures based on small sample size learning techniques. The high complexity of shape models used in medic...