期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
取值于局部凸空间中的抽象绝对连续函数 被引量:1
1
作者 吴从炘 薛小平 《数学年刊(A辑)》 CSCD 北大核心 1991年第B06期84-86,共3页
本文在局部凸空间中引入各种抽象绝对连续函数,探讨它们之间的关系,并且用以刻划几类重要的局部凸空间。
关键词 半核空间 算子 BANACH空间 局部凸空间 抽象函数 绝对连续函数
下载PDF
Liouville theorems for an integral system with Poisson kernel on the upper half space 被引量:1
2
作者 DOU Jing Bo ZHANG Xiang 《Science China Mathematics》 SCIE CSCD 2016年第7期1367-1382,共16页
We investigate the Liouville theorem for an integral system with Poisson kernel on the upper half space R+n,{u(x) =2/(nωn)∫?R+n(xnf(v(y)))/(|x- y|n)dy, x ∈R+n,v(y) =2/(nωn)∫R+n(xng(u(x)))/(... We investigate the Liouville theorem for an integral system with Poisson kernel on the upper half space R+n,{u(x) =2/(nωn)∫?R+n(xnf(v(y)))/(|x- y|n)dy, x ∈R+n,v(y) =2/(nωn)∫R+n(xng(u(x)))/(|x- y|n)dx, y ∈?R+n,where n 3, ωn is the volume of the unit ball in Rn. This integral system arises from the Euler-Lagrange equation corresponding to an integral inequality on the upper half space established by Hang et al.(2008).With natural structure conditions on f and g, we classify the positive solutions of the above system based on the method of moving spheres in integral form and the inequality mentioned above. 展开更多
关键词 Poisson kernel method of moving spheres regularity Kelvin transformation Liouville theorem
原文传递
Generalization errors of Laplacian regularized least squares regression 被引量:2
3
作者 CAO Ying CHEN DiRong 《Science China Mathematics》 SCIE 2012年第9期1859-1868,共10页
Semi-supervised learning is an emerging computational paradigm for machine learning,that aims to make better use of large amounts of inexpensive unlabeled data to improve the learning performance.While various methods... Semi-supervised learning is an emerging computational paradigm for machine learning,that aims to make better use of large amounts of inexpensive unlabeled data to improve the learning performance.While various methods have been proposed based on different intuitions,the crucial issue of generalization performance is still poorly understood.In this paper,we investigate the convergence property of the Laplacian regularized least squares regression,a semi-supervised learning algorithm based on manifold regularization.Moreover,the improvement of error bounds in terms of the number of labeled and unlabeled data is presented for the first time as far as we know.The convergence rate depends on the approximation property and the capacity of the reproducing kernel Hilbert space measured by covering numbers.Some new techniques are exploited for the analysis since an extra regularizer is introduced. 展开更多
关键词 semi-supervised learning graph Laplemian covering number learning rate
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部