期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
支持向量机的关键问题和展望 被引量:21
1
作者 邵元海 刘黎明 +1 位作者 黄凌伟 邓乃扬 《中国科学:数学》 CSCD 北大核心 2020年第9期1233-1248,共16页
作为机器学习的主要方法之一,支持向量机不仅有坚实的统计学习理论基础,而且在众多领域中表现出优秀的泛化性能,因此受到了广泛关注.然而近几年来,相比于深度学习的蓬勃发展,支持向量机的研究进展缓慢.本文从支持向量机的本质出发,探讨... 作为机器学习的主要方法之一,支持向量机不仅有坚实的统计学习理论基础,而且在众多领域中表现出优秀的泛化性能,因此受到了广泛关注.然而近几年来,相比于深度学习的蓬勃发展,支持向量机的研究进展缓慢.本文从支持向量机的本质出发,探讨支持向量机的理论方法与深度学习等机器学习热点研究的交叉与融合,提出一些新的思路.具体地,包括3个方面:支持向量机的大间隔原则及其带来的低密度性、核映射的高维划分技巧及其统计学习理论,以及支持向量机的浅层学习模式向深度学习和广度学习的拓展.同时,从这3个方面分别提出支持向量机研究中可以进一步挖掘的优良性质,并展望未来可能诱导出的理论和方法. 展开更多
关键词 支持向量机 统计学习 核学习 机器学习 最优化 深度学习
原文传递
SEQUENCE-BASED PROTEIN-PROTEIN INTERACTION PREDICTION VIA SUPPORT VECTOR MACHINE 被引量:1
2
作者 Yongcui WANG Jiguang WANG +1 位作者 Zhixia YANG naiyang deng 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2010年第5期1012-1023,共12页
This paper develops sequence-based methods for identifying novel protein-protein interactions (PPIs) by means of support vector machines (SVMs). The authors encode proteins ont only in the gene level but also in t... This paper develops sequence-based methods for identifying novel protein-protein interactions (PPIs) by means of support vector machines (SVMs). The authors encode proteins ont only in the gene level but also in the amino acid level, and design a procedure to select negative training set for dealing with the training dataset imbalance problem, i.e., the number of interacting protein pairs is scarce relative to large scale non-interacting protein pairs. The proposed methods are validated on PPIs data of Plasmodium falciparum and Escherichia coli, and yields the predictive accuracy of 93.8% and 95.3%, respectively. The functional annotation analysis and database search indicate that our novel predictions are worthy of future experimental validation. The new methods will be useful supplementary tools for the future proteomics studies. 展开更多
关键词 Imbalance problem protein-protein interactions sequence-based support vector machine.
原文传递
Can Newton method be surpassed
3
作者 naiyang deng Zhaozhi Wang 《Chinese Science Bulletin》 SCIE EI CAS 1999年第2期132-134,共3页
A local algorithm is proposed for unconstrained optimization problem. Compared with the traditional Newton method with Choleski factorization, this algorithm has the same quadratic convergence. But its computation cos... A local algorithm is proposed for unconstrained optimization problem. Compared with the traditional Newton method with Choleski factorization, this algorithm has the same quadratic convergence. But its computation cost per iteration in average is less when the dimension n≥55. The saving is estimated in the theoretical framework. 展开更多
关键词 NEWTON METHOD Choleski FACTORIZATION preconditioned CONJUGATE GRADIENT method.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部