首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种适用于处理中药指纹图谱数据的主成分正交分解算法
引用本文:朱尔一,王小如.一种适用于处理中药指纹图谱数据的主成分正交分解算法[J].厦门大学学报(自然科学版),2005,44(6):884-885.
作者姓名:朱尔一  王小如
作者单位:厦门大学化学化工学院,现代分析科学教育部重点实验室.福建,厦门,361005
基金项目:福建省自然科学基金(C0210006)和福建中药GAP关键技术研究基金(2002Y024)资助
摘    要:中药指纹图谱数据具有变量数很大而样本数较小的特点,本文中采用拉格朗日求极值的方法得到一种新的适合用于处理这类数据的主成分正交分解算法.结果表明:所得到新的算法,在处理中药指纹图谱数据时,与传统的主成分分析算法比较,节省存储单元,计算量小,计算速度快,因而计算效率高.

关 键 词:主成分分析  指纹图谱  判别分析
文章编号:0438-0479(2005)06-0884-02
收稿时间:11 19 2004 12:00AM
修稿时间:2004年11月19

An Orthogonal Expansion Algorithm of Principal Component Suitable to Deal with the Fingerprinting Data of Chinese Medicine
ZHU Er-yi,WANG Xiao-ru.An Orthogonal Expansion Algorithm of Principal Component Suitable to Deal with the Fingerprinting Data of Chinese Medicine[J].Journal of Xiamen University(Natural Science),2005,44(6):884-885.
Authors:ZHU Er-yi  WANG Xiao-ru
Institution:College of Chemistry and Chemical Engineering,Key Lab. of Analytical Sciences of the MOE, Xiamen University, Xiamen 361005, China
Abstract:The fingerprinting data sets of Chinese medicine are the data sets with large number of variables and few objects. A new kind of orthogonal expansion algorithm of Principal Component that is suitable to deal with this kind of data sets has been obtained by use of the Lagrange method of solving extremum problem in this paper. The results indicate that by comparing with the traditional Principal Component Analysis algorithm the new presented algorithm is memory-saving, with small amount of calculation, fast and effective when dealing with the fingerprinting data of Chinese medicine or the data with large number of variables and few objects.
Keywords:principal component analysis  fingerprinting  discrimination analysis
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号