Sciweavers

5046 search results - page 78 / 1010
» Feature Selection from Huge Feature Sets
Sort
View
ICASSP
2008
IEEE
16 years 24 days ago
Discriminative feature selection for hidden Markov models using Segmental Boosting
We address the feature selection problem for hidden Markov models (HMMs) in sequence classification. Temporal correlation in sequences often causes difficulty in applying featur...
Pei Yin, Irfan A. Essa, Thad Starner, James M. Reh...
ICML
2001
IEEE
16 years 7 months ago
Filters, Wrappers and a Boosting-Based Hybrid for Feature Selection
In this paper, we examine the advantages and disadvantages of filter and wrapper methods for feature selection and propose a new hybrid algorithm that uses boosting and incorporat...
Sanmay Das
ESANN
2007
15 years 7 months ago
Feature clustering and mutual information for the selection of variables in spectral data
Spectral data often have a large number of highly-correlated features, making feature selection both necessary and uneasy. A methodology combining hierarchical constrained clusteri...
Catherine Krier, Damien François, Fabrice R...
IJCV
2008
192views more  IJCV 2008»
15 years 6 months ago
Learning to Locate Informative Features for Visual Identification
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...
ICASSP
2011
IEEE
14 years 10 months ago
Exemplar-based Sparse Representation phone identification features
Exemplar-based techniques, such as k-nearest neighbors (kNNs) and Sparse Representations (SRs), can be used to model a test sample from a few training points in a dictionary set. ...
Tara N. Sainath, David Nahamoo, Bhuvana Ramabhadra...