Sciweavers

337 search results - page 2 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
JMLR
2006
93views more  JMLR 2006»
13 years 7 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
ICMLA
2009
13 years 5 months ago
Discovering Characterization Rules from Rankings
For many ranking applications we would like to understand not only which items are top-ranked, but also why they are top-ranked. However, many of the best ranking algorithms (e.g....
Ansaf Salleb-Aouissi, Bert C. Huang, David L. Walt...
KDD
2002
ACM
160views Data Mining» more  KDD 2002»
14 years 7 months ago
Scaling multi-class support vector machines using inter-class confusion
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
Shantanu Godbole, Sunita Sarawagi, Soumen Chakraba...
CVPR
2006
IEEE
14 years 9 months ago
Shape Topics: A Compact Representation and New Algorithms for 3D Partial Shape Retrieval
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...
Yi Liu, Hongbin Zha, Hong Qin
ROCAI
2004
Springer
14 years 21 days ago
Optimizing Area Under Roc Curve with SVMs
For many years now, there is a growing interest around ROC curve for characterizing machine learning performances. This is particularly due to the fact that in real-world problems ...
Alain Rakotomamonjy