Sciweavers

1651 search results - page 3 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ICSM
2002
IEEE
13 years 10 months ago
Measuring Software Functional Size: Towards an Effective Measurement of Complexity
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the most popular functional size measurement methods. In this paper, we recall some we...
De Tran-Cao, Ghislain Lévesque, Alain Abran
ICPR
2002
IEEE
14 years 6 months ago
Object Detection in Images: Run-Time Complexity and Parameter Selection of Support Vector Machines
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
Nicola Ancona, Grazia Cicirelli, Ettore Stella, Ar...
JMLR
2006
107views more  JMLR 2006»
13 years 5 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
ACCV
2006
Springer
13 years 7 months ago
Learning Multi-category Classification in Bayesian Framework
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
Atul Kanaujia, Dimitris N. Metaxas
ICPR
2004
IEEE
14 years 6 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu