Sciweavers

1766 search results - page 16 / 354
» Classifier Selection Based on Data Complexity Measures
Sort
View
PRL
2008
213views more  PRL 2008»
13 years 7 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
BMCBI
2010
161views more  BMCBI 2010»
13 years 4 months ago
Addressing the Challenge of Defining Valid Proteomic Biomarkers and Classifiers
Background: The purpose of this manuscript is to provide, based on an extensive analysis of a proteomic data set, suggestions for proper statistical analysis for the discovery of ...
Mohammed Dakna, Keith Harris, Alexandros Kalousis,...
DEXA
2003
Springer
91views Database» more  DEXA 2003»
14 years 19 days ago
NLC: A Measure Based on Projections
In this paper, we propose a new feature selection criterion. It is based on the projections of data set elements onto each attribute. The main advantages are its speed and simplici...
Roberto Ruiz, José Cristóbal Riquelm...
ICML
2006
IEEE
14 years 8 months ago
How boosting the margin can also boost classifier complexity
Boosting methods are known not to usually overfit training data even as the size of the generated classifiers becomes large. Schapire et al. attempted to explain this phenomenon i...
Lev Reyzin, Robert E. Schapire
ADBIS
2009
Springer
101views Database» more  ADBIS 2009»
13 years 11 months ago
Temporal Data Classification Using Linear Classifiers
Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that descri...
Peter Z. Revesz, Thomas Triplet