1651 search results - page 17 / 331 » Measuring the Complexity of Classification Problems |
AISC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
ICGI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
TEC
2010
13 years 2 months ago
2010
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
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...
CISSE
2009
Springer
13 years 11 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...