Sciweavers

2031 search results - page 151 / 407
» Non-symmetric Support Vector Machines
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims
ECML
2004
Springer
14 years 1 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
ICIP
2010
IEEE
13 years 5 months ago
Natural DCT statistics approach to no-reference image quality assessment
General-purpose no-reference image quality assessment approaches still lag the advances in full-reference methods. Most no-reference methods are either distortion specific (i.e. t...
Michele A. Saad, Alan C. Bovik, Christophe Charrie...
COLING
2010
13 years 3 months ago
Shallow Information Extraction from Medical Forum Data
We study a novel shallow information extraction problem that involves extracting sentences of a given set of topic categories from medical forum data. Given a corpus of medical fo...
Parikshit Sondhi, Manish Gupta, ChengXiang Zhai, J...
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
14 years 8 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims