Sciweavers

836 search results - page 43 / 168
» On the Complexity of Train Assignment Problems
Sort
View
JMLR
2012
13 years 6 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
ICPR
2004
IEEE
16 years 4 months ago
A Consistency-Based Model Selection for One-Class Classification
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
David M. J. Tax, Klaus-Robert Müller
182
Voted
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 3 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
143
Voted
COLT
1995
Springer
15 years 7 months ago
Regression NSS: An Alternative to Cross Validation
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
Michael P. Perrone, Brian S. Blais
137
Voted
ICIP
2009
IEEE
16 years 4 months ago
Face Recognition Using Sift Features
Face recognition has many important practical applications, like surveillance and access control. It is concerned with the problem of correctly identifying face images and assigni...