Name
Abstract | ||
|---|---|---|
A generalized optimal set of discriminant vectors for linear feature extraction is presented. First, the criteria of selecting the generalized optimal discriminant vectors are introduced, and then a unified solving method is derived to solve the vectors of the generalized optimal set in both cases of a large number of samples and a small number of samples. The experimental results show that the present method is superior to the Foley-Sammon method (Foley and Sammon, IEEE Trans. Comput.24, 281–289 (1975)), the positive pseudoinverse method (Tian et al., Opt. Engng25(7), 834–839 (1986)), the perturbation method (Hong and Yang, Pattern Recognition24, 317–324 (1991)), and the matrix rank decomposition method (Cheng et al., Pattern Recognition25, 101–111 (1992)) in terms of correct classification rate. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0031-3203(92)90136-7 | Pattern Recognition |
Keywords | Field | DocType |
Optimal discriminant vector,Discriminant plane,Pattern classification,Feature extraction,Classifier design | Optimal discriminant analysis,Small number,Rank (linear algebra),Pattern recognition,Discriminant,Moore–Penrose pseudoinverse,Decomposition method (constraint satisfaction),Feature extraction,Artificial intelligence,Linear discriminant analysis,Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
25 | 7 | 0031-3203 |
Citations | PageRank | References |
64 | 8.53 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ke Liu | 1 | 247 | 45.43 |
| Yong-Qing Cheng | 2 | 310 | 57.01 |
| Jing-yu Yang | 3 | 6061 | 345.83 |