Sciweavers

1772 search results - page 62 / 355
» Classifying Problems into Complexity Classes
Sort
View
87
Voted
WACV
2005
IEEE
15 years 6 months ago
Gait Verification Using Probabilistic Methods
In this paper we describe a novel method for gait based identity verification based on Bayesian classification. The verification task is reduced to a two class problem (Client or ...
Alex I. Bazin, Mark S. Nixon
154
Voted
BMCBI
2011
14 years 4 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
ICDM
2007
IEEE
103views Data Mining» more  ICDM 2007»
15 years 6 months ago
An Examination of Experimental Methodology for Classifiers of Relational Data
Experimental methodology for evaluating classification algorithms in relational (i.e., networked) data is complicated by dependencies between related data instances. We survey the...
Brian Gallagher, Tina Eliassi-Rad
DAGSTUHL
2006
15 years 1 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
128
Voted
MLDM
2007
Springer
15 years 6 months ago
Ensemble-based Feature Selection Criteria
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
Terry Windeatt, Matthew Prior, Niv Effron, Nathan ...