| 一种基于贪心算法的快速PCA算法 |
| |
| 引用本文： | 王晓伟,闫德勤,唐祚. 一种基于贪心算法的快速PCA算法[J]. 微型机与应用, 2013, 0(19): 72-75,78 |
| |
| 作者姓名： | 王晓伟 闫德勤 唐祚 |
| |
| 作者单位： | 辽宁师范大学计算机技术与信息学院,辽宁大连116081 |
| |
| 基金项目： | 国家自然科学基金项目（61105085） |
| |
| 摘 要： | 提出一种快速算法，该算法利用贪心算法构造卷数据降维矩阵，在保持点与点之间“核距离”不变的情况下．把待分解矩阵变换成一个低维矩阵。在没有偏差的情况下，将对原始大矩阵的分解变成对这个低维矩阵的分解，大幅降低了时间复杂度，减少了对内存的使用率的同时增加了算法的稳定性。
|
| 关 键 词： | 主成分分析 贪心算法 卷数据降维矩阵 时间复杂度 |
A new fast principal component analysis based on greedy algorithm |
| |
| Wang Xiaowei,Yan Deqin,Tang Zuo. A new fast principal component analysis based on greedy algorithm[J]. Microcomputer & its Applications, 2013, 0(19): 72-75,78 |
| |
| Authors: | Wang Xiaowei Yan Deqin Tang Zuo |
| |
| Affiliation: | (Computer Technology and Information Institute, Liaoning Normal University, Dalian 116081, China) |
| |
| Abstract: | The authors present a fast algorithm that uses the greedy algorithm to make wrapped dimensionality reduction data matrix in order to keep ＂nuclear distance＂ between points unchanged. The original matrix needed to be decomposed has been transformed into a low-dimensional matrix in the case of no deviation. Therefore we significantly reduce the time complexity and memory usage while increasing the stability of the algorithm. |
| |
| Keywords: | PCA（Principal Component Analysis） greedy algorithm wrapped dimensionality reduction data matrix time complexity |
| 本文献已被 维普 等数据库收录！ |
