97 search results - page 10 / 20 » Polynomial to Linear: Efficient Classification with Conjunct... |
160
click to vote
NIPS
2008
15 years 5 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
137
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
148
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
2877
Voted
CVPR
2011
IEEE
15 years 9 days ago
2011
IEEE
Kernel descriptors provide a unified way to generate rich visual feature sets by turning pixel attributes into patch-level features, and yield impressive results on many object rec...
152
Voted
ML
2002
ACM
15 years 3 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...