Sciweavers

1766 search results - page 5 / 354
» Classifier Selection Based on Data Complexity Measures
Sort
View
SAC
2008
ACM
13 years 6 months ago
An efficient feature ranking measure for text categorization
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
Songbo Tan, Yuefen Wang, Xueqi Cheng
DMIN
2006
158views Data Mining» more  DMIN 2006»
13 years 8 months ago
Ensemble Selection Using Diversity Networks
- An ideal ensemble is composed of base classifiers that perform well and that have minimal overlap in their errors. Eliminating classifiers from an ensemble based on a criterion t...
Qiang Ye, Paul W. Munro
AIA
2007
13 years 8 months ago
Incremental classifier based on a local credibility criterion
In this paper we propose the Local Credibility Concept (LCC), a novel technique for incremental classifiers. It measures the classification rate of the classifier’s local mod...
Herward Prehn, Gerald Sommer
ICPR
2008
IEEE
14 years 8 months ago
The implication of data diversity for a classifier-free ensemble selection in random subspaces
Ensemble of Classifiers (EoC) has been shown effective in improving the performance of single classifiers by combining their outputs. By using diverse data subsets to train classi...
Albert Hung-Ren Ko, Robert Sabourin, Luiz E. Soare...
AAAI
2004
13 years 8 months ago
Bayesian Network Classifiers Versus k-NN Classifier Using Sequential Feature Selection
The aim of this paper is to compare Bayesian network classifiers to the k-NN classifier based on a subset of features. This subset is established by means of sequential feature se...
Franz Pernkopf