Sciweavers

1036 search results - page 95 / 208
» Algorithms for Learning Regular Expressions
Sort
View
ICASSP
2010
IEEE
14 years 11 months ago
Efficient online learning with individual learning-rates for phoneme sequence recognition
We describe a fast and efficient online algorithm for phoneme sequence speech recognition. Our method is using a discriminative training to update the model parameters one utteran...
Koby Crammer
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 8 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
SDM
2009
SIAM
154views Data Mining» more  SDM 2009»
15 years 10 months ago
AMORI: A Metric-Based One Rule Inducer.
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
Niklas Lavesson, Paul Davidsson
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 7 months ago
Stability of Feature Selection Algorithms
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...
IJON
2010
178views more  IJON 2010»
15 years 2 days ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen