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

基于内核的低秩逼近算法的改进
引用本文:高超.基于内核的低秩逼近算法的改进[J].哈尔滨商业大学学报(自然科学版),2013(6):691-693.
作者姓名:高超
作者单位:哈尔滨工程大学信息与通信工程学院,哈尔滨150001
摘    要:为进一步提高低秩逼近技术的逼近精度,提出了一种改进的基于内核的低秩逼近算法(IK-BLA).算法利用在数值上呈现递减规律的、与矩阵列相关的非均匀概率分布函数对大规模n×n矩阵W进行抽样,接着用抽样得到的小规模c×c矩阵W逼近矩阵W.在UCI数据库中部分数据集上的实验验证了IKBLA的有效性.

关 键 词:低秩逼近技术  逼近精度  递减规律  非均匀概率分布

Improved kernel-based algorithm using low-rank approximation
GAO Chao.Improved kernel-based algorithm using low-rank approximation[J].Journal of Harbin University of Commerce :Natural Sciences Edition,2013(6):691-693.
Authors:GAO Chao
Institution:GAO Chao (School of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China)
Abstract:In order to further improve the approximation accuracy of low rank approximation technique, an improved kernel-based algorithm using low-rank approximation method (IK- BLA) was proposed in this paper. IKBLA used a matrix columns-dependent non-uniform probability distribution with values subjecting to the law of diminishing to sample the large scale n x n matrix W. Next, approach the matrix W with small scale c x c matrix 17V. Experi- ments in some datasets in UCI database showed the effectiveness of IKBLA.
Keywords:low-rank approximation method  approximation accuracy  law of diminishing  non-uniform probability distribution
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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