Sciweavers

836 search results - page 63 / 168
» On the Complexity of Train Assignment Problems
Sort
View
148
Voted
PRL
2011
14 years 11 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
ICML
2001
IEEE
16 years 4 months ago
Round Robin Rule Learning
In this paper, we discuss a technique for handling multi-class problems with binary classifiers, namely to learn one classifier for each pair of classes. Although this idea is kno...
Johannes Fürnkranz
FSS
2002
84views more  FSS 2002»
15 years 3 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
15 years 8 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
CVPR
2004
IEEE
16 years 6 months ago
Sharing Features: Efficient Boosting Procedures for Multiclass Object Detection
We consider the problem of detecting a large number of different object classes in cluttered scenes. Traditional approaches require applying a battery of different classifiers to ...
Antonio B. Torralba, Kevin P. Murphy, William T. F...