604 search results - page 9 / 121 » The Hardness of Metric Labeling |
LREC
2010
14 years 11 months ago
2010
We present the methodology that underlies new metrics for semantic machine translation evaluation that we are developing. Unlike widely-used lexical and n-gram based MT evaluation...
ISDA
2008
IEEE
15 years 3 months ago
2008
IEEE
In multi-label text databases one or more labels, or categories, can be assigned to a single document. In many such databases there can be correlation on the assignment of subsets...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
124
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Multi-instance multi-label learning (MIML) refers to the
learning problems where each example is represented by a
bag/collection of instances and is labeled by multiple labels.
...