1197 search results - page 1 / 240 » Classification with partial labels |
KDD
2008
ACM
14 years 4 months ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
NIPS
2001
13 years 5 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
KDD
2009
ACM
14 years 4 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
IJDAR
2008
13 years 4 months ago
2008
For character recognition in document analysis, some classes are closely overlapped but are not necessarily to be separated before contextual information is exploited. For classifi...