Optimal vs. Classical Linear Dimension Reduction
| dc.contributor.author | Röhl, Michael C. | de |
| dc.contributor.author | Weihs, Claus | de |
| dc.date.accessioned | 2004-12-06T18:38:33Z | |
| dc.date.available | 2004-12-06T18:38:33Z | |
| dc.date.issued | 1998 | de |
| dc.description.abstract | We describe a computer intensive method for linear dimension reduction which minimizes the classification error directly. Simulated annealing (Bohachevsky et al. (1986)) is used to solve this problem. The classification error is determined by an exact integration. We avoid distance or scatter measures which are only surrogates to circumvent the classification error. Simulations (in two dimensions) and analytical approximations demonstrate the superiority of optimal classification opposite to the classical procedures. We compare our procedure to the well-known canonical discriminant analysis (homoscedastic case) as described in Mc Lachlan (1992) and to a method by Young et al. (1987) for the heteroscedastic case. Special emphasis is put on the case when the distance based methods collapse. The computer intensive algorithm always achieves minimal classification error. | en |
| dc.format.extent | 248607 bytes | |
| dc.format.extent | 308298 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/4854 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-5423 | |
| dc.language.iso | en | de |
| dc.publisher | Universitätsbibliothek Dortmund | de |
| dc.subject.ddc | 310 | de |
| dc.title | Optimal vs. Classical Linear Dimension Reduction | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | en |
| dcterms.accessRights | open access |