750 search results - page 52 / 150 » Learning SVMs from Sloppily Labeled Data |
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
WWW
2011
ACM
13 years 4 months ago
2011
ACM
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
TASLP
2008
13 years 9 months ago
2008
We describe an acoustic chord transcription system that uses symbolic data to train hidden Markov models and gives best-of-class frame-level recognition results. We avoid the extre...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign l...