Linear boundary discriminant analysis based on QR decomposition
Pattern Analysis and Applications(2012)
摘要
Linear boundary discriminant analysis (LBDA) shows good feature extraction performance in the classification problem. However, LBDA suffers from small sample size (SSS) problem and the computation time of it increases exponentially for datasets that are not sufficiently large compared with the number of features. To release these problems, we reformulate LBDA using QR decomposition, and this results in both reducing computation time and resolving SSS problem while classification performance is maintained.
更多查看译文
关键词
Linear boundary discriminant analysis,QR decomposition,computation time
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要