Sciweavers

869 search results - page 119 / 174
» MicroARTMAP for pattern recognition problems
Sort
View
MCS
2002
Springer
15 years 6 days ago
A Discussion on the Classifier Projection Space for Classifier Combining
In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variabilit...
Elzbieta Pekalska, Robert P. W. Duin, Marina Skuri...
TCBB
2008
103views more  TCBB 2008»
15 years 14 days ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
88
Voted
PRL
2002
70views more  PRL 2002»
15 years 6 days ago
On the use of nearest feature line for speaker identification
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...
Ke Chen 0001, Ting-Yao Wu, HongJiang Zhang
89
Voted
DAGM
1995
Springer
15 years 4 months ago
Learning Weights in Discrimination Functions Using a priori Constraints
We introduce a learning algorithm for the weights in a very common class of discrimination functions usually called weighted average". Di erent submodules are produced by som...
Norbert Krüger
PR
2008
129views more  PR 2008»
15 years 15 days ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park