Sciweavers

1651 search results - page 8 / 331
» Measuring the Complexity of Classification Problems
Sort
View
IJSI
2010
84views more  IJSI 2010»
13 years 6 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
DAM
2008
83views more  DAM 2008»
13 years 7 months ago
Multi-group support vector machines with measurement costs: A biobjective approach
Support Vector Machine has shown to have good performance in many practical classification settings. In this paper we propose, for multi-group classification, a biobjective optimi...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...
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...
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
ML
2000
ACM
185views Machine Learning» more  ML 2000»
13 years 7 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih