Sciweavers

1651 search results - page 47 / 331
» Measuring the Complexity of Classification Problems
Sort
View
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
PRICAI
2010
Springer
13 years 5 months ago
Sparse Representation: Extract Adaptive Neighborhood for Multilabel Classification
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
Shuo Xiang, Songcan Chen, Lishan Qiao
COLING
2008
13 years 9 months ago
Choosing the Right Translation: A Syntactically Informed Classification Approach
One style of Multi-Engine Machine Translation architecture involves choosing the best of a set of outputs from different systems. Choosing the best translation from an arbitrary s...
Simon Zwarts, Mark Dras
TCBB
2011
13 years 2 months ago
Ensemble Learning with Active Example Selection for Imbalanced Biomedical Data Classification
—In biomedical data, the imbalanced data problem occurs frequently and causes poor prediction performance for minority classes. It is because the trained classifiers are mostly d...
Sangyoon Oh, Min Su Lee, Byoung-Tak Zhang
COLT
2008
Springer
13 years 9 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri