Sciweavers

1772 search results - page 2 / 355
» Classifying Problems into Complexity Classes
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
Preliminary approach on synthetic data sets generation based on class separability measure
Usually, performance of classifiers is evaluated on real-world problems that mainly belong to public repositories. However, we ignore the inherent properties of these data and how...
Núria Macià, Ester Bernadó-Ma...
ICPR
2008
IEEE
14 years 8 months ago
Efficient implementation of SVM for large class problems
Multiclass classification is an important problem in pattern recognition. Hierarchical SVM classifiers such as DAG-SVM and BHC-SVM are popular in solving multiclass problems. Howe...
Prabakaran Ilayaraja, N. V. Neeba, C. V. Jawahar
CIE
2006
Springer
13 years 11 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
AAI
2006
110views more  AAI 2006»
13 years 7 months ago
Evaluation of Classifiers for an Uneven Class Distribution Problem
Classification problems with uneven class distributions present several difficulties during the training as well as during the evaluation process of classifiers. A classification ...
Sophia Daskalaki, Ioannis Kopanas, Nikolaos M. Avo...
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 7 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik