期刊文献+

间接光滑逼近

Indirect smooth approximation
下载PDF
导出
摘要 改进了链接超平面模型,并在找链接算法的基础上给出了一个处处光滑的间接光滑逼近算法.该算法在保持找链接算法简洁这一优势的同时,给出了处处光滑的逼近结果.且这一算法可以用于任意维空间. The hinging hyperplanes model is improved and an indirect smooth approximation algorithm based on hinge-finding algorithm is proposed. The algorithm can obtain a smooth approximation result, and in the meantime it holds the simplicity and the effectiveness of hinge-finding algorithm. Moreover the algorithm can be used in any high dimensional space.
作者 李星野 王玺
出处 《上海理工大学学报》 EI CAS 北大核心 2005年第1期63-67,共5页 Journal of University of Shanghai For Science and Technology
关键词 分片线性 非线性逼近 光滑逼近 找链接算法 piecewise linear nonlinear approximation smooth approximation hinge-finding algorithm
  • 相关文献

参考文献5

  • 1Breiman L. Hinging hyperplanes for regression, classification and function approximation [ J ]. IEEE Transaction on Information Theory, 1993,39(3):999~1 013.
  • 2Pucar P, Sjoberg J. On the hinge-finding algorithm for hinging hyperplanes[J]. IEEE Transaction on In formation Theory,1998,44(3):1 310~1 319.
  • 3Julian P,Jordan M, Desages A. Canonical piecewise-linear approximation of Smooth Functions[J]. IEEE Transaction on Circuits and Systems,1998,45(5) :567~571.
  • 4Kang S M, Chua L O. A global representation of multidimensional piecewise linear functions with linear partitions[J]. IEEE Transaction on Circuits and Systems, 1978,25(11) :938~940.
  • 5Lin J N, Unbehauen R. Canonical piecewise-linear approximations[J]. IEEE Transaction on Circuits and Systems, 1992,39 (8): 697~ 699.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部